and 5 others joined a min ago.
0
4.7kviews
Explain algorithm for Bloom Filter.
1 Answer
0
77views
written 9.5 years ago by
teamques10
★ 70k
|
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 …
and 4 others joined a min ago.
ADD COMMENT
EDIT
Please log in to add an answer.