Probabilistic Data Structure

A Bloom filter is a probabilistic data structure used to test whether an element is a set member. A bloom filter can query against large amounts of data and return either "possibly in the set" or "definitely not in the set".

Count-min sketch (CM sketch) is a probabilistic data structure used to estimate the frequency of events in a data stream.