Observability
Metrics and cardinality: the cost model of a time-series database
A team adds a customer_email label to their request_total counter to track per-customer error rates. Within two hours the Prometheus server runs out of memory and 15 minutes of alerts go missing. The label looked harmless.
How a metric is stored
The canonical model is Prometheus. A metric is identified by a (metric_name, label_set) pair, where the label set is a small fixed collection of key=value pairs. Every unique combination of label values creates one time series — a stream of (timestamp, value) samples, typically scraped every 15 s.
Four standard metric types:
- Counter — monotonically increasing integer. Only a rate-of-change (per second) is meaningful. Example:
http_requests_total. - Gauge — instantaneous reading that can go up or down. Example:
memory_used_bytes,queue_depth. - Histogram — distributes observations across pre-defined buckets for percentile queries. Example:
http_request_duration_secondswith buckets[0.01, 0.05, 0.1, 0.5, 1.0, 5.0]. - Summary — pre-computed per-replica percentile. Rarely used for new instrumentation because it cannot be aggregated across replicas.
The compute model is pre-aggregation at the source: the application increments counters in-process, the scraper ships them to the TSDB, and the TSDB stores deltas and serves queries by walking pre-rolled-up buckets. This is why metric queries return in tens of milliseconds across years of history: the heavy lifting happened at write time, not read time.
| Type | Goes up/down | Use for | Example |
|---|---|---|---|
| Counter | Up only | Rate of events | http_requests_total |
| Gauge | Both | Current state | memory_used_bytes |
| Histogram | Up only (buckets) | Latency distribution, percentiles | http_request_duration_seconds |
| Summary | Pre-computed | Percentile at source (not aggregatable) | Legacy; prefer histogram |
Cardinality: the central cost driver
Each unique combination of label values creates a separate time series in the TSDB. The math is multiplicative:
route(20 templates) ×method(5 verbs) ×status_class(4 classes) = 400 series — fine.- Same metric +
user_id(100 k active users) = 100 k × 20 × 5 × 4 = 40 million series — Prometheus OOM on 16 GB.
Prometheus stores roughly 3 KB per active series in the head block. At 40 M series that is 120 GB, far beyond any commodity machine’s memory.
Both Grafana’s published guidance and the Prometheus instrumentation documentation say the same thing: label only with values from a small fixed set — route templates not full URLs, status classes not status codes, customer segments not customer IDs. Anything with unbounded values belongs in logs (free cardinality) or traces (sampled), not metrics.
The exemplar bridge
When a histogram records a slow observation, the client can attach one exemplar — a trace_id from the request that produced the observation. Grafana renders exemplars as dots on the histogram heatmap; clicking a dot opens the corresponding trace.
Exemplars (standardised in Prometheus 2.32, early 2022) solve the gap that defined the pre-exemplar era: “metrics say something is slow, but I have no example request to drill into.” They make it possible to keep user_id out of metric labels — cardinality stays bounded — while still being able to navigate from an aggregate spike to one concrete request via the trace.
- Prometheus bytes per active series (head block)
- ~3 KB
- Safe-zone series count on 16 GB box
- ~5 M
- Cardinality multiplier per high-card label
- 100x to 10 000x
- Typical scrape interval
- 15 s
- Series created by route × method × status_class (20×5×4)
- 400
- Additional series if user_id (100 k) is added
- 40 M
A team adds customer_email to their request_total counter. The Prometheus server runs out of memory within hours. Why?
What does an exemplar on a histogram metric do?
Which metric type should you use for 'checkout request duration, so you can query p99 across all replicas'?
- 01Explain in your own words why metrics are cheap to query but blind, while logs are powerful but expensive.
- 02A metric has labels: route (30 templates), method (5), status_class (4), region (3). Is this safe? What would make it unsafe?
- 03Why use an exemplar instead of just adding user_id as a metric label?
A Prometheus metric is identified by a (name, label_set) pair; each unique combination of label values creates one time series stored at roughly 3 KB in the head block. Pre-aggregation at the source is what makes queries fast across years, but it means metrics can only answer questions about dimensions you labelled in advance. Cardinality — the product of all label-value counts — is the dominant cost driver: a single unbounded label like customer_email on a busy metric can multiply series count from thousands to tens of millions, OOM-ing the server. The four metric types are counter (rate-of-change), gauge (instantaneous), histogram (percentile-queryable distribution), and summary (pre-computed, non-aggregatable). Exemplars bridge the aggregate metric to a concrete trace, eliminating the need to label with high-cardinality identifiers.
- Observability 2.0: wide events and the cost shiftsenior
- Failure modes and engineering practice: cardinality budgets, PII, and samplingsenior
- Three pillars: build a navigable observability surfacesenior
- Three pillars: multiple-choice reviewsenior
- Three pillars: code and config readingsenior
- Three pillars: free-recall reviewsenior
appears again in167
- 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
- Why profile first: measure where time actually goesjunior
- Amdahl''''s law and self-time: the ceiling on every speedup you can shipmiddle
- The measurement loop: microbench, macrobench, prod profile, observer effectmiddle
- Reading flame graphs: shapes, per-language profilers, and the 60-second scanmiddle
- Statistical baselines: why one run is not a measurementmiddle
- Profiler history and microbenchmark pitfalls: Knuth to GWPsenior
- Hardware counters, cold-start profiles, and profile securitysenior
- Continuous profiling at scale: costs, CI gates, trace correlation, and anti-patternssenior
- What makes a hot path: symptom vs causejunior
- Five shapes of hotspot: CPU, alloc, cache, lock, syscallmiddle
- Reading parent and child chains: where to apply the fixmiddle
- JIT deopt, the fix-and-verify loop, and PR-time profilingmiddle
- Hardware counters and Intel TMA: sub-category diagnosissenior
- False sharing and native-bridge hot pathssenior
- Hot paths in production: security, tail latency, and tooling lineagesenior
- Memory hierarchy: why the same O(N) loop can be 17x slowerjunior
- Row-major vs column-major: access order and the 9x gapjunior
- Branch prediction and branchless codemiddle
- Hardware prefetcher, TLB, and memory-level parallelismsenior
- GC basics: what the runtime taxes you forjunior
- GC algorithms: generational, concurrent, and per-runtimemiddle
- GC tradeoffs: pause, throughput, heap — and object poolingmiddle
- GC tuning: pacing, heap shape, and allocation observabilitymiddle
- GC internals: tri-color invariant, write barriers, and per-runtime deep-divessenior
- GC in production: observability, security, edge cases, and fleet governancesenior
- N+1: one logical operation, many round-tripsjunior
- Fix families: JOIN, IN, preload, and DataLoadermiddle
- Detecting N+1: query logs, APM traces, and CI gatesmiddle
- DataLoader: batching across resolver treesmiddle
- Cross-protocol N+1: HTTP fan-out and Redis MGETmiddle
- N+1 at scale: pool exhaustion, plan changes, and denormalisationsenior
- 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
- What a bundle actually costs: download, parse, compile, executejunior
- Core Web Vitals: LCP, INP, and CLSmiddle
- Code splitting: route-level, component-level, vendor splittingmiddle
- Tree shaking and compression: removing what you don''''t usemiddle
- Third-party scripts: the silent budget killermiddle
- 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