Frontend Architecture
Client-side cache: TanStack Query, SWR, and stale-while-revalidate
A user opens a product page, navigates away, and comes back 10 seconds later. With plain useEffect, they wait for the full fetch again. With TanStack Query, the page shows the cached result instantly while a background refresh quietly checks for updates. Same data, radically different experience.
The stale-while-revalidate pattern
Stale-while-revalidate is a cache freshness strategy from RFC 5861: serve cached data immediately even if it might be stale, then re-fetch in the background. The user sees content without waiting; the UI updates when fresh data arrives if it changed.
Both TanStack Query and SWR implement this:
// TanStack Query
const { data, isLoading } = useQuery({
queryKey: ['product', id],
queryFn: () => fetchProduct(id),
staleTime: 30_000, // data is "fresh" for 30s — no background refetch
gcTime: 300_000, // unused cache entries live for 5min before GC
});First visit: isLoading=true, fetch fires, data arrives, isLoading=false.
Second visit (within gcTime): data returns instantly from cache. Background fetch updates it if staleTime has elapsed.
The queryKey is the cache key. ['product', id] is a separate cache entry from ['product', otherId]. Arrays of primitives work; TanStack Query serialises them deterministically.
Single-flight deduplication
When multiple components mount at the same time and all call useQuery(['products']), TanStack Query fires only one network request. All components share the result. This is called single-flight de-duplication — it collapses N identical in-flight requests into one, avoiding both wasted bandwidth and cache races.
// 10 <ProductCard> components on the page, each calling:
useQuery({ queryKey: ['products'], queryFn: fetchProducts });
// → exactly ONE network request firesSWR does the same. This makes library-based caching dramatically safer than rolling your own useState + useEffect per component.
Optimistic updates
For actions that should feel instant — Like, Bookmark, Mark as Read — apply the change locally before the server confirms it, then roll back on error.
const mutation = useMutation({
mutationFn: (postId: string) => likePost(postId),
onMutate: async (postId) => {
// 1. Cancel any outgoing refetches to avoid overwriting optimistic update
await queryClient.cancelQueries({ queryKey: ['post', postId] });
// 2. Snapshot the current value
const previous = queryClient.getQueryData(['post', postId]);
// 3. Optimistically update
queryClient.setQueryData(['post', postId], (old) => ({ ...old, liked: true, likeCount: old.likeCount + 1 }));
return { previous };
},
onError: (err, postId, context) => {
// Roll back to snapshot on failure
queryClient.setQueryData(['post', postId], context.previous);
},
onSettled: (postId) => {
// Invalidate to get canonical server state
queryClient.invalidateQueries({ queryKey: ['post', postId] });
},
});The pattern: apply the expected server response shape locally, let the real response replace it. If the shapes match, the replacement is a no-op and the user sees no flicker.
Cache invalidation strategies
When a mutation succeeds, stale queries must be refreshed. Three approaches:
invalidateQueries — mark queries stale, trigger refetch on next observer. Safest; guaranteed canonical server data.
queryClient.invalidateQueries({ queryKey: ['posts', userId] });setQueryData — write the mutation response directly into the cache. Cheapest; no extra network call. Only correct when the mutation response includes the complete new state.
queryClient.setQueryData(['post', id], serverResponse);refetchQueries — force immediate fetch. Use when you need fresh data now and cannot trust the mutation response.
Most production code uses both: setQueryData for the directly-mutated entity (if the API returns it), invalidateQueries for listing queries that reference it.
Why this works
TanStack Query v5 renamed cacheTime to gcTime to clarify what it controls — not how long data is cached (that’s staleTime) but how long unused entries live before garbage collection. If staleTime is 0 and gcTime is 300s, the cache entry lives for 5min but is re-fetched on every access. If staleTime is 60s, no re-fetch happens for 60s after the last successful fetch.
- TanStack Query v5 size
- ~16 KB gzipped
- SWR size
- ~5 KB gzipped
- Default staleTime (both)
- 0ms (always stale)
- Default gcTime (TanStack Query)
- 5 minutes
- RFC 5861 (stale-while-revalidate)
- HTTP analog
A useQuery returns isLoading=false and data. The user navigates away and back to the same page. What is the default UX?
Why does TanStack Query implement single-flight de-duplication?
An optimistic Like update works, but the like count un-likes itself a moment later. Most likely cause?
- 01What does staleTime control in TanStack Query?
- 02What is the canonical optimistic update pattern in TanStack Query?
- 03When should you use invalidateQueries vs setQueryData after a mutation?
TanStack Query and SWR manage a shared cache keyed by queryKey arrays with stale-while-revalidate semantics: staleTime controls freshness (default 0), gcTime controls entry lifetime (default 5min). Multiple components calling the same query key get one network request via single-flight deduplication. Optimistic updates apply the expected mutation result locally using setQueryData with a snapshot for rollback; the onMutate snapshot must mirror the complete server response shape or the UI flickers when the real data arrives. After mutations, invalidateQueries ensures listing caches reflect changes; setQueryData handles direct entity cache writes when the mutation response is available.
appears again in178
- Why GraphQL gets N+1junior
- DataLoader mechanics: tick-boundary batchingmiddle
- Batch function contracts: ordering, shapes, errorsmiddle
- Federation and lookahead: batching beyond DataLoadermiddle
- Query complexity defences: depth, cost, persisted queriesmiddle
- Senior GraphQL API: scheduling contract, tenant isolation, observabilitysenior
- Why idempotency: making retries safejunior
- Server-side state machine: four states of an idempotency keymiddle
- Outbox and inbox: effectively-once across the dual-write boundarymiddle
- Concurrency and cache architecture for idempotency at scalesenior
- Observability, production failures, and global-scale designsenior
- The event loop: one thread, three queuesjunior
- Tasks, microtasks, and scheduler.yield()middle
- Microtask starvation, Long Tasks, and LoAFsenior
- Node.js event loop: phases, nextTick, and loop lagsenior
- React, Vue, and INP observability in productionsenior
- The render pipeline: six stages from bytes to pixelsjunior
- Stage costs and the renderer process modelmiddle
- Invalidation, dirty bits, and containmiddle
- Compositor layers: promotion, overlap, and GPU memorymiddle
- DevTools flame strip and the frame lifecyclemiddle
- Layout thrash: forced synchronous layoutsenior
- BeginMainFrame, compositor-driven animations, and GPU memorysenior
- Production observability: LoAF, INP, and the full attack surfacesenior
- What V8 is and why performance varies 100×junior
- V8''''s four-tier JIT pipeline and profile-guided tieringmiddle
- Hidden classes, transition trees, and memory layoutmiddle
- Inline caches, IC states, and deoptimizationmiddle
- Orinoco GC: parallel scavenger, concurrent marking, and write barriersmiddle
- TurboFan''''s speculative engine and the deopt-loop trapsenior
- V8 in production: isolates, pointer compression, and real failuressenior
- Service worker lifecycle and cache strategiesmiddle
- Service worker edge cases: version skew, durability, and navigation trapssenior
- What the reconciler does: render vs commitjunior
- The fiber object and the double-buffer treemiddle
- Render phase purity and commit phase sub-stepsmiddle
- Reconciliation: diffing heuristics and the key trapmiddle
- Priority lanes, time-slicing, and useTransitionmiddle
- Bailout, memoisation, and tearingsenior
- React Profiler, the Compiler, and production observabilitysenior
- Rendering strategies: SSG, SSR, ISR, streaming, and hydrationjunior
- SSG, SSR, ISR, streaming, and RSC — how each worksmiddle
- Hydration cost: selective, progressive, islands, resumabilitymiddle
- Hydration mismatch: causes, detection, and the determinism rulesenior
- RSC, per-route strategy, and production observabilitysenior
- Core Web Vitals: what LCP, INP, and CLS measurejunior
- CLS: why layout shifts happen and how to stop themmiddle
- Metric tradeoffs, RUM attribution, and the CI+field loopsenior
- The full picture: URL to LCP to INP as a relay racejunior
- Eight layers traced: from the service worker to the second navigationmiddle
- Five canonical breaks: where production reliably diessenior
- The three-track method: reading traces and building a monitored systemsenior
- What is a cache stampede and why it makes things worsejunior
- Lock and single-flight: bounding concurrent rebuildsmiddle
- XFetch: coordination-free probabilistic early expirationmiddle
- Stale-while-revalidate and CDN request coalescingmiddle
- Detecting stampedes and designing TTL for productionmiddle
- Metastable failure, fencing tokens, and production postmortemssenior
- What a relation is: tables, rows, keys, and constraintsjunior
- Constraints, keys, and Postgres data typesmiddle
- Normal forms, denormalization, and why schemas stickmiddle
- JSONB, arrays, and when a side table winsmiddle
- Heap storage, TOAST, and column alignmentsenior
- Schema integrity: deferral, versioning, and production failure modessenior
- Relational vs document, wide-column, graph, and key-valuesenior
- Index-only scans, the Visibility Map, and INCLUDEsenior
- Production failure modes and the index audit playbooksenior
- pg_statistic, ANALYZE, and production observabilitymiddle
- Production failure modes and plan stabilitysenior
- MVCC: why readers and writers never wait for each otherjunior
- Row versions and snapshots: the on-disk mechanicsmiddle
- HOT updates and isolation levels: what you gain and what you paymiddle
- Vacuum and bloat: keeping the storage tax boundedmiddle
- CLOG, XID wraparound, and MultiXact: deep visibility internalssenior
- SSI internals and production autovacuum tuningsenior
- Real-world MVCC failures, deployment patterns, and distributed snapshotssenior
- Connection pools: amortising the cost of a Postgres backendjunior
- PgBouncer session, transaction, and statement modesmiddle
- Pool sizing: the (cores × 2) + spindles formula and the two-layer stackmiddle
- Pool exhaustion and idle-in-transaction: the 3 AM failure modemiddle
- Migrating to transaction mode: rollout playbook and PgBouncer 1.21 prepared statementsmiddle
- The Postgres process model and why raising max_connections degrades throughputsenior
- Pooler landscape 2026, serverless connection storms, and the full failure-mode taxonomysenior
- What a schema migration is and why it replaces ad-hoc DDLjunior
- ADD COLUMN: instant in PG 11+ vs rewrite in older Postgresjunior
- The lock-queue failure mode: why instant DDL can freeze the databasemiddle
- Safe DDL patterns: NOT VALID, CONCURRENTLY, and unsafe-op fixesmiddle
- Expand-contract: zero-downtime for breaking schema changesmiddle
- Advisory locks, migration tools, and deploy coordinationsenior
- Migration failure taxonomy and production disciplinesenior
- Why sharding exists: the single-Postgres ceilingjunior
- Shard-key selection: hash, range, list, and directory strategiesmiddle
- Partitioning vs sharding: same word, two different thingsmiddle
- Co-location and Citus: the invariant that makes sharding usablemiddle
- The hot-shard failure mode: detection, isolation, and durable policymiddle
- Schema-based sharding and multi-tenancy alternativessenior
- Online resharding, 2PC, and the operational cost of shardingsenior
- The seven acts: from CREATE TABLE to Citusjunior
- Acts 1–3 in depth: schema, indexes, and planner statisticsmiddle
- Acts 4–6 in depth: MVCC bloat, connection pooling, and safe migrationsmiddle
- Act 7 in depth: sharding, co-location, and the seven-tier tradeoff cascademiddle
- Observability, anti-patterns, and production triagesenior
- Raft roles, terms, and why majority quorums prevent split brainjunior
- How Raft replicates a log entry and decides it is safe to commitmiddle
- Raft leader election: timeouts, voting rules, and the four safety propertiesmiddle
- Raft in the real world: partitions, slow disks, and client routingmiddle
- Raft extensions: pre-vote, learners, snapshots, and linearizable readssenior
- Raft in production: membership changes, Multi-Raft, and observabilitysenior
- The three-way handshakejunior
- Sequence numbers and connection statemiddle
- DNS: what it does and why it existsjunior
- The resolver walk: referrals, record types, and gluemiddle
- TTL, caching, and DNS propagationmiddle
- The 1-RTT handshake: key shares and ECDHEmiddle
- Session resumption and 0-RTTmiddle
- WebSocket: the HTTP upgrade handshakejunior
- WebSocket frame format: opcodes, masking, fragmentationmiddle
- WebSocket backpressure: when clients can''''t keep upmiddle
- Reconnection: jittered backoff, thundering herd, message resumptionsenior
- WebSocket at scale: HTTP/2 multiplexing, permessage-deflate, C10Msenior
- WebSocket in production: proxies, security, and distributed architecturesenior
- What reverse proxies dojunior
- Health checks, connection draining, and slow startmiddle
- Session affinity, consistent hashing, and the right fixmiddle
- Retry storms, circuit breakers, and load sheddingsenior
- Resilient LB architecture: anycast, zone-aware routing, and observabilitysenior
- Why QUIC and not TCP+TLSjunior
- Connection IDs and network migrationmiddle
- 0-RTT resumption and packet encryptionsenior
- DDoS: what it is and why it worksjunior
- Amplification attacks and state exhaustionmiddle
- Rate limiting: algorithms and architecturemiddle
- WAFs, firewalls, mTLS, and HSTSmiddle
- DNS cache poisoning and BGP hijackingsenior
- Defense-in-depth architecture and attack economicssenior
- DNS, TCP, TLS in sequence: where the milliseconds gomiddle
- Proxy intercepts and security gates: rate limiters, WAF, mTLSmiddle
- Alternate paths: QUIC 0-RTT, WebSocket upgrade, connection migrationmiddle
- Observability: distributed traces, USE/RED, and samplingsenior
- Resilience: cascading retries, circuit breakers, and error budgetssenior
- What the three signals are: logs, metrics, and tracesjunior
- Why structured logs exist: the diary vs the spreadsheetjunior
- The production log schema: fields every line must carrymiddle
- PII redaction and log injectionsenior
- OTel Logs Data Model and audit logs as a subsystemsenior
- SLI, SLO, and the error budget: reliability by the numbersjunior
- Error budget policy, latency SLOs, and composite journeysmiddle
- Production SLO failures, self-observability, security, and the big picturesenior
- The incident loop: from pager to postmortem to preventionmiddle
- Cache lines, struct layout, and false sharingmiddle
- SIMD, SoA vs AoS, and memory bandwidthmiddle
- Cache-oblivious algorithms, PGO, and production failuressenior
- GC in production: observability, security, edge cases, and fleet governancesenior
- Batching: amortize fixed cost per operationjunior
- The batching window: size and wait timemiddle
- Batching in Kafka and Postgresmiddle
- io_uring and observability of batchingmiddle
- From Nagle to io_uring: evolution of batchingmiddle
- Backpressure, failure isolation, and batch security in productionsenior
- CI enforcement and RUM: making budgets stickmiddle
- V8 JIT pipeline, HTTP priorities, and bundle securitysenior
- The performance loop: discipline, not a projectjunior
- Classify and fix: matching bottleneck families to remediesmiddle
- Observability stack and CI gates: catching regressions before they shipmiddle
- Incident to enforcement: SLO burn to verified fix in 35 minutesmiddle
- Culture, economics, and org-scale performancesenior
- At-most-once, at-least-once, exactly-once: the three delivery contractsjunior
- The three failure legs — where duplicates and losses actually happenmiddle
- Consumer-side dedup: the cheapest path to exactly-once processingmiddle
- Kafka exactly-once semantics: idempotent producer and transactionsmiddle
- SQS visibility timeout, DLQ, and the outbox patternmiddle
- Exactly-once in production: impossibility proof, hybrid patterns, and real incidentssenior
- What OAuth is and why passwords are not the answerjunior
- Authorization code flow with PKCEmiddle
- ID token validation and JWKS cache managementmiddle
- Refresh token rotation and scope-based least privilegemiddle
- Sender-constrained tokens: DPoP and mTLSsenior
- OAuth in production: audience attacks, observability, and real failuressenior