mufassall

Scaling / 4 / 6

Caching

A product page reads the same row from the database thousands of times a second. A cache in front of it makes reads fast, then brings its own problems: stale data, a stampede on a hot key and the question of where writes go.

  • 13 min
  • Intermediate
  • 11 steps
Cache hit ratio
0 %
Reply p95
850 ms
Database reads
2 400 /s
Old price shown for
0 s
Open in Lab

55%92%
  • request
  • reply
  • redelivery
  • duplicate
  • lost

Numbers are a model scenario, not measurements

The real request

Product API → Database

Request

SELECT p.id, p.name, p.price, s.qty
FROM products p
JOIN stock s ON s.product_id = p.id1
WHERE p.id = 1042;

Response

1 row in 38 ms2
  1. JOIN — Two tables joined on every request: price from products, quantity from stock.
  2. 38 ms — Cheap on its own. Not at 2400 times a second on one database.

What happens if…?

Put in your own numbers: the result and the formula update at once.

Every read of the product page.

Share of reads the cache answers.

Reads per second the database can serve.

One GET from the cache.

One JOIN query on an idle database.

Result

Database reads
144/s
Database load
5.5%
Average reply
3.4ms
Reply p95 (rough)
41ms

Working

DB = λ × (1 − h) = 2 400 × (1 − 0.94) = 144/s
ρ = 144 / 2 600 = 5.5%
t(DB) = 38 / (1 − 0.055) = 40.2 ms
avg = h × 1.0 + (1 − h) × 41.2 = 3.4 ms
p95 ≈ miss (1 − h > 5%) = 41 ms

A simplified teaching model: it shows direction and scale, not a benchmark.

Build it yourselfCheat sheetCompare lessons

Course: 74 lessons
  1. 01 Foundations

    1. The life of a request
    2. Latency and throughput
    3. Napkin math
  2. 02 Scaling

    1. Scaling up vs scaling out
    2. Load balancing
    3. Stateless servers
    4. Caching
    5. Cache invalidation
    6. CDN and edge caching
  3. 03 Data & storage

    1. SQL and NoSQL
    2. Database indexes
    3. Geo search: who is nearby
    4. Full-text search
    5. Vector search
    6. Storage engines: B-tree and LSM
    7. Bloom filters
    8. Database replication
    9. Sharding
    10. Consistent hashing
    11. Unique IDs
    12. CAP: when the link breaks
    13. Consensus and leader election
    14. Transactions
    15. File uploads
  4. 04 Communication

    1. API styles
    2. Message queues
    3. Pub/sub and event logs
    4. Real-time updates
    5. Reliable callbacks
    6. Sending webhooks reliably
  5. 05 Reliability

    1. Redundancy and failover
    2. Rate limiting
    3. Timeouts and retries
    4. Observability
    5. SLOs and error budgets
    6. Backpressure
  6. 06 Architecture

    1. Microservices
    2. Service discovery
    3. Sagas and the outbox
    4. Change data capture (CDC)
    5. Transactional outbox
    6. Distributed locks
    7. Batch vs stream
    8. Multi-tenancy
    9. Event sourcing
  7. 07 Security

    1. Authentication
    2. Authorization
    3. Encryption and secrets
    4. Secrets management
  8. 08 Shipping

    1. Testing
    2. CI/CD: from commit to production
    3. Zero-downtime migrations
    4. Feature flags
  9. 09 Whole systems

    1. From requirements to design
    2. Design a URL shortener
    3. Design a news feed
    4. Design a chat
    5. Design a video streaming site
    6. Design search autocomplete
    7. Design a job scheduler
  10. 10 Business processes

    1. Payment gateway
    2. Money and rounding
    3. Double-entry ledger
    4. Payment reconciliation
    5. Subscription billing
    6. Electronic digital signature
    7. Document lifecycle
    8. Audit log
    9. Notification delivery
    10. Bulk import
    11. Refunds and chargebacks
    12. Gapless document numbering
  11. 11 Case studies

    1. Case: how Discord stores messages
    2. Case: Figma multiplayer editing