Affiliation:
1. University of Toronto, Canada
2. KTH Royal Institute of Technology, Sweden
3. BARC, University of Copenhagen, Denmark
Abstract
Filter data structures are widely used in various areas of computer science to answer approximate set-membership queries. In many applications, the data grows dynamically, requiring their filters to expand along with the data. However, existing methods for expanding filters cannot maintain stable performance, memory footprint, and false positive rate (FPR) simultaneously. We address this problem with Aleph Filter, which makes the following contributions. (1) It supports all operations (insertions, queries, deletes, etc.) in constant time, no matter how much the data grows. (2) Given an estimate of how much the data will ultimately grow, Aleph Filter provides a memory vs. FPR trade-offs on par with static filters.
Publisher
Association for Computing Machinery (ACM)
Reference62 articles.
1. Paulo Sérgio Almeida Carlos Baquero Nuno Preguiça and David Hutchison. 2007. Scalable Bloom Filters. Inform. Process. Lett. (2007).
2. FAWN
3. Stretching your data with taffy filters
4. Michael A. Bender, Martin Farach-Colton, Rob Johnson, Russell Kraner, Bradley C. Kuszmaul, Dzejla Medjedovic, Pablo Montes, Pradeep Shetty, Richard P. Spillane, and Erez Zadok. 2012. Don't Thrash: How to Cache Your Hash on Flash. PVLDB (2012).
5. Ioana O Bercea and Guy Even. 2020. Fully-Dynamic Space-Efficient Dictionaries and Filters with Constant Number of Memory Accesses. SWAT (2020).