The Improved Variable Length Counting Bloom Filter Based on Buffer

Abstract

In this paper, a variable-length counting Bloomfilter is studied for a variable-length-count Bloom filter(VLCBF) when configuring updates to the median groupfrequently-shifting. Our proposed improved VLCBF deleteseach hash value stored in the first buffer insertion. Only theauxiliary Bloom filter bit is modified accordingly until thebuffer is full when the group of digits updates a shift. Themethod reduces the number of bits set of shift operations toimprove the efficiency of its configuration updates. Theoperations processes of inserting, querying, and deleting in theimproved VLCBF are described in details, followed bycomparative experiments to illustrate the method's efficiencyand applicability.