28 citations · 28 across the 1 of their papers we have counts for
3 papers
cs.DS2022★ 28 cited
Binary Fuse Filters: Fast and Smaller Than Xor Filters
Thomas Mueller Graf, Daniel Lemire
Bloom and cuckoo filters provide fast approximate set membership while using little memory. Engineers use them to avoid expensive disk and network accesses. The recently introduced…
cs.DS2020
Xor Filters: Faster and Smaller Than Bloom and Cuckoo Filters
Thomas Mueller Graf, Daniel Lemire
The Bloom filter provides fast approximate set membership while using little memory. Engineers often use these filters to avoid slow operations such as disk or network accesses. As…
cs.DS2019
RecSplit: Minimal Perfect Hashing via Recursive Splitting
Emmanuel Esposito, Thomas Mueller Graf, Sebastiano Vigna
A minimal perfect hash function bijectively maps a key set out of a universe into the first natural numbers. Minimal perfect hash functions are used, for example, to…