The idea of Bloom Filter was conceived by Burton H. Bloom in 1970. In a nutshell, Bloom filter is a space-efficient probabilistic data structure normally used to check for set membership (i.e. Is element x in set S? ). Bloom filter offers incredible memory and run-time savings for set membership queries with a small margin of error i.e. false positives.