A Bloom filter is a space-efficient probabilistic data structure, conceived by Burton Howard Bloom in 1970, that is used to test whether an element is a member of a set. False positive matches are possible, but false negatives are not – in other words, a query returns either "possibly in set" or "definitely not in set". Elements can be added to the set, but not removed (though this can be addresse
![Bloom filter - Wikipedia](https://cdn-ak-scissors.b.st-hatena.com/image/square/490841e520dab9418f4079c726fd043120c06005/height=288;version=1;width=512/https%3A%2F%2Fupload.wikimedia.org%2Fwikipedia%2Fcommons%2Fthumb%2Fa%2Fac%2FBloom_filter.svg%2F360px-Bloom_filter.svg.png)