Accurate Counting Bloom Filters for Large-Scale Data Processing

Algorithm 2

Insertion operation in ACBF.

(1) Insert (Element 𝑥)

(2) for (𝑖=1; 𝑖 <= 𝑘; 𝑖++) do

# Traverse 𝑑 bitmaps 𝑏₁,…,𝑏_𝑑

(3)   for (𝑗=1; 𝑗 <= 𝑑; 𝑗++) do

(4)    if (𝑗 == 1) then

(5)    index = ℎ_𝑖(𝑥) mod 𝑙₁;

(6)    end if

(7)    if (𝑏_𝑗[index] == 1) then

(8)    offset = popcount(𝑏_𝑗, index);

(9)    index = offset;

# Expand bitmap 𝑏_𝑗+1 by one position

(10)    else

(11)    𝑏_𝑗[index] = 1;

(12)    offset = popcount(𝑏_𝑗, index);

(13)    expand_bitmap(𝑏_𝑗+1, offset);

(14)    Index = offset;

(15)    𝑏_𝑗+1[index] = 0;

(16)    exit();

(17)    end if

(18)    end for

(19)   end for