Content deleted Content added
Key clustering was wrong described as key/hash collision. The correct of clustering can be find here: https://en.wikipedia.org/wiki/Hash_table |
m →top: Cleaning up a randomely generated list, added underlinked tag |
||
Line 1:
{{Multiple issues|
{{Unreferenced|date=July 2017
{{Orphan|date=February 2009}}
Key or hash function should avoid ''[[Hash table|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<sup>[[Hash table#cite%20note-knuth-3|[3]]]</sup> is claimed to have particularly poor clustering behaviour.<sup>[[Hash table#cite%20note-%3A0-9|[9]]]</sup> ▼
{{Underlinked|date=June 2019}}
}}
▲Key or hash function should avoid ''[[Hash table|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<sup>[[Hash table#cite%20note-knuth-3|[3]]]</sup> is claimed to have particularly poor clustering behaviour.<sup>[[Hash table#cite%20note-%3A0-9|[9]]]</sup>
[[Category:Key management]]
{{crypto-stub}}
| |||