An Improved Construction for Counting Bloom Filters (2006)
Cached
Download Links
- [theory.stanford.edu]
- [www.eecs.harvard.edu]
- [www.cs.ucsd.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | 14th Annual European Symposium on Algorithms, LNCS 4168 |
| Citations: | 14 - 3 self |
BibTeX
@INPROCEEDINGS{Bonomi06animproved,
author = {Flavio Bonomi and Michael Mitzenmacher and Rina Panigrahy and Sushil Singh and George Varghese},
title = {An Improved Construction for Counting Bloom Filters},
booktitle = {14th Annual European Symposium on Algorithms, LNCS 4168},
year = {2006},
pages = {684--695}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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. 1
