data structure

Bloom Filters

  • Used for determining presence of an element in a set.
  • Uses a set of hash functions that return an integer.
  • The returned value is used as index into a bit vector.
  • hash1(element) => index1
  • hash2(element) => index2
  • To search an element, we check for both the index are set. If yes, element might be there. Else say No.
Advertisements

Categories: data structure

Tagged as:

Leave a Reply

Please log in using one of these methods to post your comment:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

This site uses Akismet to reduce spam. Learn how your comment data is processed.