A dynamic structure of counting bloom filter

Jianhua Gu, Xingshe Zhou

科研成果: 期刊稿件会议文章同行评审

摘要

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.

源语言英语
页(从-至)31-37
页数7
期刊Advances in Intelligent and Soft Computing
145 AISC
VOL. 2
DOI
出版状态已出版 - 2012
活动2011 2nd International Congress on Computer Applications and Computational Science, CACS 2011 - Bali, 印度尼西亚
期限: 15 11月 201117 11月 2011

指纹

探究 'A dynamic structure of counting bloom filter' 的科研主题。它们共同构成独一无二的指纹。

引用此