Hashing: Practical Implementations of the Dictionary ADT.
A hash table is a 1-dimensional array in which each cell stores zero or more associations of a dictionary.
The array index for (keyi, valuei) is determined by applying a "hash function" to the key: h(keyi), and then possibly taking additional steps, depending on the particular hashing method and whether there are any "collisions".