The Bloom paradox: When not to use a Bloom filter?

Ori Rottenstreich, Isaac Keslassy
2012 2012 Proceedings IEEE INFOCOM  
In this paper, we uncover the Bloom paradox: sometimes, it is better to disregard the Bloom filter results, and in fact not to even query it, thus making the Bloom filter useless. We first analyze conditions under which the Bloom paradox occurs, and show that it depends on the a priori probability that a given element belongs to the represented set. We also show that the Bloom paradox applies to Counting Bloom Filters (CBFs), and depends on the product of the hashed counters of each element. In
more » ... addition, both for Bloom filters and CBFs, we suggest improved architectures that deal with the Bloom paradox. We also provide fundamental memory lower bounds required to support element queries with limited false-positive and false-negative rates. Last, using simulations, we verify our theoretical results, and show that our improved schemes can lead to a significant improvement in the performance of Bloom filters and CBFs.
doi:10.1109/infcom.2012.6195533 dblp:conf/infocom/RottenstreichK12 fatcat:enstjrux6radnfarapnfbebdna