databases

This is the talk every backend engineer eventually watches. Jeff Dean walks Stanford’s distinguished lecture audience through eleven years of evolution in Google’s search infrastructure — from a single-machine inverted index in 1999 to a planet-scale system serving thousands of queries per second with sub-second updates. The value of the lecture isn’t the specific numbers; it’s how he reasons about each rewrite as a response to one constraint becoming unbearable, and the design patterns that survived across seven major rewrites....

Weekly Paper Notes — one of the top picks from the 2026-06-20 CS paper digest. Area: Databases / Systems. Authors: Georg Kreuzmayr (TigerBeetle), Muhammad El-Hindi (TUM), Benjamin Wagner (Firebolt), Tobias Ziegler (TigerBeetle), Viktor Leis (TUM) arXiv: 2606.19969 · PDF TL;DR For two decades distributed database systems treated the network as an opaque, kernel-managed pipe and the kernel TCP stack was fast enough that this abstraction was free. It isn’t anymore....

Weekly Paper Notes — Seminal Paper of the Week for the 2026-06-06 CS paper digest. Area: Distributed Systems / Databases. Citation: Giuseppe DeCandia, Deniz Hastorun, Madan Jampani, Gunavardhan Kakulapati, Avinash Lakshman, Alex Pilchin, Swaminathan Sivasubramanian, Peter Vosshall, Werner Vogels — Dynamo: Amazon’s Highly Available Key-value Store. SOSP ‘07. DOI: 10.1145/1294261.1294281 Canonical PDF: Amazon Dynamo paper (Werner Vogels’ archive) Why the paper still matters Almost every popular “NoSQL” key-value store of the last fifteen years — Cassandra, Riak, Voldemort, DynamoDB (the service), early versions of Redis Cluster, parts of MongoDB’s replica routing — pulls its core design vocabulary directly from Dynamo: consistent hashing for partitioning, vector clocks for divergence tracking, sloppy quorums with hinted handoff for availability under failure, and read repair / Merkle-tree anti-entropy for eventual convergence....

Eleven years after delivery, “I See What You Mean” remains the single best talk on why distributed systems are hard as a language design problem, not as an engineering problem. Peter Alvaro — now a professor at UC Santa Cruz, then a Berkeley PhD finishing the BOOM project — walks through a decade of research on Dedalus and Bloom and ends with the CALM theorem: a precise, syntactic answer to the question “when does a distributed program need coordination, and when can we get away without it?...

🔁 Seminal Paper of the Week — a foundational classic chosen to anchor the May 17–23, 2026 weekly digest. Area rotated to Databases this week. Authors: C. Mohan, Don Haerder, Bruce Lindsay, Hamid Pirahesh, Peter Schwarz (IBM Almaden, 1992) Venue: ACM Transactions on Database Systems, Vol. 17, No. 1 DOI: 10.1145/128765.128770 TL;DR ARIES is the recovery algorithm. It combines write-ahead logging (WAL), steal + no-force buffer management, physiological logging, and a three-pass restart (Analysis → Redo → Undo) with compensation log records (CLRs) that make undo idempotent....

Weekly Paper Notes — one of the top picks from the May 17–23, 2026 CS paper digest. Area: Databases. Author: Philip A. Bernstein (Microsoft Research) arXiv: 2605.20466 · PDF Origin: Extended version of the SIGMOD 2025 short paper of the same name. TL;DR This is not a survey paper. It is a personal retrospective by one of the people who has been doing transaction-processing research continuously for fifty years — author of Concurrency Control and Recovery in Distributed Database Systems (1987), co-author of the original Hyder design, and contributor to TAPIR/Chablis/Orleans transactions....