Caching is awesome but it doesnβt come without a cost, just like many things in life. One of the issues is ππππ‘π ππ’π¬π¬ ππππππ€. Please correct me if this is not the right term. It refers to the scenario where data to fetch doesn't exist in the database and the data isnβt cached either. So every request hits the database eventually, defeating the purpose of using a cache. If a malicious user initiates lots of queries with such keys, the database can easily be overloaded.
If hacker are using randomly generated key, cache with null value will still have the same issue.
Sometimes, I see it can be called caching penetration.
How many keys can a bloom filter hold?