Performance
Fix families: JOIN, IN, preload, and DataLoader
You have confirmed an N+1 in the query log: 50 customer queries for one orders page. There are four ways to fix it, and they have different tradeoffs. Picking the wrong one for your data shape can make things worse.
The four fix families
1. JOIN — one query, one trip
Fetch parent and child in a single SQL query using a JOIN:
SELECT o.*, c.name AS customer_name
FROM orders o
JOIN customers c ON o.customer_id = c.id
WHERE o.user_id = 42
LIMIT 50;One round-trip. The database returns everything merged into one result set.
The tradeoff: for one-to-many relationships, the result set duplicates parent columns for every child row. Fifty orders with five line items each produces 250 rows where 200 repeat the same order columns. Network bandwidth and ORM parsing cost can offset the round-trip savings. JOIN works best for one-to-one or small one-to-many (1–5 children per parent).
2. IN — two queries, no duplication
Two round-trips: fetch parents first, then fetch all children using WHERE id IN (...):
-- Query 1: get all orders
SELECT * FROM orders WHERE user_id = 42 LIMIT 50;
-- Query 2: get all customers for those orders
SELECT * FROM customers WHERE id IN (1, 2, 3, ..., 50);No row duplication. The parent result is 50 rows; the children result is up to 50 rows — each row of data appears exactly once.
The tradeoff: the IN list has practical limits. Postgres handles 10 000+ items with growing planner cost; MySQL has a hard limit at max_allowed_packet. For most pagination (10–1000 items), IN is the right default for one-to-many.
3. Preload / eager loading — ORM directive
All major ORMs ship a directive that declares up front what relationships to load. The ORM picks JOIN or IN internally:
# Rails — .includes picks strategy
Order.where(user_id: current_user).includes(:customer).limit(50)
# Django
Order.objects.filter(user=request.user).select_related('customer')[:50]
# SQLAlchemy
session.query(Order).options(selectinload(Order.customer)).filter_by(...).limit(50)
# Prisma
prisma.order.findMany({ where: {...}, include: { customer: true } })All of these produce 2 queries instead of 51. You declare intent; the ORM optimises tactics.
The tradeoff: if you preload too aggressively — loading relationships the request never uses — you waste I/O. Declare only what the current request needs.
4. DataLoader — request-scoped batching
DataLoader (Facebook, 2015) queues lookup IDs across the entire request and fires one batched query when the event loop yields to its next tick:
// Create once per request
const userLoader = new DataLoader(async (ids) => {
const users = await db.user.findMany({ where: { id: { in: ids } } });
return ids.map(id => users.find(u => u.id === id));
});
// Call from anywhere in the request — each call queues the id
const user = await userLoader.load(orderId);DataLoader provides three properties: (1) automatic batching — many load(id) calls become one query, (2) automatic caching — repeated load(id) within the same request returns the cached result without a second query, (3) request scope — the cache is scoped to the request, so stale data does not leak.
The tradeoff: DataLoader requires an async / event-loop runtime. It adds caching complexity and a small batch-window latency (typically under 1 ms). It is the right tool when data needs are scattered across many unrelated code paths in the same request — the canonical case being GraphQL resolvers.
| Fix | Queries | Best for | Tradeoff |
|---|---|---|---|
| JOIN | 1 | One-to-one, small one-to-many | Parent columns duplicated per child row |
| IN | 2 | One-to-many fan-out | IN list limits (~10 k on Postgres) |
| Preload | 2–3 | Known shape at query site | Over-fetches if unused |
| DataLoader | 1 per type | Multi-source, GraphQL resolvers | Async runtime required; cache complexity |
Choosing by cardinality
The rule of thumb:
- One-to-one → JOIN. No duplication. One trip.
- One-to-many (small fan-out) → preload. ORM picks JOIN internally. Simple to write.
- One-to-many (heavy fan-out) → IN-based selectinload. Avoids result-set bloat.
- Multi-source or GraphQL → DataLoader. Batches across unrelated code paths.
Why this works
Why does IN beat JOIN for one-to-many heavy fan-out? A query returning 50 orders with 20 line items each as JOIN returns 1 000 rows where 950 columns repeat the same order data. The network payload and ORM parsing cost can outweigh the round-trip savings of skipping the second query. The IN approach sends 2 queries but no duplication: 50 order rows and 1 000 line-item rows each appear exactly once.
Practical example: a nested eager load
# Rails nested eager load:
User.find(42).projects.includes(tasks: :comments).limit(50)
# Produces:
# SELECT * FROM projects WHERE user_id = 42 LIMIT 50
# SELECT * FROM tasks WHERE project_id IN (1, 2, ..., 50)
# SELECT * FROM comments WHERE task_id IN (...)
# 3 queries instead of 1 + 50 + 250 = 301# Django equivalent:
Project.objects.filter(user=user).prefetch_related('tasks__comments')[:50]# SQLAlchemy:
session.query(Project).options(
selectinload(Project.tasks).selectinload(Task.comments)
).filter_by(user_id=42).limit(50)A page loads 50 blog posts, each with a list of tags (average 10 tags per post). Which fix strategy avoids result-set duplication while keeping the query count low?
A GraphQL query has 'me { posts { author { name } } }' on 50 posts and triggers 1 + 50 author lookups. What is the canonical fix?
Order the steps of diagnosing and fixing an N+1 the senior way:
- 1 Enable DB query log or APM trace, count queries per request
- 2 Identify the call site — often a loop over parents accessing a child relation lazily
- 3 Pick the fix family by cardinality: one-to-one → JOIN; one-to-many → IN/selectinload; multi-source → DataLoader
- 4 Apply the ORM directive or batch loader
- 5 Verify by re-reading the query log: count should drop to 2–5 from N+1
- 6 Re-measure p99 — expect 5–20x improvement for a typical N+1 fix on a list page
- 7 Add CI gate: per-request query count budget, fail PRs that regress
- 01Walk through the four N+1 fix families with one example of when each is the right choice.
- 02Why does IN-based fetching often beat JOIN for one-to-many relationships?
The four N+1 fix families are JOIN (one trip, best for one-to-one), IN-based batching (two trips, no duplication, best for one-to-many fan-out), ORM preload (declares intent at the query site), and DataLoader (request-scoped batching across many code paths, canonical for GraphQL). Cardinality drives the choice: one-to-one favors JOIN; heavy one-to-many favors IN or selectinload; multi-source resolvers favor DataLoader. After applying any fix, verify by inspecting the query log — the count should drop from N+1 to 2–5, and p99 should follow Amdahl on the round-trip share.
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