Performance
DataLoader: batching across resolver trees
A GraphQL query for me { posts { author { name } } } on 50 posts triggers 1 + 50 author lookups. The ORM eager-load approach cannot help here — the data need is scattered across 50 independent resolver calls, not concentrated at one query site. DataLoader is the structural fix.
Why ORM eager loading is not enough for GraphQL
ORM eager loading (includes, select_related, joinedload) works by declaring relationships at the query construction site. You write one query with relationships declared up front. In a GraphQL server, there is no single query construction site — each resolver runs independently for each parent object. There is no natural place to say “by the way, I will also need the author for all of these posts.”
When 50 post resolvers each call db.user.findUnique({ where: { id: authorId } }), the ORM does not know they are all asking for the same kind of data. It fires 50 queries.
DataLoader solves this by moving batching to the request scope, not the query scope.
How DataLoader works
Facebook open-sourced DataLoader in 2015 alongside GraphQL.js. The mechanism:
- A DataLoader instance is created once per request (not per call).
- Any code in the request calls
loader.load(id), which returns a Promise and queues the id internally — it does not execute a query. - When the current synchronous work finishes and the event loop reaches its next tick, the loader fires one batched query:
SELECT * FROM users WHERE id IN (all queued ids). - The loader distributes results to each waiting Promise in order.
// Create once per request (e.g., in GraphQL context)
const userLoader = new DataLoader(async (ids) => {
// ids is the batch: all IDs queued since last tick
const users = await db.user.findMany({
where: { id: { in: ids } },
});
// Must return results in the same order as ids
return ids.map(id => users.find(u => u.id === id) ?? null);
});
// In a Post resolver — called 50 times for 50 posts
const resolveAuthor = async (post) => {
return userLoader.load(post.authorId);
// Does NOT query immediately — queues the ID
};
// After all 50 resolvers have queued their IDs,
// DataLoader fires one query:
// SELECT * FROM users WHERE id IN (1, 2, ..., 50)Three properties DataLoader provides:
- Automatic batching — many
load(id)calls in one event-loop tick become one query. - Automatic caching —
load(id)called twice in the same request returns the cached result without a second query. - Request scope — the cache is scoped to the request object, so stale data does not leak between requests.
| Step | What happens | Queries fired |
|---|---|---|
| Resolver calls load(1) | ID 1 queued; Promise returned | 0 |
| Resolver calls load(2) … load(50) | IDs 2–50 queued | 0 |
| Event loop ticks | Loader fires batch query | 1 |
| Results arrive | Each Promise resolves with its row | 0 |
GraphQL four-level N+1
The shape compounds with nesting depth. For a query me { teams { projects { members { name } } } }:
- teams resolver: 1 query
- projects resolver (per team): N queries
- members resolver (per project): N×M queries
- name: included in members, no extra queries
Total without DataLoader: 1 + N + (N×M) queries. With DataLoader per type: 4 queries total — one per type per request.
// Each loader batches one type
const teamLoader = new DataLoader(ids => batchLoadTeams(ids));
const projectLoader = new DataLoader(ids => batchLoadProjects(ids));
const memberLoader = new DataLoader(ids => batchLoadMembers(ids));
// Each resolver just calls the loader:
const resolveTeams = (user) => teamLoader.load(user.id);
const resolveProjects = (team) => projectLoader.load(team.id);
const resolveMembers = (project) => memberLoader.load(project.id);Impact: query count drops 100–1000x depending on fan-out depth. p99 drops from 1.4 s to ~150 ms for a typical four-level query.
DataLoader vs ORM eager loading: when to use each
DataLoader is more powerful and more complex than ORM eager loading. Choose based on where the data needs originate:
- Known shape at query site → ORM eager loading. One declaration, ORM handles it.
- Data needs scattered across many code paths → DataLoader. Batches across resolver trees or module boundaries.
The deciding question: “do I know at one place in the code what all the data needs are?” If yes, eager load. If no, DataLoader.
Why this works
DataLoader is fundamentally tied to async / promise-based runtimes because it relies on event-loop ticks to trigger batching. Synchronous codebases need explicit batch-coordination: collect IDs in a first pass, query once, distribute in a second pass. Many languages now have DataLoader ports: graphql-java/dataloader (Java), aiodataloader (Python asyncio), DataLoader.NET (C#), graphql-dataloader (Go).
A GraphQL resolver calls userLoader.load(post.authorId) 50 times for 50 posts. How many database queries does DataLoader fire?
A team is building a REST API endpoint that assembles data from three database tables by ID lookups scattered across three helper modules. Which tool is best suited?
Order the events in a DataLoader batch cycle, from first call to resolved promises:
- 1 Resolver calls loader.load(id) — Promise returned, ID queued
- 2 More load() calls from other resolvers — IDs accumulate in the batch
- 3 Current synchronous work completes; event loop ticks
- 4 DataLoader fires: SELECT * WHERE id IN (all queued IDs)
- 5 Results arrive; each Promise resolves with its corresponding row
- 01Walk through how DataLoader differs from ORM eager loading and when each is the right tool.
- 02A GraphQL query has four levels of nesting: me { teams { projects { members } } }. Explain how DataLoader reduces query count.
DataLoader batches ID lookups across an entire request into one query per type, firing when the event loop ticks. Unlike ORM eager loading, which must be declared at a single query site, DataLoader works across scattered code paths — making it the canonical fix for GraphQL resolver N+1, where each resolver independently requests related data. It provides three guarantees: automatic batching, request-scope caching, and no stale-data leakage across requests. The DataLoader pattern is async-first; synchronous codebases need explicit two-pass collect-then-query coordination instead.
appears again in159
- The journey of a request: seven stops from socket to responsejunior
- Accept and parse: from kernel queue to a typed requestmiddle
- Routing and middleware: choosing what runs, and in what ordermiddle
- Handler and response: from business logic to bytes on the wiremiddle
- Streaming and backpressure: when the client reads slower than you writesenior
- Timeouts and tail latency: budgets, deadlines, and the fan-out trapsenior
- Middleware and DI: the two patterns that shape every backendjunior
- Writing middleware: signatures, next(), and the three framework modelsmiddle
- Inversion of control: how dependencies reach a classmiddle
- DI scopes and lifecycles: singleton, request, transientmiddle
- DI as a testing seam: fakes, mocks, and the boundary that matterssenior
- DI containers in production: resolution graphs, circular deps, and when not tosenior
- Blocking vs non-blocking I/O: two ways to waitjunior
- The event loop: one thread, ordered phasesmiddle
- What blocks the loop: CPU work and sync callsmiddle
- Offloading CPU work: worker threads and the libuv poolmiddle
- Backpressure and bounded concurrencysenior
- Throughput under load: tail latency and saturationsenior
- Why pool: the cost of creating a connectionjunior
- Pool sizing: why bigger is not fastermiddle
- Acquisition and timeouts: the wait queue is the real latency dialmiddle
- Retry strategies: backoff, jitter, and thundering herdmiddle
- Observability, production failures, and global-scale designsenior
- Tasks, microtasks, and scheduler.yield()middle
- Timer accuracy, throttling, and idle workmiddle
- Node.js event loop: phases, nextTick, and loop lagsenior
- Rendering strategies: SSG, SSR, ISR, streaming, and hydrationjunior
- SSG, SSR, ISR, streaming, and RSC — how each worksmiddle
- Hydration cost: selective, progressive, islands, resumabilitymiddle
- Core Web Vitals: what LCP, INP, and CLS measurejunior
- LCP: four phases, one dominant costmiddle
- INP: input delay, processing, presentationmiddle
- Lab vs field: why the two disagree and how to use eachmiddle
- 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 an index is and how it speeds up queriesjunior
- The leading-column rule and composite index designmiddle
- Partial, expression, and covering indexesmiddle
- Index types: GIN, GiST, BRIN, Hash, Bloom, and HOT updatesmiddle
- Index-only scans, the Visibility Map, and INCLUDEsenior
- Production failure modes and the index audit playbooksenior
- Index design exercise: full-text search strategysenior
- EXPLAIN and execution plans: what the planner decides and whyjunior
- Scan types: Seq, Index, Bitmap, Index-Onlymiddle
- Join algorithms and the row-estimate cascademiddle
- pg_statistic, ANALYZE, and production observabilitymiddle
- Extended statistics: fixing correlated-column estimate failuressenior
- Plan cache, cost-constant tuning, and planner internalssenior
- Production failure modes and plan stabilitysenior
- 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
- 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
- Migration failure taxonomy and production disciplinesenior
- Shard-key selection: hash, range, list, and directory strategiesmiddle
- Co-location and Citus: the invariant that makes sharding usablemiddle
- The hot-shard failure mode: detection, isolation, and durable policymiddle
- 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
- Bits on the wirejunior
- Latency mathmiddle
- Bufferbloat and congestionsenior
- The physical frontiersenior
- Sequence numbers and connection statemiddle
- Flow control and congestion controlmiddle
- BBR, production observability, and beyond TCPsenior
- CDN: putting content next doorjunior
- Anycast and GeoDNS: routing to the nearest edgemiddle
- Tiered cache and Cache-Controlmiddle
- Vary header and cache keysmiddle
- Stale-while-revalidate and cache stampedesenior
- Edge workers and edge-side compositionsenior
- CDN operations and observabilitysenior
- WebSocket: the HTTP upgrade handshakejunior
- WebSocket vs SSE vs long-polling: choosing the right transportmiddle
- 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
- Balancing algorithms: round-robin to power-of-two-choicesmiddle
- L4 vs L7 load balancing and client-IP preservationmiddle
- Health checks, connection draining, and slow startmiddle
- Retry storms, circuit breakers, and load sheddingsenior
- Resilient LB architecture: anycast, zone-aware routing, and observabilitysenior
- Why QUIC and not TCP+TLSjunior
- QUIC streams and head-of-line blockingjunior
- Integrated handshake and 1-RTTmiddle
- Connection IDs and network migrationmiddle
- Loss detection and congestion controlmiddle
- 0-RTT resumption and packet encryptionsenior
- Deployment tradeoffs and CPU costsenior
- 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
- Critical render path and Core Web Vitalsmiddle
- 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
- Metrics and cardinality: the cost model of a time-series databasemiddle
- Logs and volume: the cost model of structured loggingmiddle
- Traces and sampling: the cost model of distributed tracingmiddle
- Join keys and exemplars: making the three signals composemiddle
- Observability 2.0: wide events and the cost shiftsenior
- Failure modes and engineering practice: cardinality budgets, PII, and samplingsenior
- Why structured logs exist: the diary vs the spreadsheetjunior
- The production log schema: fields every line must carrymiddle
- Log levels and alert routingmiddle
- Sampling strategies and log costmiddle
- PII redaction and log injectionsenior
- Trace context propagation in logssenior
- OTel Logs Data Model and audit logs as a subsystemsenior
- OTel signals, Semantic Conventions, and the OTLP wire formatmiddle
- Auto-instrumentation and manual spans: the 80/20 of OTelmiddle
- The OTel Collector: receivers, processors, exporters, and deployment patternsmiddle
- Sampling strategies: head, tail, and parent-basedmiddle
- Vendor neutrality, eBPF instrumentation, the Operator, and browser/serverless OTelsenior
- Operating the OTel Collector: reliability, version skew, failure modes, and governancesenior
- RED and USE: two checklists, one triage disciplinejunior
- Instrumenting RED in Prometheus: counters, histograms, and cardinality disciplinemiddle
- USE on Linux: CPU, memory, disk, network, and PSImiddle
- Golden signals, dashboard layout, and service mesh auto-REDmiddle
- Cardinality as a cost driver: labels, PII, exemplars, and samplingmiddle
- Native histograms, SLO tie-in, and production failure patternsmiddle
- Choosing SLIs and SLO targets: ratios, not feelingsmiddle
- Multi-window multi-burn-rate alerting: why AND beats ORmiddle
- Error budget policy, latency SLOs, and composite journeysmiddle
- Iceberg SLIs, composite SLO math, and SLA vs SLOsenior
- Flame graphs: reading the picture that shows where time goesjunior
- Sampling vs instrumentation profiling: why 99 Hz wins in productionmiddle
- Profile types: CPU, memory, off-CPU, mutex — which one to reach formiddle
- Continuous profiling: always-on flame graphs with eBPF and trace-id correlationmiddle
- How flame graphs are built from samples, and the production workflows that use themmiddle
- Linux perf, eBPF internals, PGO, and the limits of samplingsenior
- Profiling in production: security, war stories, OTel profiles, and the infrastructure designsenior
- The debugging funnel: SLO → RED → trace → profilejunior
- OTel architecture: one SDK, four signals, one wire formatmiddle
- Cost discipline: keeping observability under 5% of infra spendmiddle
- Scale, security, and the ROI of observable systemssenior