Definitions for hash table
hash ta·ble

WiktionaryRate this definition:0.0 / 0 votes

1. hash tablenoun

   An associative array implemented as a vector, the indexes into which are the result of applying a hash function to the key.

WikipediaRate this definition:0.0 / 0 votes

1. Hash table

   In computing, a hash table, also known as hash map, is a data structure that implements an associative array or dictionary. It is an abstract data type that maps keys to values. A hash table uses a hash function to compute an index, also called a hash code, into an array of buckets or slots, from which the desired value can be found. During lookup, the key is hashed and the resulting hash indicates where the corresponding value is stored. Ideally, the hash function will assign each key to a unique bucket, but most hash table designs employ an imperfect hash function, which might cause hash collisions where the hash function generates the same index for more than one key. Such collisions are typically accommodated in some way. In a well-dimensioned hash table, the average time complexity for each lookup is independent of the number of elements stored in the table. Many hash table designs also allow arbitrary insertions and deletions of key–value pairs, at amortized constant average cost per operation.Hashing is an example of a space-time tradeoff. If memory is infinite, the entire key can be used directly as an index to locate its value with a single memory access. On the other hand, if infinite time is available, values can be stored without regard for their keys, and a binary search or linear search can be used to retrieve the element.: 458 In many situations, hash tables turn out to be on average more efficient than search trees or any other table lookup structure. For this reason, they are widely used in many kinds of computer software, particularly for associative arrays, database indexing, caches, and sets.

WikidataRate this definition:0.0 / 0 votes

1. Hash table

   In computing, a hash table is a data structure used to implement an associative array, a structure that can map keys to values. A hash table uses a hash function to compute an index into an array of buckets or slots, from which the correct value can be found. Ideally, the hash function should assign each possible key to a unique bucket, but this ideal situation is rarely achievable in practice. Instead, most hash table designs assume that hash collisions—different keys that are assigned by the hash function to the same bucket—will occur and must be accommodated in some way. In a well-dimensioned hash table, the average cost for each lookup is independent of the number of elements stored in the table. Many hash table designs also allow arbitrary insertions and deletions of key-value pairs, at constant average cost per operation. In many situations, hash tables turn out to be more efficient than search trees or any other table lookup structure. For this reason, they are widely used in many kinds of computer software, particularly for associative arrays, database indexing, caches, and sets.

How to pronounce hash table?

1. Alex

   US English

   David

   US English

   Mark

   US English

   Daniel

   British

   Libby

   British

   Mia

   British

   Karen

   Australian

   Hayley

   Australian

   Natasha

   Australian

   Veena

   Indian

   Priya

   Indian

   Neerja

   Indian

   Zira

   US English

   Oliver

   British

   Wendy

   British

   Fred

   US English

   Tessa

   South African

How to say hash table in sign language?

Numerology

1. Chaldean Numerology

   The numerical value of hash table in Chaldean Numerology is: 2

2. Pythagorean Numerology

   The numerical value of hash table in Pythagorean Numerology is: 4

References

1. ^ Wiktionary
   https://en.wiktionary.org/wiki/Hash_Table
2. ^ Wikipedia
   https://en.wikipedia.org/wiki/Hash_Table
3. ^ Wikidata
   https://www.wikidata.org/w/index.php?search=hash table