Bloom Filters

Bloom filters is a data structure that is designed to tell you efficiently both in memory and speed whether an item is in a set. But the cost of this efficiency is that it is probabilistic. It can tell you that an item is either: Definitely not in a set. Might be in a set.