Bloom Filter

Bloom filters are a probabilistic data structure that checks for presence of an element in a set.

Instead of storing all the elements in the set, Bloom Filters store only the elements’ hashed representation, thus sacrificing some precision. The trade-off is that Bloom Filters are very space-efficient and fast.