05Design patternsFan-out and feed generation
05 · Reusable pattern
Fan-out and feed generation
Balance write-time and read-time fan-out with celebrity handling and ranked retrieval.Lesson spine
What you need to understand.
Feed design chooses when to pay the fan-out cost and how to combine precomputed candidates with live ranking.
Fan-out on write
Push a new post ID into follower inboxes for fast reads; cost grows with follower count and inactive users.
Fan-out on read
Fetch recent posts from followed accounts and merge at request time; writes stay cheap but reads become scatter-gather.
Hybrid strategy
Push ordinary accounts and pull celebrity content at read time, then merge and rank both candidate sets.
Feed cache
Store bounded candidate IDs in per-user sorted sets and hydrate content separately so edits and privacy remain enforceable.
Pagination
Use an opaque cursor over score, time, and stable tie-breaker; offsets drift under concurrent inserts.
Privacy and deletion
Treat inbox entries as candidates and recheck current authorization before disclosure.
Before the boxes
Frame the decision.
What must work
Balance write-time and read-time fan-out with celebrity handling and ranked retrieval.
What changes the design
Publish rate · follower skew · active-reader ratio · feed size · freshness
What owns the truth
Identify the component that commits authoritative state, then separate synchronous confirmation from derived work.
What stays simple
Do not add global coordination, multi-region writes, or a specialized store until a requirement earns the complexity.
Architecture map
Trace ownership, not just traffic.
Follow the decision from left to right. Every arrow should have a reason.
Publishes item
Commits data
Populate inboxes
Keeps candidates
Hydrates and ranks
Merges live content
Serves pages
Walk one representative request across every arrow. Say whether the handoff is synchronous or asynchronous, what identity makes a retry safe, and which step changes authoritative state.
- 01
Producer — Publishes item Define the output contract before moving to the next owner.
- 02
Content store — Commits data Define the output contract before moving to the next owner.
- 03
Fan-out workers — Populate inboxes Define the output contract before moving to the next owner.
- 04
Inbox store — Keeps candidates Define the output contract before moving to the next owner.
- 05
Read service — Hydrates and ranks Define the output contract before moving to the next owner.
- 06
Celebrity path — Merges live content Define the output contract before moving to the next owner.
- 07
Cache — Serves pages Confirm the result and emit the evidence needed to reconcile it.
Decision table
Make the trade-offs explicit.
| Decision | Defensible position | Cost to acknowledge |
|---|---|---|
| Primary mechanism | Write fan-out gives fast reads; read fan-out avoids celebrity and inactive-user waste. | The stronger guarantee usually adds coordination, latency, state, or operational work. |
| Sync vs. async | Keep only correctness-critical confirmation synchronous. Move derived views, notifications, analytics, and cleanup behind a durable boundary. | Async work needs idempotency, lag monitoring, replay, and a product definition for partial completion. |
| Simple vs. scaled | Begin with one logical owner and a clear API. Partition or replicate only the resource proven to be the first bottleneck. | Migration requires stable identities, versioned contracts, backfill, and a rollback path. |
Failure review
Design the recovery path.
Topic-specific risk
Viral accounts and graph changes create lag, duplicates, and stale privacy.
ResponsePersist enough identity and state to distinguish retry, resume, compensation, and operator repair.
Dependency timeout
A timeout is ambiguous: the remote side may have failed, succeeded, or still be running.
ResponseUse deadlines, bounded backoff with jitter, idempotency keys, and a status or reconciliation path.
Overload or skew
Average capacity can look healthy while a tenant, key, partition, region, or expensive request saturates one owner.
ResponseExpose queue depth and hot-key share, apply backpressure, isolate tenants, and degrade optional work before correctness.
Evidence + level bar
Prove the design can be operated.
Health of the promise
Measure user-visible latency or freshness, correctness drift, saturation, retry volume, and time to recover. Alert on the failed promise—not only CPU.
Complete and clear
Finish the happy path, identify the state owner, choose reasonable building blocks, and explain one scale mechanism.
Trade-offs and failure
Separate read and write paths, define consistency, explain partitioning, and make duplicate or partial failure safe.
Evolution and operations
Discuss multi-region boundaries, migration, tenant isolation, capacity, observability, and how the architecture changes over time.
Interview language
Open the deep dive with a claim.
“For Fan-out and feed generation, the decision I want to make explicit is this: Write fan-out gives fast reads; read fan-out avoids celebrity and inactive-user waste. I’ll trace the state-changing path first, show where the result becomes durable, then test the design against the highest-risk failure and our target scale.”
08 · Retrieval check
Can you defend it without the page?
- For Fan-out and feed generation, where is the correctness boundary and which failure would you test first?
- Which component owns committed truth, and what event or response proves the commit?
- Where is the first scaling or coordination bottleneck under the stated envelope?
- What happens after an ambiguous timeout or duplicate operation?
- Which complexity would you remove at one hundredth of the scale?