Definition: The tendency for some collision resolution schemes to create long run of filled slots away from a key hash position, e.g., along the probe sequence.
See also primary clustering, clustering free, hash table, open addressing, clustering, linear probing, quadratic probing, double hashing, uniform hashing.
Note: Secondary clustering increases average search time. Even quadratic probing is susceptible to secondary clustering since keys that have the same hash value also have the same probe sequence. Clustering may be minimized with double hashing.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 18 July 2005.
HTML page formatted Fri Mar 25 16:20:35 2011.
Cite this as:
Paul E. Black, "secondary clustering", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 18 July 2005. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/secondaryClustering.html