Understanding Bloom Filters: Principles, Java Implementation, and Practical Use Cases

Bloom filter, proposed by Bloom in 1970, is a space‑efficient probabilistic data structure composed of a bit array and multiple hash functions, allowing fast membership queries with a controllable false‑positive rate.

The article explains its working principle: each element is hashed by k functions, setting the corresponding bits to 1; to test membership, the same k bits are checked—if any is 0 the element is definitely absent, otherwise it may be present.

Typical applications such as set membership testing, cache‑penetration protection, spam filtering, and blacklist checks are listed.

A concrete Java implementation using Google Guava is provided. First, add the Guava dependency:

<!-- Bloom filter dependency -->
<dependency>
    <groupId>com.google.guava</groupId>
    <artifactId>guava</artifactId>
    <version>25.1-jre</version>
</dependency>

Then, the demo code creates a BloomFilter<CharSequence> with an expected 100 million entries and a false‑positive probability of 0.01 %:

import com.google.common.hash.BloomFilter;
import com.google.common.hash.Funnels;
import java.nio.charset.Charset;

public class BloomFilterDemo {
    public static void main(String[] args) {
        BloomFilter<CharSequence> bloomFilter = BloomFilter.create(
            Funnels.stringFunnel(Charset.forName("utf-8")), 100000000, 0.0001);
        bloomFilter.put("死");
        bloomFilter.put("磕");
        bloomFilter.put("Redis");
        System.out.println(bloomFilter.mightContain("Redis"));
        System.out.println(bloomFilter.mightContain("Java"));
    }
}

To illustrate cache‑penetration mitigation, a sample method shows how to query Redis, fall back to the database only when the Bloom filter indicates possible existence:

String get(String key) {
    String value = redis.get(key);
    if (value == null) {
        if (!bloomfilter.mightContain(key)) {
            return null;
        } else {
            value = db.get(key);
            redis.set(key, value);
        }
    }
    return value;
}

The article concludes that Bloom filters provide a powerful trade‑off between memory usage and query speed, making them suitable for large‑scale systems where occasional false positives are acceptable.