System Design Using Bloom Filter | What is Bloom Filter | Data Structure | System Design Interview

Bloom filter is a probability data structure where we want to get a solution in constant time and space complexity for a problem like, if a particular element is present in a list or not.
You might have observed that in a big database query if we are supposed to get a null set as result, the query execution time is very fast where as if it will return some value, query takes a long time.
Same goes for finding is a username is already taken for your mail id or user account on any portal. So where ever we want to check if an element is not already present, Bloom filter makes the execution really fast and it does so in constant space and time.
You can buy us a coffee at : www.buymeacoff...
system design: • System Design | Distri...
DS for beginners: • Arrays Data Structures...
leetcode solutions: • Leetcode 84 | Largest ...
github: github.com/The...
facebook group : / 741317603336313
twitter: / granthtech

[@nipulsindwani117]

Few queries
1. what are the preffered way of implementing these hash functions?
2. why we have choose exactly 3 hash functions?
Thanks for the video btw. Making shorts can help channel.

[@TheTechGranth]

1) these can be similar to the one we used in count min sketch
2) that is just for explanation purpose, more the number of functions, less will be hash collision

[@venkatramanpothiraj9438]

In this example, how can we check whether Chennai is not on the list?

[@TheTechGranth]

We can't that is the point of probabilistic DS, we can only say with 100% guarantee if something is not present. Ideally we should have enough hash function so that collision is minimum

[@venkatramanpothiraj9438]

@@TheTechGranth Got it. Thanks for the clarification.

[@TheTechGranth]

@@venkatramanpothiraj9438 do like and subscribe and share with others 🙂