A Dynamic Structure of Counting Bloom Filter

Conference paper
Part of the Advances in Intelligent and Soft Computing book series (AINSC, volume 145)

Abstract

Counting Bloom Filter based on the counter-array structure has the shortcoming of counter overflow and less space-efficient. To address these shortcomings, we propose a dynamic structure for Counting Bloom Filter which dynamically changes the counter size according to the number of inserted elements. Hence it not only makes a better use of memory space but also eliminates counter overflow. We put up with the methods of addition and subtraction bit by bit while inserting and deleting elements to effectively reduce the times of memory access. In this way, an effective tradeoff can be achieved between counter access speed and space efficiency. Besides, to reduce excessive memory allocation/deallocation cost caused by consecutively changing counter size, we propose a configurable delayed shrinking algorithm which can appropriately delay the counter size shrinking based on user’s configuration. The experiment results show that our dynamic structure could meet the needs of most application scenarios.

Keywords

Dynamic Structure Bloom Filter Element Insertion Insertion Algorithm Element Deletion 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bloom, B.: Space/Time Tradeoffs in Hash Coding with Allowable Errors. Communications of the ACM 13(7), 422–426 (1970)MATHCrossRefGoogle Scholar
  2. 2.
    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)CrossRefGoogle Scholar
  3. 3.
    Mitzenmacher, M.: Compressed Bloom Filters. IEEE/ACM Transactions on Networking 10(5), 604–612 (2002)CrossRefGoogle Scholar
  4. 4.
    Broder, A., Mitzenmacher, M.: Network applications of Bloom filters: A survey. Internet Mathematics 1(4), 485–509 (2004)MathSciNetMATHCrossRefGoogle Scholar
  5. 5.
    Cohen, S., Matias, Y.: Spectral Bloom Filters. In: Proceedings of the 2003 ACM SIGMOD Conference, pp. 241–252 (2003)Google Scholar
  6. 6.
    Aguilar-Saborit, J., Trancoso, P., Muntes-Mulero, V., Larriba-Pey, J.L.: Dynamic Count Filters. SIGMOD Record 35(1), 26–32 (2006)CrossRefGoogle Scholar
  7. 7.
    Dharmapurikar, S., Krishnamurthy, P., Taylor, D.: Longest Prefix Matching using Bloom Filters. In: Proceedings of the ACM SIGCOMM, pp. 201–212 (2003)Google Scholar
  8. 8.
    Bonomi, F., Mitzenmacher, M., Panigrahy, R., Singh, S., Varghese, G.: An Improved Construction for Counting Bloom Filters. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 684–695. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  9. 9.
    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)Google Scholar

Copyright information

© Springer-Verlag GmbH Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.School of Computer Science and TechnologyNorthwestern Polytechnical UniversityXi’anChina

Personalised recommendations