Key clustering: Difference between revisions
Content deleted Content added
m →top: Cleaning up a randomely generated list, added underlinked tag |
No1lakersfan (talk | contribs) |
||
| Line 1: | Line 1: | ||
{{Multiple issues| |
{{Multiple issues| |
||
{{Unreferenced|date=July 2017}} |
{{Unreferenced|date=July 2017}} |
||
{{Orphan|date=February 2009}} |
|||
{{Underlinked|date=June 2019}} |
{{Underlinked|date=June 2019}} |
||
}} |
}} |
||
Revision as of 01:59, 6 July 2019
 | 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[3] is claimed to have particularly poor clustering behaviour.[9]
 | This cryptography-related article is a stub. You can help Wikipedia by expanding it. |