How to Prevent Redis Cache Penetration: Empty Objects and Bloom Filters Explained

To avoid overwhelming the database with massive requests, developers often use Redis to cache repeated data, allowing only cache‑misses to query the database and then update Redis.

The simple cache model can encounter problems such as cache breakdown, cache avalanche, and cache penetration, which may cause data inconsistency or even database crashes.

Cache Penetration

When a key is absent in Redis, the request bypasses the cache and hits the database. Malicious users can repeatedly query non‑existent keys, flooding the database. Two common defenses are caching empty objects and using a Bloom filter.

Countermeasures

Cache empty object: store a key with an empty string value (e.g., "" ) in Redis after the first miss, so subsequent requests are served from the cache and the database is protected.

Bloom filter: a probabilistic data structure based on multiple hash functions that quickly determines whether a key likely exists. If the filter says the key exists, the request proceeds to Redis; otherwise it is blocked, preventing unnecessary database hits.

Pros and Cons

Cache empty object

Advantages: simple to implement, easy to maintain.

Disadvantages: consumes extra memory, may cause temporary inconsistency.

Bloom filter

Advantages: low memory usage, no extra keys.

Disadvantages: more complex to implement, possible false positives.