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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Azar, Y., Broder, A., Karlin, A., Upfal, E.: Balanced allocations. SIAM Journal of Computing 29(1), 180–200 (1999)
Berenbrink, P., Czumaj, A., Steger, A., Vöcking, B.: Balanced allocations: The heavily loaded case. In: Proc. of the 32nd Annual ACM STOC, pp. 745–754 (2000)
Bloom, B.: Space/time tradeoffs in in hash coding with allowable errors. Communications of the ACM 13(7), 422–426 (1970)
Bonomi, F., Mitzenmacher, M., Panigrahy, R., Singh, S., Varghese, G.: Beyond Bloom filters: From approximate membership checks to approximate state machines. In: Proc. of SIGCOMM (to appear, 2006)
Broder, A., Mitzenmacher, M.: Using multiple hash functions to improve IP Lookups. In: Proceedings of IEEE INFOCOM, pp. 1454–1463 (2001)
Broder, A., Mitzenmacher, M.: Network applications of Bloom filters: A survey. Internet Mathematics 1(4), 485–509 (2004)
Cohen, S., Matias, Y.: Spectral Bloom Filters. In: Proceedings of the 2003 ACM SIGMOD Conference, pp. 241–252 (2003)
Dharmapurikar, S., Krishnamurthy, P., Sproull, T., Lockwood, J.: Deep Packet Inspection using Parallel Bloom Filters. In: IEEE Hot Interconnects, vol. 12 (2003)
Dharmapurikar, S., Krishnamurthy, P., Taylor, D.: Longest prefix matching using Bloom filters. In: Proceedings of the ACM SIGCOMM 2003, pp. 201–212 (2003)
Fan, L., Cao, P., Almeida, J., Broder, A.Z.: Summary cache: A scalable wide-area Web cache sharing protocol. IEEE/ACM Trans. on Networking 8(3), 281–293 (2000)
Kenthapadi, K., Panigrahy, R.: Balanced allocation on graphs. In: Proc. of the Seventeenth Annual ACM-SIAM Symp. on Discrete Algorithms, pp. 434–443 (2006)
Lu, Y., Prabhakar, B., Bonomi, F.: Perfect Hashing for Network Applications. In: Proc. of ISIT 2006 (to appear, 2006)
Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, Cambridge (2005)
Mitzenmacher, M., Vöcking, B.: The asymptotics of selecting the shortest of two, improved. In: Suhov, Y. (ed.) Analytic Methods in Applied Probability: In Memory of Fridrikh Karpelevich. American Mathematical Society (2003)
Pagh, R., Rodler, F.: Cuckoo Hashing. In: Proc. of the 9th Annual European Symposium on Algorithms, pp. 121–133 (2001)
Panigrahy, R.: Efficient hashing with lookups in two memory accesses. In: Proc. of the Sixteenth Annual ACM-SIAM Symp. on Discrete Algorithms, pp. 830–839 (2005)
Pagh, A., Pagh, R., Rao, S.: An Optimal Bloom Filter Replacement. In: Proc. of the Sixteenth Annual ACM-SIAM Symp. on Discrete Algorithms, pp. 823–829 (2005)
Rajwar, R., Herlihy, M., Lai, K.: Virtualizing Transactional Memory. In: Proc. of the 32nd Annual Int’l. Symp. on Computer Architecture, pp. 494–505 (2005)
Sharma, M., Byers, J.: Scalable Coordination Techniques for Distributed Network Monitoring. In: Dovrolis, C. (ed.) PAM 2005. LNCS, vol. 3431, pp. 349–352. Springer, Heidelberg (2005)
Vöcking, B.: How asymmetry helps load balancing. In: Proceedings of the 40th IEEE-FOCS, pp. 131–140 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
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. https://doi.org/10.1007/11841036_61
Download citation
DOI: https://doi.org/10.1007/11841036_61
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-38875-3
Online ISBN: 978-3-540-38876-0
eBook Packages: Computer ScienceComputer Science (R0)