Accurate Counting Bloom Filters for Large-Scale Data Processing

Algorithm 1

Query operation in ACBF.

(1) Query (Element 𝑥)

# ACBF is composed of 𝑑 levels 𝑏₁,…,𝑏_𝑑 and an idle space 𝑏_𝑟

# Each bitmap 𝑏_𝑗 has the size of 𝑙_𝑗

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

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

(4)  if  (𝑏₁[index] == 0) then 

(5)   return false;

(6)  end if

(7) end for

(8) return true;