A Dynamic Structure of Counting Bloom Filter
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.
KeywordsDynamic Structure Bloom Filter Element Insertion Insertion Algorithm Element Deletion
Unable to display preview. Download preview PDF.
- 5.Cohen, S., Matias, Y.: Spectral Bloom Filters. In: Proceedings of the 2003 ACM SIGMOD Conference, pp. 241–252 (2003)Google Scholar
- 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
- 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