probabilistic data structure

A bloom filter is a space-efficient probabilistic data structure that tests set membership with possible false positives. This article explains how it works, its trade-offs, and real-world use cases.