- A data structure that implements an associative array abstract data type, a structure that can map 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. 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. ← Wikipedia
This term is sponsored by: your name/company?
- Previous term: Hash function
- Next term: Hash-based message authentication code
- Random term: FOIT (webglossary.info/random 🎲)