Abstract
Counting Bloom Filter is an efficient multi-hash algorithm based on Bloom Filter. It uses a space-efficient randomized data structure to represent a set with certain allowable errors, and allows membership and multiplicity queries over the set. Aiming at the set whose items frequencies following heavy-tailed distribution, this paper presents a novel algorithm called Multi-Granularities Counting Bloom Filter (MGCBF) based on Counting Bloom Filter. This algorithm applies hierarchical data structures through several counting bloom filters to store the items frequencies information in the set. The time and space complexities analysis of this algorithm illustrates that it can reduce the space needed dramatically with the cost of little additional compute-time. And the following experiments indicate this algorithm is more efficient than other algorithms with same errors probability when the items frequencies of the target set follow heavy-tailed distribution.
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.
Similar content being viewed by others
References
Bloom, B.: Space/Time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422–426 (1970)
Broder, A., Mitzenmacher, M.: Network applications of bloom filters: A survey. In: Proceedings of the 40th Annual Allerton Conference on Communication, Control, and Computing (2002)
Fan, L., Cao, P., Almeida, J., Broder, A.Z.: Summary Cache: A Scalable Wide-Area Web Cache Sharing Protocol. IEEE/ACM Transactions on Networking 8(3), 281–293 (2000)
Cohen, S., Matias, Y.: Spectral Bloom Filters. In: Proceedings of the ACM SIGMOD 2003, San Diego, California, USA (June 2003)
Kumar, A., Xu, J., et al.: Space-Code Bloom Filter for Efficient Per-Flow Traffic Measurement. In: IEEE Infocom 2004, Hongkong, China (March 2004)
Zhang, Y., Breslau, L., Paxson, V., Shenker, S.: On the Characteristics and Origins of Internet Flow Rates. In: Proceedings of ACM SIGCOMM, Pittsburgh, PA (August 2002)
Shaikh, A., Rexford, J., Shin, K.G.: Load-Sensitive Routing of Long-Lived IP Flows. In: Proceedings of the ACM SIGCOMM 1999, Cambridge, MA, USA (August 1999)
The Pareto Distribution (December 2005), http://www.ds.unifi.it/VL/VL_EN/special/special12.html
The Abilene-III Trace Data – Illustrated (December 2005), http://pma.nlanr.net/Special/ipls3.html
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
Mingzhong, Z., Jian, G., Wei, D., Guang, C. (2006). Multi-Granularities Counting Bloom Filter. In: Gerndt, M., Kranzlmüller, D. (eds) High Performance Computing and Communications. HPCC 2006. Lecture Notes in Computer Science, vol 4208. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11847366_56
Download citation
DOI: https://doi.org/10.1007/11847366_56
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-39368-9
Online ISBN: 978-3-540-39372-6
eBook Packages: Computer ScienceComputer Science (R0)