bloom filter

a probabilistic data structure

A Bloom filter is a space-efficient probabilistic data structure that is used to test whether an element is a member of a set.

It returns either "possibly in set" or "definitely" not in the set. This data structure could be used when we need to find if a username is taken, or an article is read by a user, etc.