Bloom Filter
Bloom filters
A Bloom filter is a probabilistic data structure that tests whether an element is a member of a set. It can definitively tell you an element *is not* in the set, but may occasionally return a false positive (indicating an element *might* be present when it isn't). It uses bit arrays and multiple hash functions to achieve this with space efficiency.
11 connections Built by Tim Jones