(definition)
Definition: The list of locations which a method for open addressing produces as alternatives in case of a collision.
See also hash table, collision resolution scheme, clustering, uniform hashing.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 17 December 2004.
HTML page formatted Mon Sep 11 09:46:06 2006.
Cite this as:
Paul E. Black, "probe sequence", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 17 December 2004. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/probesequenc.html
