Binary Fuse Filters: Fast and Smaller Than Xor Filters

DOI10.1145/3510449OpenAlexW4214926007MaRDI QIDQ5102066

Daniel Lemire, Thomas Mueller Graf

Publication date: 6 September 2022

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2201.01174

zbMATH Keywords

Bloom filtersapproximate set membershipcuckoo filters

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Universal classes of hash functions
• Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract)
• Bloomier Filters: A Second Look
• Simple and Space-Efficient Minimal Perfect Hash Functions
• Space/time trade-offs in hash coding with allowable errors
• Xor Filters

This page was built for publication: Binary Fuse Filters: Fast and Smaller Than Xor Filters