Bloom Filter :-

• Bloom Filter is a probabilistic data structure which is used to search an element within a large set of elements in constant time that is O(K) where K is the number of hash functions being used in Bloom Filter.

• A Bloom filter is a data structure designed to tell you, rapidly and memory-efficiently, whether an element is present in a set.

The Bloom Filter is useful in cases where -

• the data to be searched is large
• the memory available on the system is limited/ low

The applications of Bloom Filter are :-

• Weak password detection
• Internet Cache Protocol
• Safe browsing in Google Chrome
• Wallet synchronization in Bitcoin
• Hash based IP Traceback
• Cyber security like virus scanning