hash table

(redirected from Hash map)

hash table

This article is provided by FOLDOC - Free Online Dictionary of Computing (foldoc.org)

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, DHT and hash total.


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.
Copyright © 1981-2019 by The Computer Language Company Inc. All Rights reserved. THIS DEFINITION IS FOR PERSONAL USE ONLY. All other reproduction is strictly prohibited without permission from the publisher.
References in periodicals archive ?
We might use a hash map to store neighbor information of each passable node as such data structure has a constant time complexity.
This graph was implemented as a hash map (node, neigbors) so that each passable node representing a game map cell (i, j) is surrounded by eight neighboring passable nodes at most.
In fact, memory consumption depends on the number of nodes that have passed by the open priority ordered queue (or simply the open list) and have been moved into a hash map (ID, node) of closed nodes.
then we add that node to a sorted hash map where the keys are sorted ascending.
In the hash map for the subsystems, the key is the first octet in the destination JAUS IP as a string.
The node uses the destination JAUS IP from the message as a hash key in the hash map for the components to get the IP address and port that it should forward the message to.
All of the "JausElementData" instances are stored in one of three unordered maps, or hash maps, one for subsystems, one for nodes, and the third for components.
The hash maps the entire message bits in the compressed output.
In Redis, objects consist mainly of strings and various types of collections of strings (lists, sorted lists, hash maps, etc.).