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...

A distributed hash table (DHT) is a distributed system that provides a lookup service similar to a hash table. Key–value pairs are stored in a DHT, and...

hash function are called hash values, hash codes, (hash/message) digests, or simply hashes. The values are usually used to index a fixed-size table called...

A rainbow table is a precomputed table for caching the outputs of a cryptographic hash function, usually for cracking password hashes. Passwords are typically...

Cuckoo hashing is a scheme in computer programming for resolving hash collisions of values of hash functions in a table, with worst-case constant lookup...

Open addressing, or closed hashing, is a method of collision resolution in hash tables. With this method a hash collision is resolved by probing, or searching...

concurrent hash table or concurrent hash map is an implementation of hash tables allowing concurrent access by multiple threads using a hash function....

computer science, a hash collision or hash clash is when two distinct pieces of data in a hash table share the same hash value. The hash value in this case...

associative arrays. The two major solutions to the dictionary problem are hash tables and search trees. It is sometimes also possible to solve the problem...

A cryptographic hash function (CHF) is a hash algorithm (a map of an arbitrary binary string to a binary string with a fixed size of n {\displaystyle...

computing, universal hashing (in a randomized algorithm or data structure) refers to selecting a hash function at random from a family of hash functions with...

In computer science, consistent hashing is a special kind of hashing technique such that when a hash table is resized, only n / m {\displaystyle n/m} keys...

building hash tables from the tuples of one or both of the joined relations, and subsequently probing those tables so that only tuples with the same hash code...

Perfect hash functions may be used to implement a lookup table with constant worst-case access time. A perfect hash function can, as any hash function...

{\displaystyle k} , a hash table would store the value v {\displaystyle v} in the slot h ( k ) {\displaystyle h(k)} where h {\displaystyle h} is a hash function i...

a protocol and algorithm for a peer-to-peer distributed hash table. A distributed hash table stores key-value pairs by assigning keys to different computers...

this is where the collision chain is used. This hash table is known as a hash anchor table. The hashing function is not generally optimized for coverage...

the above picture hash 0 is the result of hashing the concatenation of hash 0-0 and hash 0-1. That is, hash 0 = hash( hash 0-0 + hash 0-1 ) where "+" denotes...

as fast table lookup (hash tables) and distributed databases (distributed hash tables). A hash list is an extension of the concept of hashing an item...

symbol tables is the hash table. The time for searching in hash tables is independent of the number of elements stored in the table, so it is efficient for...

In computer science, locality-sensitive hashing (LSH) is a fuzzy hashing technique that hashes similar input items into the same "buckets" with high probability...

FNV offset basis yield the following table of FNV hash parameters: The FNV hash was designed for fast hash table and checksum use, not cryptography. The...

A hash array mapped trie (HAMT) is an implementation of an associative array that combines the characteristics of a hash table and an array mapped trie...

perfect hash function, and can be implemented using as few as O ( m log ⁡ log ⁡ log ⁡ n ) {\displaystyle O(m\log \log \log n)} bits. A succinct hash table, also...

function that hashes data, a password or passphrase. Salting helps defend against attacks that use precomputed tables (e.g. rainbow tables), by vastly growing...

non-cryptographic hash functions, such as CityHash;: 496  this can be used to prevent denial-of-service attacks against hash tables ("hash flooding"), or...

probing is a scheme in computer programming for resolving collisions in hash tables, data structures for maintaining a collection of key–value pairs and...

Distributed hash table Double hashing Dynamic perfect hash table Hash array mapped trie Hash list Hash table Hash tree Hash trie Koorde Prefix hash tree Rolling...

generic HashSet and BTreeSet types. Java offers the Set interface to support sets (with the HashSet class implementing it using a hash table), and the...

compiler), the permutation table can be adjusted so that those inputs yield distinct hash values, producing what is called a perfect hash function. Two input...