An informative data structure that is designed to indicate the elements contained in a set in an efficient manner.
A bloom filter is a data structure with informative properties. The structure is probabilistic in nature and contains four variables. These variables are ‘n’ which describes the number of input elements, ‘m’ which describes the memory used in the array, ‘k’ which is the number of hash functions associated with each input, and ‘p’ which represents the probability of a false positive match.
Bloom filters were created in 1970 by computer scientist Burton Howard Bloom. Its main application is as a fast and memory-efficient method of determining the absence of elements in a set.