Caching

  2. Caching
, ,

How Bloom Filters Work: Hash Bits, False Positives, and Why Deletion Is Hard

A cache, a database, and a CDN edge often need the same cheap answer: have I seen this key before? Storing every key is correct and expensi...

Sarthak Bystander 12 Sept, 2026
, ,

How Consistent Hashing Works: Rings, Virtual Nodes, and Why Keys Move

A cache cluster, a sharded database, and a content-delivery edge all share one problem: given a key, which machine should own it? The naive...

Sarthak Bystander 8 Sept, 2026