Bloom Filter

• A vector v of N bits

• k independent hash functions. Range 0 to N-1

• For each element x, compute hash functions H1(x), H2(x)…Hk(x)

• Set corresponding bits to 1

• Note: A bit in the resulting vector may be set to 1 multiple times