Top Qs
Timeline
Chat
Perspective
Key clustering
From Wikipedia, the free encyclopedia
Remove ads
Key or hash function should avoid clustering, the mapping of two or more keys to consecutive slots. Such clustering may cause the lookup cost to skyrocket, even if the load factor is low and collisions are infrequent. The popular multiplicative hash[1] is claimed to have particularly poor clustering behaviour.[2]
![]() | This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these messages)
|
Remove ads
References
Wikiwand - on
Seamless Wikipedia browsing. On steroids.
Remove ads