Definition: A collision resolution scheme in which the hash table is an array of links to lists. Each list holds all the items with the same hash value.
Generalization (I am a kind of ...)
Aggregate parent (I am a part of or used in ...)
See also linear search.
Note: The items in the list may be searched and maintained with any list search algorithms. Any searchable data structure may be used instead of a list.
After [GBY91, pages 71-74]
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 3 November 2010.
HTML page formatted Tue Dec 6 16:16:32 2011.
Cite this as:
Paul E. Black, "direct chaining", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 3 November 2010. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/directChaining.html