Access-efficient Balanced Bloom Filters

Yossi Kanizo*, David Hay, Isaac Keslassy

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations


Bloom Filters should particularly suit network devices, because of their low theoretical memory-access rates. However, in practice, since memory is often divided into blocks and Bloom Filters hash elements into several arbitrary memory blocks, Bloom Filters actually need high memory-access rates. On the other hand, hashing all Bloom Filter elements into a single memory block to solve this problem also yields high false positive rates. In this paper, we propose to implement load-balancing schemes for the choice of the memory block, along with an optional overflow list, resulting in improved false positive rates while keeping a high memory-access efficiency. To study this problem, we define, analyze and solve a fundamental access-constrained balancing problem, where incoming elements need to be optimally balanced across resources while satisfying average and instantaneous constraints on the number of memory accesses associated with checking the current load of the resources. We then build on this problem to suggest a new access-efficient Bloom Filter scheme, called the Balanced Bloom Filter. Finally, we show that this scheme can reduce the false positive rate by up to two orders of magnitude, with a worst-case cost of up to 3 memory accesses for each element and an overflow list size of 0.5% of the elements.

Original languageAmerican English
Title of host publication2012 IEEE International Conference on Communications, ICC 2012
Number of pages6
StatePublished - 2012
Event2012 IEEE International Conference on Communications, ICC 2012 - Ottawa, ON, Canada
Duration: 10 Jun 201215 Jun 2012

Publication series

NameIEEE International Conference on Communications
ISSN (Print)1550-3607


Conference2012 IEEE International Conference on Communications, ICC 2012
CityOttawa, ON


Dive into the research topics of 'Access-efficient Balanced Bloom Filters'. Together they form a unique fingerprint.

Cite this