3. Hashing and Table Search

Hash table lookup strategies, open-addressing and chaining variants, probabilistic filters (Bloom, Cuckoo, XOR), and locality-sensitive similarity search.

25 items

3. Hashing and table search, 25

index slug name
56 hash-table-lookup Hash Table Lookup
57 separate-chaining-search Separate Chaining Search
58 linear-probing-search Linear Probing Search
59 quadratic-probing-search Quadratic Probing Search
60 double-hashing-search Double Hashing Search
61 cuckoo-hashing-lookup Cuckoo Hashing Lookup
62 hopscotch-hashing-lookup Hopscotch Hashing Lookup
63 robin-hood-hashing-lookup Robin Hood Hashing Lookup
64 perfect-hashing-lookup Perfect Hashing Lookup
65 minimal-perfect-hashing-lookup Minimal Perfect Hashing Lookup
66 bloom-filter-membership Bloom Filter Membership
67 counting-bloom-filter-membership Counting Bloom Filter Membership
68 quotient-filter-lookup Quotient Filter Lookup
69 cuckoo-filter-lookup Cuckoo Filter Lookup
70 xor-filter-lookup XOR Filter Lookup
71 binary-fuse-filter-lookup Binary Fuse Filter Lookup
72 consistent-hashing-lookup Consistent Hashing Lookup
73 rendezvous-hashing-lookup Rendezvous Hashing Lookup
74 locality-sensitive-hashing-search Locality Sensitive Hashing Search
75 simhash-near-duplicate-search SimHash Near Duplicate Search
76 minhash-similarity-search MinHash Similarity Search
77 rolling-hash-search Rolling Hash Search
78 rabin-karp-search Rabin Karp Search
79 hash-join-lookup Hash Join Lookup
80 hash-index-probe Hash Index Probe
Wiki › Algorithms › 01. Searching and Sorting › 3. Hashing and Table Search ›

Hash Table Lookup

Retrieve a value by computing a hash and probing a table for the corresponding key.
algorithms searching hashing hash-table
Wiki › Algorithms › 01. Searching and Sorting › 3. Hashing and Table Search ›

Separate Chaining Search

Resolve hash collisions by storing multiple elements in buckets using linked structures.
algorithms searching hashing separate-chaining
Wiki › Algorithms › 01. Searching and Sorting › 3. Hashing and Table Search ›

Linear Probing Search

Resolve hash collisions by scanning sequential slots until the key is found or an empty slot appears.
algorithms searching hashing linear-probing
Wiki › Algorithms › 01. Searching and Sorting › 3. Hashing and Table Search ›

Quadratic Probing Search

Resolve hash collisions by probing with quadratic offsets to reduce clustering.
algorithms searching hashing quadratic-probing
Wiki › Algorithms › 01. Searching and Sorting › 3. Hashing and Table Search ›

Double Hashing Search

Resolve hash collisions using a second hash function to define probe steps.
algorithms searching hashing double-hashing
Wiki › Algorithms › 01. Searching and Sorting › 3. Hashing and Table Search ›

Cuckoo Hashing Lookup

Look up a key in a cuckoo hash table by checking a small fixed set of candidate positions.
algorithms searching hashing cuckoo-hashing
Wiki › Algorithms › 01. Searching and Sorting › 3. Hashing and Table Search ›

Hopscotch Hashing Lookup

Search in a hash table that maintains elements within a small neighborhood of their home bucket.
algorithms searching hashing hopscotch-hashing
Wiki › Algorithms › 01. Searching and Sorting › 3. Hashing and Table Search ›

Robin Hood Hashing Lookup

Search in an open addressing hash table that keeps probe distances balanced across keys.
algorithms searching hashing robin-hood-hashing
Wiki › Algorithms › 01. Searching and Sorting › 3. Hashing and Table Search ›

Perfect Hashing Lookup

Look up a key in a static hash table whose hash function has no collisions for the stored key set.
algorithms searching hashing perfect-hashing
Wiki › Algorithms › 01. Searching and Sorting › 3. Hashing and Table Search ›

Minimal Perfect Hashing Lookup

Look up a key using a collision free hash function that maps a static key set to exactly n table positions.
algorithms searching hashing minimal-perfect-hashing
Wiki › Algorithms › 01. Searching and Sorting › 3. Hashing and Table Search ›

Bloom Filter Membership

Test set membership with a compact probabilistic bit array that allows false positives but no false negatives.
algorithms searching hashing bloom-filter
Wiki › Algorithms › 01. Searching and Sorting › 3. Hashing and Table Search ›

Counting Bloom Filter Membership

Test membership with a Bloom filter variant that supports deletions using small counters instead of bits.
algorithms searching hashing counting-bloom-filter
Wiki › Algorithms › 01. Searching and Sorting › 3. Hashing and Table Search ›

Quotient Filter Lookup

Test approximate membership by splitting a hash fingerprint into quotient and remainder fields.
algorithms searching hashing quotient-filter
Wiki › Algorithms › 01. Searching and Sorting › 3. Hashing and Table Search ›

Cuckoo Filter Lookup

Test approximate membership by storing compact fingerprints in cuckoo hash table buckets.
algorithms searching hashing cuckoo-filter
Wiki › Algorithms › 01. Searching and Sorting › 3. Hashing and Table Search ›

XOR Filter Lookup

Test approximate membership with a static fingerprint filter built from three hash locations and XOR constraints.
algorithms searching hashing xor-filter
Wiki › Algorithms › 01. Searching and Sorting › 3. Hashing and Table Search ›

Binary Fuse Filter Lookup

Test approximate membership using a compact XOR-based filter with improved construction and cache locality.
algorithms searching hashing binary-fuse-filter
Wiki › Algorithms › 01. Searching and Sorting › 3. Hashing and Table Search ›

Consistent Hashing Lookup

Map a key to a node by placing both on a hash ring and selecting the next node clockwise.
algorithms searching hashing consistent-hashing
Wiki › Algorithms › 01. Searching and Sorting › 3. Hashing and Table Search ›

Rendezvous Hashing Lookup

Map a key to the node that receives the highest hash score for that key.
algorithms searching hashing rendezvous-hashing
Wiki › Algorithms › 01. Searching and Sorting › 3. Hashing and Table Search ›

Locality Sensitive Hashing Search

Search for approximate nearest neighbors by hashing similar items into the same buckets with high probability.
algorithms searching hashing locality-sensitive-hashing
Wiki › Algorithms › 01. Searching and Sorting › 3. Hashing and Table Search ›

SimHash Near Duplicate Search

Find near duplicate documents by comparing compact SimHash fingerprints under Hamming distance.
algorithms searching hashing simhash
Wiki › Algorithms › 01. Searching and Sorting › 3. Hashing and Table Search ›

MinHash Similarity Search

Estimate set similarity and find similar items using compact MinHash signatures and banding.
algorithms searching hashing minhash
Wiki › Algorithms › 01. Searching and Sorting › 3. Hashing and Table Search ›

Rolling Hash Search

Search for a pattern in a sequence by maintaining a hash over a sliding window.
algorithms searching hashing rolling-hash
Wiki › Algorithms › 01. Searching and Sorting › 3. Hashing and Table Search ›

Rabin Karp Search

Search for a pattern in text by comparing rolling hash values before verifying matching windows.
algorithms searching hashing rabin-karp
Wiki › Algorithms › 01. Searching and Sorting › 3. Hashing and Table Search ›

Hash Join Lookup

Find matching records during a join by probing a hash table built from one relation.
algorithms searching hashing hash-join
Wiki › Algorithms › 01. Searching and Sorting › 3. Hashing and Table Search ›

Hash Index Probe

Retrieve rows by probing a hash-based index structure using an exact key match.
algorithms searching hashing hash-index