Partitioned Learned Bloom Filters

Kapil Vaidya, Eric Knorr, Michael Mitzenmacher, Tim Kraska

Keywords: optimization, data structures, algorithms, theory, learned algorithms

Abstract: Bloom filters are space-efficient probabilistic data structures that are used to test whether an element is a member of a set, and may return false positives. Recently, variations referred to as learned Bloom filters were developed that can provide improved performance in terms of the rate of false positives, by using a learned model for the represented set. However, previous methods for learned Bloom filters do not take full advantage of the learned model. Here we show how to frame the problem of optimal model utilization as an optimization problem, and using our framework derive algorithms that can achieve near-optimal performance in many cases.

Code Of Ethics: I acknowledge that I and all co-authors of this work have read and commit to adhering to the ICLR Code of Ethics

Data: [EMBER](https://paperswithcode.com/dataset/ember)