Bloomfilters are a unique data structure used to indicate whether an element is contained in a set. What makes
BloomFilter interesting is that it will indicate whether an element is absolutely not contained or may be contained in a set. This property of never having a false negative makes
BloomFilter a great candidate for use as a guard condition to help prevent performing unnecessary or expensive operations, such as disk retrievals.
Bloomfilter are essentially bit vectors. At a high level, Bloomfilter work in the following manner:
When testing whether an element is in the set, you follow ...