a collection that consists of key-value combinations, organized into 'buckets' for fast searching

a common data structure that offers quick insertion and search capabilities

a data structure commonly used to perform fast searches for matching criteria, such as looking for compatible visplanes

a data structure for storing key/value pairs

a data structure that allows you to store and retrieve items based on a key

a data structure that can implement a function whose domain is a finite set

a data structure that maps "keys" onto "values

a data structure used to maximize the speed with which a stored data item can be accessed

a Lisp object that can efficiently map a given Lisp object to another Lisp

a method for storing a set of (key,value) pairs and supporting the operations get(key) and put(key,value)

an internal mechanism used by Adaptive Server to retrieve information quickly

a set of elements also requiring key-value pairs

a simple computer science data structure

a simple data structure that allows fast access to data elements by keys

a specific type of data structure that provides a dictionary interface

a storage data type whose speed in searching is much greater than that of other data structures because it stores data items based on a key derived from some given formula

a very fast kind of lookup table, somewhat like an alist in that it maps keys to corresponding values, but much faster

An object that maps more-or-less arbitrary keys to values. Dictionaries are the most visible and widely used objects that exhibit this behavior.

A table that contains "hash values," generally used for speeding up searching algorithms on sorted data. For example, a hash table for a dictionary might contain all the letters of the alphabet and the page numbers where each letter starts. That way, instead of searching through from start to finish for each word, you just use the hash table and get a big head start.

Table that contains pointers for easy retrieving some sorted information. For example, in the table above, each letter points to another page of WEBGUEST's Web Glossary. If you want to see words beginning with an "H", you click on the "H" in the hash table and a hyperlink will bring you immediately to this page, so there is no need to browse through the entire glossary.

A data structure that divides all elements into (preferably) equal-sized categories, or buckets, to allow quick access to the elements. The hash function determines which bucket an element belongs in.

Hashing data into the format of a hash table lets specially designed programs search for data quickly. A hash table assigns a special search code to each piece of data. For example, the C shell uses a hash table to locate commands more quickly; the rehash ( 4.2) command rebuilds the hash table after you add a new command.

The hash table is a storage location in memory or on disk that records the hashed values created by the hashing algorithm. Some familiarity with the data to be stored is desirable. The hash table is normally created with a certain number of buckets or storage locations. The number of buckets or size of the hash table is related to the quantity of data items that must be stored.

In SysMaster, a table containing the information of all current connections, that is addressed by a special key which provides rapid access to that information.

A computer data structure that performs a mathematical calculation on a field identifier (called a hash) to determine where a data element in a large table or index is located.

A table of information that is accessed by way of a shortened search key (the hash value). Using a hash table minimizes average search time.

In computer science, a hash table, or a hash map, is a data structure that associates keys with values. The primary operation it supports efficiently is a lookup: given a key (e.g. a person's name), find the corresponding value (e.g. that person's telephone number). It works by transforming the key using a hash function into a hash, a number that is used to index into an array to locate the desired location ("bucket") where the values should be.