direct chaining

(data structure)

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 ...)
separate chaining.

Aggregate parent (I am a part of or used in ...)
hash table.

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]

Author: PEB

Implementation

insert (C), search (C). Duane A. Bailey's ChainedHashtable class documentation in the structure package (Java) from Java Structures: Data Structures in Java, for the Principled Programmer.

Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 3 November 2010.
HTML page formatted Mon Feb 2 13:10:39 2015.

Cite this as:
Paul E. Black, "direct chaining", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 3 November 2010. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/directChaining.html