Key clustering
 | 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)
|
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]
References
- ^ Lua error in Module:Citation/CS1/Configuration at line 2083: attempt to index a boolean value. [verification needed]
- ^ Lua error in Module:Citation/CS1/Configuration at line 2083: attempt to index a boolean value. [verification needed]
 | This cryptography-related article is a stub. You can help Wikipedia by expanding it. |
Categories:
- Pages with script errors
- All pages needing factual verification
- Wikipedia articles needing factual verification from September 2019
- Articles with invalid date parameter in template
- Articles needing additional references from November 2019
- All articles needing additional references
- All Wikipedia articles needing clarification
- Key management
- Cryptography stubs