advanced

Bloom Filter

A Bloom Filter is a space-efficient probabilistic data structure used to test whether an element is a member of a set. It can produce false positives but never false negatives, meaning it may incorrectly say an element exists, but will never miss an element that was actually added. It uses multiple hash functions to set bits in a fixed-size bit array.