Asymmetric Sparse Bloom Filter

Abstract

We propose a new Bloom filter that efficiently filters out non-members. With extra bits assigned and asymmetrically distributed, the new filter reduces hash computations and memory accesses. For an error rate of 10^-6, the new filter reduces cost by 31.31% with 4.33% additional space, while the standard method saves offers a 20.42% reduction.