Definition: The tendency for some collision resolution schemes to create long runs of filled slots near the hash function position of keys.
See also secondary clustering, clustering free, hash table, open addressing, clustering, linear probing, quadratic probing, double hashing, uniform hashing.
Note: Primary clustering increases average search time. Linear probing is especially susceptible to primary clustering. Clustering may be minimized with double hashing.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 18 July 2005.
HTML page formatted Wed Mar 13 12:42:46 2019.
Cite this as:
Paul E. Black, "primary clustering", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 18 July 2005. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/primaryClustering.html