None
EN
PtrHash: Minimal Perfect Hashing at RAM Throughput
['Ragnar', 'Groot Koerkamp']
home on CuriousCoding
Then, the keys in each part are further split into buckets, and each bucket is assigned a pilot that controls the values (slots) that the keys in the bucket hash to. a fixed number of buckets and slots per part, removing the need for a part-offset lookup; the use of fixed-width 8-bit pilots, so that no compact encoding is needed; a pilot search based on Cuckoo hashing; remapping using a single remap table, again simplifying lookups; a remap table based on a per-cacheline Elias-Fano encoding (Elias 1974; Fano 1971), CacheLineEF; the use of prefetching to stream multiple queries in parallel.