Explain Bloom Filter with the help of an example.

16kviews

written 6.5 years ago by

teamques10 ★ 65k

• modified 4.0 years ago

ADD COMMENT EDIT

1 Answer

1.0kviews

written 6.5 years ago by

teamques10 ★ 65k

A Bloom filter consists of:

An array of n bits, initially all 0’s.
A collection of hash functions h1, h2, . . . , hk. Each hash function maps “key” values to n buckets, corresponding to the n bits of the bit-array.
A set S of m key values.

The …

Create a free account to keep reading this post.

and 3 others joined a min ago.

ADD COMMENT EDIT

Please log in to add an answer.