hash table


Also found in: Dictionary, Thesaurus, Medical, Financial, Wikipedia.
Related to hash table: Hash function

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 ?
If j already appears on the hash table, A looks up {j, [v.sub.j], [h.sub.j]} in the hash table.
In a typical situation, however, we would have only the id of the player, and that is where that hash table enters the scene.
In these systems, the server makes data visible to clients so the client could use RDMA Reads to access hash table and items at the remote server as if they are on its own local memory.
In Cheng, distributed hash tables (DHT) were used for inter routing connection establishment where the internal regions of the network router were connected with common mode point.
Since we have 33 bits to store a quotient value, we need to ensure that the total number of hash indexes, that is, the hash table size, is at least [2.sup.(2k-33)].
Based on the construction algorithm, Figure 1 describes the process of mapping tree nodes to the hash table with a hand-traceable example.
Here, by computing the Hamming distance, we propose a new structure, called Similar-PBF-PHT, based on the BFs and hash tables (HT) to search the membership as well as the K-NN regardless of the radius CR.
It uses a two-level hash table for attempting to join stream tuples as soon as they arrive, and uses a partition-based waiting area for other stream tuples.
* if the vector is empty remove the key from hash table
These city buses act as brokers for other vehicles which are in role of publishers or subscribers and can form a distributed hash table (DHT) based P2P overlay for disseminating publications and subscriptions.