The Power of 1 + α for Memory-Efficient Bloom Filters

Abstract

Abstract. This paper presents a cache-aware Bloom Filter algorithm with improved cache behavior and a lower false positive rates compared to prior work. The algorithm relies on the power-of-two choice principle to provide a better distribution of set elements in a Blocked Bloom Filter. Instead of choosing a single block, we insert new elements into the least-loaded of two blocks to achieve a low false-positive rate while performing only two memory accesses on each insert or query operation. The paper also discusses an optimization technique to trade off cache effectiveness with the false-positive rate to fine-tune the Bloom Filter properties.

Constructing SAT Filters with a Quantum Annealer

“…In order to ensure that almost all blocks are satisfiable, the number of blocks must be high enough that almost the entire binomial distribution of α is below the satisfiability threshold α s . The effect seen here declines in importance as the size of blocks increases, and can be mitigated in several ways that trade efficiency for query time or similar [21]. This paper does not explore the question further.…”

“…Even in the case where r = 1, blocked filters can adversely affect efficiency because of the variance in bin sizes underĥ [21,30]. This issue is considered in Section 5.…”