hash table(redirected from Hashmap)
This article is provided by FOLDOC - Free Online Dictionary of Computing (foldoc.org)
hash tableA 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.