An Improved Construction for Counting Bloom Filters
- Flavio BonomiAffiliated withCisco Systems Inc.
- , Michael MitzenmacherAffiliated withHarvard University
- , Rina PanigrahyAffiliated withStanford University
- , Sushil SinghAffiliated withCisco Systems Inc.
- , George VargheseAffiliated withCisco Systems Inc.
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.
- An Improved Construction for Counting Bloom Filters
- Book Title
- Algorithms – ESA 2006
- Book Subtitle
- 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006. Proceedings
- pp 684-695
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- Springer-Verlag Berlin Heidelberg
- Additional Links
- Industry Sectors
- eBook Packages
- Editor Affiliations
- 16. Microsoft Research, One Microsoft Way, Redmond, WA 98052, USA and School of Computer Science, Tel-Aviv University
- 17. Department of Computer Science, University of Leicester
- Author Affiliations
- 18. Cisco Systems Inc.,
- 19. Harvard University,
- 20. Stanford University,
To view the rest of this content please follow the download PDF link above.