- System Design
- A bloom filter is a probabilisticdata_structure that is based on hashing. It is extremely space efficient and is typically used to add elements to a set and test if an element is in a set. Though, the elements themselves are not added to a set. Instead a hash of the elements is added to the set.
- It is also used in Apache Spark.
- Apache spark implementation details, https://spark.apache.org/docs/2.1.0/api/java/org/apache/spark/util/sketch/BloomFilter.html#:~:text=A%20Bloom%20filter%20is%20a,then%20this%20is%20definitely%20true.
Applications
- To find of a username is not available.