Affiliation:
1. University of Quebec (TELUQ), Montreal, Quebec, Canada
Abstract
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 an alternative, a cuckoo filter may need less space than a Bloom filter and it is faster. Chazelle et al. proposed a generalization of the Bloom filter called the Bloomier filter. Dietzfelbinger and Pagh described a variation on the Bloomier filter that can answer approximate membership queries over immutable sets. It has never been tested empirically, to our knowledge. We review an efficient implementation of their approach, which we call the xor filter. We find that xor filters can be faster than Bloom and cuckoo filters while using less memory. We further show that a more compact version of xor filters (xor+) can use even less space than highly compact alternatives (e.g., Golomb-compressed sequences) while providing speeds competitive with Bloom filters.
Funder
Natural Sciences and Engineering Research Council of Canada
Publisher
Association for Computing Machinery (ACM)
Subject
Theoretical Computer Science
Cited by
59 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. BloomWalk and CuckooWalk: Fast Random Walks Utilizing Probabilistic Data Structure;2024 IEEE 48th Annual Computers, Software, and Applications Conference (COMPSAC);2024-07-02
2. Aleph Filter: To Infinity in Constant Time;Proceedings of the VLDB Endowment;2024-07
3. Space Lower Bounds for Dynamic Filters and Value-Dynamic Retrieval;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
4. Beyond Bloom: A Tutorial on Future Feature-Rich Filters;Companion of the 2024 International Conference on Management of Data;2024-06-09
5. An Efficient Multicast Authenticated Encryption Scheme for Smart Elderly Care Systems;ICC 2024 - IEEE International Conference on Communications;2024-06-09