BLOOM FILTERS

Summary from the TLDR Web Dev newsletter

Bloom Filters are a probabilistic data structures useful for checking membership in a set with efficient space usage. They store information using bits and hash functions and offer fast membership checks. They can give false positives (claiming an item exists when it doesn't), but they never give false negatives (missing an item that exists). In the real world, Bloom filters are commonly used for caching and distributed databases.