Build a Prometheus-style time-series database

About Build a Prometheus-style time-series database

The simplest database that can absorb a 1M-points-per-second firehose and still answer `sum(rate(http_requests_total{status="500"}[5m]))` in milliseconds — built bit by bit, literally.

Difficulty
beginner
Time
about 80 minutes
Stages
9
Topic
Observability: Metrics, Logs & Traces

How this problem is worked

Nine stages, from what the thing is for to how it compares with the real implementations. Each asks one question, and the simulator runs the architecture you draw against the requirements you wrote.

  1. 01Purpose & invariantsWhat is this for, and what must always be true of it?
  2. 02Workload characterizationWho writes, who reads, and in what shapes?
  3. 03Data model & on-disk formatWhat does the data look like at rest?
  4. 04Core algorithmsHow do the write path and the read path actually work?
  5. 05Distribution & replicationHow does this scale out and survive losing a machine?
  6. 06Consistency & correctnessUnder concurrency and failure, what is guaranteed?
  7. 07Failure modes & recoveryWhat actually happens when each part fails?
  8. 08Operational characteristicsCan a human run this at three in the morning?
  9. 09Trade-offs & comparisonWhere does this sit against the alternatives?

Primary sources for this problem

  • Pelkonen et al. — Gorilla: A Fast, Scalable, In-Memory Time Series Database (Facebook, VLDB 2015)
  • Fabian Reinartz — Writing a Time Series Database from Scratch (fabxc.org/tsdb, 2017)
  • Ganesh Vernekar — Prometheus TSDB (Part 1): The Head Block
  • Brian Brazil — Cardinality Is Key (robustperception.io)
  • Prometheus storage and naming docs (prometheus.io)
  • InfluxData — New Storage Engine: Time-Structured Merge Tree (TSM)

Browse the full problem catalog, or see what the simulator does and does not model.