(algorithm)
Definition: A way of handling collisions, that is, when two or more items should be kept in the same location, especially in a hash table. The general ways are keeping subsequent items within the table and computing possible locations (open addressing), keeping lists for items that collide (chaining), or keeping one special overflow area.
Specialization (... is a kind of me.)
direct chaining, open addressing, separate chaining.
Aggregate parent (I am a part of or used in ...)
hash table.
Note: The special overflow area can be any searchable data structure, even another (smaller) hash table.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 1 December 2004.
HTML page formatted Fri Mar 25 16:20:34 2011.
Cite this as:
Paul E. Black, "collision resolution scheme", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 1 December 2004. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/collisionres.html
