Description: A tech blog with gists, code, presentations, tutorials, and many goodies around programming, devops, cloud architectures, aws, google cloud platform, and infrastructure.
May 20, 2019 • • data-structures , algorithms •
A Bloom Filter is a Probabilistic Data Structure. The Filter responds to exits(str) with 100% certainty if str is not present. A true response from exists(str) only indicates a probability of str being present, and could be a false positive.
Bloom filters are used to efficiently and accurately check the absence of a value. Typical examples can be blacklist of domains, checks for a username availability for registration, or whether to look for data in cache depending on the key, etc.