An Improved Construction for Counting Bloom Filters

  • Flavio Bonomi
  • Michael Mitzenmacher
  • Rina Panigrahy
  • Sushil Singh
  • George Varghese
Conference paper

DOI: 10.1007/11841036_61

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4168)
Cite this paper as:
Bonomi F., Mitzenmacher M., Panigrahy R., Singh S., Varghese G. (2006) An Improved Construction for Counting Bloom Filters. In: Azar Y., Erlebach T. (eds) Algorithms – ESA 2006. ESA 2006. Lecture Notes in Computer Science, vol 4168. Springer, Berlin, Heidelberg

Abstract

A counting Bloom filter (CBF) generalizes a Bloom filter data structure so as to allow membership queries on a set that can be changing dynamically via insertions and deletions. As with a Bloom filter, a CBF obtains space savings by allowing false positives. We provide a simple hashing-based alternative based on d-left hashing called a d-left CBF (dlCBF). The dlCBF offers the same functionality as a CBF, but uses less space, generally saving a factor of two or more. We describe the construction of dlCBFs, provide an analysis, and demonstrate their effectiveness experimentally.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Flavio Bonomi
    • 1
  • Michael Mitzenmacher
    • 2
  • Rina Panigrahy
    • 3
  • Sushil Singh
    • 1
  • George Varghese
    • 1
  1. 1.Cisco Systems Inc. 
  2. 2.Harvard University 
  3. 3.Stanford University 

Personalised recommendations