Algorithm 3 Delete (x)

Input.$x,k$ Output. true/false  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: obtain the bucket $B_1,B_2,\dots ,B_k$  4: if $\exists B_i(1\le i\le k)$ and $f\in B_i$ then.  5:     remove f form $B_i$  6:     return true  7: end if  8: return false