A variable length counting Bloom filter
Lichun Li, Bingqiang Wang, Julong Lan · 2010
In this paper, a new data structure called variable length counting Bloom filter is proposed for membership queries. This data structure uses variable length counters instead of fixed length counters in Bloom filter. Rules for the operations of the filter are defined. The size of the new data structure is analyzed. Both the analysis and the simulation show that it is about 1.7 times of that of the standard Bloom filter, which is much less than that of the traditional counting Bloom filter. The application range of the new filter is as wide as the counting Bloom filter.