Hash table lookup strategies, open-addressing and chaining variants, probabilistic filters (Bloom, Cuckoo, XOR), and locality-sensitive similarity search.
| 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 |
Hash Table LookupRetrieve a value by computing a hash and probing a table for the corresponding key.
Separate Chaining SearchResolve hash collisions by storing multiple elements in buckets using linked structures.
Linear Probing SearchResolve hash collisions by scanning sequential slots until the key is found or an empty slot appears.
Quadratic Probing SearchResolve hash collisions by probing with quadratic offsets to reduce clustering.
Double Hashing SearchResolve hash collisions using a second hash function to define probe steps.
Cuckoo Hashing LookupLook up a key in a cuckoo hash table by checking a small fixed set of candidate positions.
Hopscotch Hashing LookupSearch in a hash table that maintains elements within a small neighborhood of their home bucket.
Robin Hood Hashing LookupSearch in an open addressing hash table that keeps probe distances balanced across keys.
Perfect Hashing LookupLook up a key in a static hash table whose hash function has no collisions for the stored key set.
Minimal Perfect Hashing LookupLook up a key using a collision free hash function that maps a static key set to exactly n table positions.
Bloom Filter MembershipTest set membership with a compact probabilistic bit array that allows false positives but no false negatives.
Counting Bloom Filter MembershipTest membership with a Bloom filter variant that supports deletions using small counters instead of bits.
Quotient Filter LookupTest approximate membership by splitting a hash fingerprint into quotient and remainder fields.
Cuckoo Filter LookupTest approximate membership by storing compact fingerprints in cuckoo hash table buckets.
XOR Filter LookupTest approximate membership with a static fingerprint filter built from three hash locations and XOR constraints.
Binary Fuse Filter LookupTest approximate membership using a compact XOR-based filter with improved construction and cache locality.
Consistent Hashing LookupMap a key to a node by placing both on a hash ring and selecting the next node clockwise.
Rendezvous Hashing LookupMap a key to the node that receives the highest hash score for that key.
Locality Sensitive Hashing SearchSearch for approximate nearest neighbors by hashing similar items into the same buckets with high probability.
SimHash Near Duplicate SearchFind near duplicate documents by comparing compact SimHash fingerprints under Hamming distance.
MinHash Similarity SearchEstimate set similarity and find similar items using compact MinHash signatures and banding.
Rolling Hash SearchSearch for a pattern in a sequence by maintaining a hash over a sliding window.
Rabin Karp SearchSearch for a pattern in text by comparing rolling hash values before verifying matching windows.
Hash Join LookupFind matching records during a join by probing a hash table built from one relation.
Hash Index ProbeRetrieve rows by probing a hash-based index structure using an exact key match.