(algorithm)
Definition: A method of open addressing for a hash table in which a collision is resolved by putting the item in the next empty place given by a probe sequence. The space between places in the sequence increases quadratically.
See also double hashing, linear probing.
Note: Deletion may be hard because finding collisions again relies on not creating empty spots. One solution is to mark an entry as deleted so it can be reused for insertion, but the search list is intact.
Author: PEB
An explanation of how quadratic equations got their name.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 30 September 2009.
HTML page formatted Wed Sep 30 13:22:29 2009.
Cite this as:
Paul E. Black, "quadratic probing", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 30 September 2009. (accessed TODAY)
Available from: http://www.itl.nist.gov/div897/sqg/dads/HTML/quadraticprb.html
