Why Caching Matters
Caching stores frequently accessed data in fast storage to reduce latency and database load. It's one of the most effective ways to improve system performance.
Cache-Aside Pattern
The application checks the cache first. If data exists (cache hit), it's returned. If not (cache miss), data is fetched from the database and stored in cache.
Write-Through Pattern
Data is written to both cache and database simultaneously. Ensures consistency but may be slower for write operations.
Write-Behind (Write-Back) Pattern
Data is written to cache first, then asynchronously written to database. Faster writes but risk of data loss if cache fails.
Refresh-Ahead Pattern
Cache automatically refreshes data before it expires, reducing cache misses for frequently accessed data.
Cache Eviction Policies
When cache is full, you need to decide what to remove:
- LRU (Least Recently Used): Remove least recently accessed items
- LFU (Least Frequently Used): Remove least frequently accessed items
- FIFO (First In First Out): Remove oldest items
Next Steps
Now that you understand caching, continue with database replication, sharding, and consistency to design the durable layer behind the cache.
A Practical Mental Model for Caching Strategies
A cache stores reusable results in a faster layer so repeated requests avoid expensive computation, database access, or network travel. The definition matters, but the more useful skill is connecting it to a user-visible goal and a measurable operating limit. A design is convincing when it explains what improves, what becomes more complex, and what evidence would trigger the next change.
Cache-aside loads misses on demand, write-through updates cache and storage together, write-behind buffers storage writes, and refresh-ahead renews hot entries before expiry. Each pattern makes a different consistency and failure trade-off. Draw the critical request path first. For every hop, name the work performed, the state read or changed, and the way that hop can fail. This prevents a diagram full of boxes from hiding the actual behavior.
A simple way to reason about caching strategies is to separate four concerns: correctness, performance, availability, and operability. Correctness protects user and business invariants. Performance defines latency and capacity. Availability describes degradation during failure. Operability covers deployment, observation, recovery, and cost. Improving one concern can make another harder, so every design choice needs a stated priority.
Worked Example and Capacity Reasoning
For product details, cache-aside can read Redis first and query the database on a miss. Use a five-minute TTL with event-driven invalidation after an update. Add request coalescing so one miss loads the value while concurrent requests wait instead of all hitting the database.
Turn the narrative into numbers before selecting infrastructure. Estimate average and peak request rates, the read-to-write ratio, payload size, retained data, and acceptable response time. Add headroom for traffic bursts and failures, but show the arithmetic. The goal is not a perfect forecast; it is to distinguish a design that needs one machine from one that needs partitioning, replication, or asynchronous processing.
Next, trace one successful request and one failed request. The successful trace validates the normal data flow. The failed trace forces decisions about timeouts, retries, idempotency, stale data, and user feedback. If the system can only be explained while every dependency is healthy, the design is incomplete.
Design Decisions to Make Explicit
Choose keys and TTLs from access frequency, update frequency, object size, and acceptable staleness. In production, validate this with a small experiment or load test, then expose a metric and an alert that show whether the decision still holds. In an interview, state the trade-off plainly instead of presenting the choice as universally correct.
Define invalidation before rollout; a cache without an ownership rule becomes a second inconsistent database. In production, validate this with a small experiment or load test, then expose a metric and an alert that show whether the decision still holds. In an interview, state the trade-off plainly instead of presenting the choice as universally correct.
Protect hot keys with replication, local caching, or key splitting where a single entry receives extreme traffic. In production, validate this with a small experiment or load test, then expose a metric and an alert that show whether the decision still holds. In an interview, state the trade-off plainly instead of presenting the choice as universally correct.
Cap memory and select an eviction policy that matches whether recent, frequent, or explicitly prioritized data matters. In production, validate this with a small experiment or load test, then expose a metric and an alert that show whether the decision still holds. In an interview, state the trade-off plainly instead of presenting the choice as universally correct.
These decisions should appear next to the component they affect. A short annotation such as “p99 under 250 ms,” “eventual consistency under 30 seconds,” or “survives one availability-zone failure” makes the diagram testable. Without a target, terms such as fast, scalable, and highly available are only aspirations.
Common Failure Modes
- 1. Cache stampedes send many identical misses to storage when a popular key expires. For Caching Strategies, document the expected behavior, the capacity assumption behind it, and the fallback when that assumption stops being true.
- 2. Cache penetration repeatedly queries storage for nonexistent keys. For Caching Strategies, document the expected behavior, the capacity assumption behind it, and the fallback when that assumption stops being true.
- 3. A synchronized TTL expires a large key set at once and creates a traffic spike. For Caching Strategies, document the expected behavior, the capacity assumption behind it, and the fallback when that assumption stops being true.
- 4. Write-behind loses acknowledged changes if the buffer fails before durable persistence. For Caching Strategies, document the expected behavior, the capacity assumption behind it, and the fallback when that assumption stops being true.
Do not try to eliminate every failure. Decide which failures must be masked, which can produce a degraded response, and which should reject new work quickly. Bounded queues, deadlines, bulkheads, and circuit breakers are often safer than unlimited retries. Recovery also needs verification: regularly test restores, failovers, rebalancing, and rollback paths before an incident makes them necessary.
Observability and Production Readiness
At minimum, monitor hit and miss ratio, load latency, eviction rate, stale-read and origin request rate. Break metrics down by endpoint, dependency, region, or partition where an aggregate could conceal a hotspot. Pair metrics with structured logs for local detail and distributed traces for request paths that cross service boundaries.
Alerts should describe user impact or exhausted safety margin, not every small fluctuation. Use service-level objectives to connect telemetry to a promise: for example, 99.9% of valid requests succeed and 99% finish within the target latency over a rolling window. Add dashboards for traffic, errors, duration, saturation, and deployment markers so an operator can see whether a regression began with load, a dependency, or a release.
Capacity planning is continuous. Record the tested limit, current peak, growth rate, and time required to add capacity. If the system needs thirty minutes to scale safely, an alert at ninety-nine percent utilization is too late. Operational readiness is part of system design because a component that cannot be observed or recovered is not dependable.
How to Explain This in a System Design Interview
- Clarify the requirement. Ask which user action depends on caching strategies and define the success target.
- Estimate demand. Calculate peak traffic, data size, and the ratio that drives the design.
- Start simple. Present the smallest architecture that meets the current requirement before adding distributed machinery.
- Find the limit. Explain which resource or failure domain breaks first and how you know.
- Evolve the design. Add the next mechanism, then state its cost, consistency effect, and operational burden.
- Close with failure handling. Walk through one dependency failure and the metrics that reveal it.
This sequence demonstrates judgment. Interviewers usually care less about naming a particular product than about whether you can defend boundaries and adapt when a requirement changes. If a managed service is useful, describe the capability you need first, then mention the product as one implementation.
Review Checklist
- Is the functional scope clear, including what is deliberately excluded?
- Are peak traffic, storage, bandwidth, and latency targets quantified?
- Does every important write have an owner, durability rule, and idempotency strategy?
- Are consistency and staleness visible to the user explained?
- Can the design tolerate one instance, zone, or dependency failure as required?
- Are queues and retries bounded, and is overload rejected or degraded intentionally?
- Can an operator detect, diagnose, roll back, and recover the system?
- Is the next scaling step identified without paying for it prematurely?
Want a guided way to practice these trade-offs? Continue in System Design Fundamentals for Interviews on Udemy, which connects the concepts through complete interview case studies.
Continue Learning
Use the complete System Design interview-preparation guide to place this topic in a four-week roadmap. Then apply the same reasoning to the System Design case-study collection, where requirements, estimates, bottlenecks, and failure modes are combined in end-to-end designs.