Algorithm 2 Query(x)

Input.$x,k$ Output. true/falsev  1: $f\leftarrow h_0\left(x\right)$  2: calculate hash values $h_1\left(f\right),h_2\left(f\right),\dots ,h_k\left(f\right)$  3: acquiring buckets $B_1,B_2,\dots ,B_k$ corresponding to hash values from a hash ring  4: if $\exists B_i(1\le i\le k)$ and $f\in B_i$ then  5:     return true  6: end if  7: return false