• Any function that can be used to map data of arbitrary size to fixed-size values. The values returned by a hash function are called hash values, hash codes, digests, or simply hashes. The values are used to index a fixed-size table called a hash table. Use of a hash function to index a hash table is called hashing or scatter storage addressing. Hash functions and their associated hash tables are used in data storage and retrieval applications to access data in a small and nearly constant time per retrieval, and storage space only fractionally greater than the total space required for the data or records themselves. Hashing is a computationally and storage-efficient form of data access. ← Wikipedia

1. Related terms: Number sign · Hash table · Rolling hash · MD5
2. Previous term: Hash fragment
3. Next term: Hash table
4. Random term: Arity (webglossary.info/random 🎲)