APIs
Senior GraphQL API: scheduling contract, tenant isolation, observability
Production incident: database call rate 6× normal, HTTP request rate unchanged. Persisted queries are enforced — no unusual hashes. A recent refactor moved one DataLoader out of the context factory into module scope. One line, zero tests catching it, and the cache is now shared across tenants.
DataLoader’s exact scheduling contract
The library uses enqueuePostPromiseJob — a wrapper over process.nextTick in Node.js and Promise.resolve().then in browsers — to schedule the batch dispatch. The dispatch runs:
- After the current synchronous frame
- After any microtasks queued during that frame
This means .load() calls inside resolver bodies, inside .then() chains following synchronous resolver work, and inside nextTick-deferred logic all land in the same batch. The window is bounded by the JavaScript event-loop, not a timer. There is no setTimeout, no setImmediate, no fixed millisecond window.
batchScheduleFn overrides this if you need different semantics (e.g. debouncing at the cluster level via a cross-process broker). Production servers leave the default in place.
Tenant isolation in the cache key
The context factory pattern from lesson 02 is necessary but not sufficient for multi-tenant systems. A new DataLoader instance per request prevents cross-request cache hits, but if the batch function queries data without filtering by tenant, two requests from different tenants within the same Node process can receive each other’s data via the database query (not the cache).
The safe pattern:
context: async ({ req }) => ({
loaders: makeLoaders(req.auth.tenantId),
})
function makeLoaders(tenantId) {
return {
user: new DataLoader(async (ids) => {
const rows = await db.query(
'SELECT * FROM users WHERE id = ANY($1) AND tenant_id = $2',
[ids, tenantId] // tenant scoped at the SQL level
);
const map = new Map(rows.map(r => [r.id, r]));
return ids.map(id => map.get(id) ?? null);
}),
};
}SonarSource’s 2024 audit of OSS GraphQL servers found tenant-leak bugs in 6 of 12 audited codebases — all traceable to module-scope DataLoader or missing tenant filter in the batch query.
APQ vs trusted documents
Two different things called “persisted queries”:
-
Automatic Persisted Queries (APQ): The client computes SHA-256 of the query string and sends only the hash. If the server has not seen the hash before, it returns
PersistedQueryNotFoundand the client resends with the full document. APQ saves bytes on warm cache (5 KB query collapses to 64-character hash). It does not constrain query shape — any client can still send any document. -
Trusted documents: Only pre-registered hashes execute. Unknown hashes are rejected. Registration happens at client build time. This is a security boundary, not a performance optimisation.
Production teams that need both deploy trusted documents and use APQ-style hashing within the registered set.
Why field-count complexity scoring is an under-counting bug
The naive rule “cost = 1 per field, summed” reports cost 50 for a 10-deep query with 5 fields per level. The real cost is in the row expansion at each list level. A query that requests first: 100 at each of 5 levels reads 100^5 = 10^10 rows conceptually — but the field-count rule still reports 50.
The correct formula multiplies by list-argument size:
cost(field) = field_weight + sum(child.first_arg × cost(child))With first: 100 at every level, the calculator returns 100^5 — astronomically over budget, query rejected at AST parse time before any resolver fires. GitHub’s public complexity formula is a documented version of this multiplicative rule.
Alias bomb anatomy
A single document with 1000 root aliases:
q1: user(id: 1) { email }
q2: user(id: 2) { email }
...
q1000: user(id: 1000) { email }This is one valid document, parsed once. Execution runs 1000 resolver calls. DataLoader collapses the database trips to one batch query — but resolver-execution count is still the attacker’s leverage: 1000 resolvers call your permission-checking logic, your logging, your context lookups. A 5 MB document can produce six-figure resolver counts per HTTP request, under any naive per-request rate limit.
Escape.tech’s 2024 audit: 64% of production GraphQL endpoints had no alias caps. Imperva’s 2023 report attributed 18% of GraphQL production incidents to alias-batch DoS.
Minimum-viable observability dashboard
| Metric | Alert condition |
|---|---|
graphql_request_total{operation,outcome} | Error rate above SLO |
graphql_request_duration_p99 | Above latency budget |
graphql_resolver_call_count per request | Above N (N+1 regression) |
graphql_query_cost histogram | Long-tail above budget |
graphql_persisted_query_hit_ratio | Below 90% |
graphql_introspection_request_total | Non-zero in prod (if introspection off) |
Per-resolver tracing via OpenTelemetry GraphQL instrumentation emits a span per type.field call. Aggregating spans by operation gives resolver call counts. Without this instrumentation, an N+1 regression is invisible until the database CPU pages someone.
- GitHub GraphQL points/hour cap
- 5000
- GitHub per-query cost cap
- 1000
- Shopify Storefront per-query cap
- 1000 cost units
- Shopify Storefront throttle
- 1000 cost/sec/IP
- Default depth limit (Apollo Router)
- 10
- List-depth recommendation
- 3–4
- Alias-bomb cap (typical)
- ≤20 root aliases
- Operation-batch cap (typical)
- ≤5 operations
A federated supergraph applies depth limit 7 at the router. Why must each subgraph also apply its own complexity and depth limits?
A complexity rule assigns 'cost = 1 per field, summed across the AST'. A 10-deep recursive query with 5 fields per level reports cost 50 and passes the 1000-cost budget. What is wrong?
DataLoader is instantiated per-request but the batch function queries the database without a tenant filter. What is the failure mode?
- 01Why does Apollo Federation's _entities batching not eliminate the need for DataLoader inside subgraphs?
- 02What is the difference between APQ and trusted documents?
DataLoader’s batch window is the JavaScript event-loop microtask boundary — not a timer. All .load() calls from resolver bodies and their Promise chains land in the same batch. Per-request instantiation prevents cross-request cache pollution; tenant ID in the SQL filter prevents cross-tenant data leaks. APQ saves wire bytes but does not constrain query shape; trusted documents do. Field-count complexity scoring misses list-expansion cost — multiply by first/last arguments to catch 100^5-row queries. Alias bombs bypass rate limits via resolver-count amplification; cap at ≤20 aliases. Wire resolver call counts to OpenTelemetry spans: without per-resolver tracing, N+1 regressions are invisible until the database pages someone.
appears again in202
- 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
- What workers are and why they existjunior
- Web worker mechanics: dedicated, shared, and OffscreenCanvasmiddle
- Structured clone and transferablesmiddle
- Service worker lifecycle and cache strategiesmiddle
- SharedArrayBuffer, Atomics, and cross-origin isolationsenior
- Service worker edge cases: version skew, durability, and navigation trapssenior
- Worker pools, Comlink, and production observabilitysenior
- 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
- Where data fetching happens — and why it decides LCPjunior
- Fetch waterfalls — diagnosis and the Promise.all curemiddle
- React Server Components and Suspense streamingmiddle
- Client-side cache: TanStack Query, SWR, and stale-while-revalidatemiddle
- LCP, prefetch, and race conditions in interactive fetchingmiddle
- Senior internals: RSC payload, caching layers, and production failure modessenior
- The IP envelopejunior
- Reading the IP headermiddle
- 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
- What TLS does and why it existsjunior
- The 1-RTT handshake: key shares and ECDHEmiddle
- Session resumption and 0-RTTmiddle
- Key schedule, SNI, ALPN, and extensionssenior
- 0-RTT defenses, ECH, hybrid PQ, and production TLSsenior
- 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
- The twelve layers: one URL, seven actorsjunior
- 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
- What is OpenTelemetry: API, SDK, Collector, OTLPjunior
- OTel signals, Semantic Conventions, and the OTLP wire formatmiddle
- The OTel Collector: receivers, processors, exporters, and deployment patternsmiddle
- Vendor neutrality, eBPF instrumentation, the Operator, and browser/serverless OTelsenior
- Operating the OTel Collector: reliability, version skew, failure modes, and governancesenior
- 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
- What is trace propagation and why broken propagation is worse than nonejunior
- traceparent and tracestate: the W3C header format in fullmiddle
- Baggage and async boundaries: carrying context across queues and callbacksmiddle
- Async context per language, service mesh, B3 migration, and securitysenior
- Production propagation failures, span links, and platform designsenior
- The debugging funnel: SLO → RED → trace → profilejunior
- OTel architecture: one SDK, four signals, one wire formatmiddle
- The incident loop: from pager to postmortem to preventionmiddle
- Scale, security, and the ROI of observable systemssenior
- 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