hash table

(redirected from Hashtable)

hash table

hash table

A lookup table that is designed to efficiently store non-contiguous keys (account numbers, part numbers, etc.) that may have wide gaps in their alphabetic or numeric sequences.

Hash tables are created with an algorithm that stores the keys into hash buckets, which contain key-value pairs. Since different keys may hash to the same bucket, the goal of hash table design is to spread out the key-value pairs evenly with each bucket containing as few key-value pairs as possible. When an item is looked up, its key is hashed to find the appropriate bucket, and the bucket is then compared to find the right key-value pair. See key-value pair, cryptographic hash function and DHT.


A Hash Table
When an item is looked up, its key is hashed into a bucket value, and the bucket is compared to find the key.
References in periodicals archive ?
A hashtable is created which keeps track of a number of PropertyChangeListeners for Figs.
Some basic operations involved in this algorithm (and in Algorithm 2 and 3) include operation over stack, operation over hashtable and operation over vector.
For each query edge, if the twig is of P-C relationship, the parent and child details will be updated in the twigPC (a hashtable to store parent and child) repository as depicted in Figure 4.
Hashtable to store the relationship between customers and countries.
IDictionaryEnumerator to iterate through Hashtable keys.
Similar to a traditional hashtable data structure, other operations supported in the DHT include put and get.