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.buymeacoffee.com/thetechg...
system design: • System Design | Distri...
DS for beginners: • Arrays Data Structures...
leetcode solutions: • Leetcode 84 | Largest ...
github: github.com/TheTechGranth/theg...
facebook group : / 741317603336313
twitter: / granthtech
31 июл 2024
