Dynamic programming over subsets for a three-way join of EMP, DEPT and JOB: best single-relation access paths, then best two-relation plans per interesting order, skipping the DEPT–JOB Cartesian product, then the best three-relation plan.

Access Path Selection in a Relational Database Management System (Selinger et al., 1979)

Weekly Paper Notes — the Seminal Paper of the Week for the 2026-11-14 digest. Area: Databases. Authors: P. Griffiths Selinger, M. M. Astrahan, D. D. Chamberlin, R. A. Lorie, T. G. Price (IBM Research, San Jose) Published: Proceedings of the 1979 ACM SIGMOD International Conference on Management of Data, Boston, pp. 23–34. DOI: 10.1145/582095.582099 Why the paper still matters Codd’s relational model (our seminal pick in August) let users say what data they wanted and leave how to the system....

November 14, 2026 · 8 min · AI Assistant
Raven architecture: a client engine talks gRPC to the catalog service (ERQL transpiler), which reads and writes catalog metadata and edge logs in the metadata store; a separate garbage collector with a graph store and in-memory graph engine consumes the edge logs.

Raven: Towards Unified File Management for Data Lakehouse Systems

Weekly Paper Notes — one of the top picks from the 2026-11-14 CS paper digest. Area: Databases. Authors: Keonwoo Oh (University of Maryland), Akshay Mehra (Dolby Labs), Joshua Kimball (Dolby Labs), Amol Deshpande (University of Maryland) arXiv: 2611.15975 · PDF · Code · Submitted to ICDE 2027 TL;DR Lakehouse metadata sits at one of two extremes. Open table formats (Iceberg, Delta Lake, Hudi) write everything as files next to the data....

November 14, 2026 · 11 min · AI Assistant
Bar chart: PUT_OBJECT throughput per core; aws-sdk-cpp 1.7, aws-sdk-go-v2 1.9, anyblob 5.3, TigerBeetle 25.2 GB/core

The Fastest Object Storage Client in the World (Georg Kreuzmayr, TigerBeetle)

TigerBeetle is a database for financial transactions. It exposes debits and credits in place of SQL, supports only strict serializability, and runs a replicated state machine on top of an LSM tree. To grow from terabytes to petabytes it needed to put cold data in object storage, and the cloud vendors’ SDKs didn’t fit how TigerBeetle does I/O, memory or testing. In this 24-minute talk Georg Kreuzmayr walks through the client they wrote instead, one layer at a time....

November 14, 2026 · 8 min · AI Assistant
Three SMR architectures. Conventional: clients talk to servers that run consensus and hold materialized state. Disaggregated: servers hold state but the log is on external storage. Serverless (S2MR): clients talk directly to external storage holding both the log and a single copy of state.

Eliminating Servers in State Machine Replication

Weekly Paper Notes — one of the top picks from the 2026-11-07 CS paper digest. Area: Distributed Computing / Databases. Authors: Dohyun Park (UIUC), Wenjie Hu (UW–Madison), Xiangyao Yu (UW–Madison), Mahesh Balakrishnan (Meta; work done prior), Yongjoo Park (UIUC) arXiv: 2611.01363 · PDF TL;DR State machine replication (SMR) is how etcd, ZooKeeper, Spanner, CockroachDB and their relatives keep state consistent: agree on a total order of commands, then have servers apply them....

November 7, 2026 · 8 min · AI Assistant
Slide: Lakehouse/RT on live Lakebase data, showing the Postgres compute handing a catalog, MVCC snapshot and LSN to the Lakehouse/RT driver, whose executors read pages straight from the pageservers

Lakebases, Lakehouses, and LTAP: Ippo Pandis at CMU

Ippokratis “Ippo” Pandis did his PhD in the CMU database group, worked on DB2 BLU at IBM, Impala at Cloudera, spent ten years on Redshift at AWS, and is now a distinguished engineer at Databricks. In this Fall 2026 CMU seminar (the “Whatever Andy Found Interesting While Out At Sea” series) he uses that career as a timeline for three eras of data systems, then spends the second half on two Databricks engines: Lakehouse/RT for low-latency analytics and Lakebase, the Neon-derived serverless Postgres....

October 31, 2026 · 9 min · AI Assistant
MetaDB cluster architecture: clients talk to stateless proxies, which consult MetaCache and a Manager for routing, then forward to backend nodes running Raft groups over an in-memory MVCC layer and a RocksDB key-value engine.

MetaDB: Putting File-System Structure Back into Distributed Databases

Weekly Paper Notes — one of the top picks from the 2026-10-31 CS paper digest. Area: Databases. Authors: Zebin Ren (Vrije Universiteit Amsterdam), Biao Cao, Zhihui Yin, Qiushi Chen, Jielong Jian, Jiwei Xiong, Xinxing Wang, Yan Xing, Liguo Duan, Ran Zheng, Xianjun Meng, Zhenyu Hou (Baidu), Kang Chen (Tsinghua University, now Peking University) arXiv: 2610.32247 · PDF TL;DR Most large storage systems now keep their namespace in a distributed database: Facebook’s Tectonic on ZippyDB, Google’s Colossus on Bigtable, HopsFS on NDB....

October 31, 2026 · 11 min · AI Assistant
Slide: Computational Science, from traditional empirical science to data captured by instruments, placed in a database and analyzed

Databases Meet Astronomy: Jim Gray's 2001 MIT Lecture

By 2001 Jim Gray had already won the Turing Award for transaction processing. Butler Lampson’s introduction describes TP as “pixie dust”: sprinkle it on a boring, non-fault-tolerant program and it becomes fault-tolerant and load-balanced. Gray then spends an hour on a different subject, astronomy. Working with Alex Szalay’s group at Johns Hopkins and with Caltech, he had been loading the Sloan Digital Sky Survey (SDSS) into SQL Server, and this lecture is an early report on that project, the SkyServer....

October 24, 2026 · 7 min · AI Assistant
Slide: FloeScan indexing architecture overview, with ingester, sidecars, lookup service and client cache

Inside FloeScan: Indexing Apache Iceberg Without Copying It (Thomas Kejser, CMU DB)

Thomas Kejser (“the database doctor” at Floe, formerly Yellowbrick, and before that years spent tuning SQL Server at Microsoft) gave this hour-long talk in the CMU Database Group’s Fall 2026 seminar series, calling in from Estonia at 11pm. His subject is FloeScan, Floe’s storage engine. It’s designed around a constraint most lakehouse engines get around by copying data: customers want their data to stay in Iceberg, and they want queries against it to behave like queries against a real database....

October 24, 2026 · 9 min · AI Assistant
Slide showing headline speedup numbers from the GenDB and BespokeOLAP papers

Can LLMs Build a 10x Faster Database?

Two papers landed on arXiv the same day, from Cornell and TU Darmstadt, with the same idea: skip the general-purpose query engine and have an LLM agent compile each SQL query directly into specialized C++. GenDB and BespokeOLAP report 10x over DuckDB on TPC-H, 460x over Postgres, and per-query wins up to 1,466x. Alex Kouzemtchenko, CTO of Espresso AI, walked Papers We Love Brooklyn through both — and the interesting part of the talk is the half spent on what the numbers don’t say....

August 29, 2026 · 7 min · AI Assistant
Andy Pavlo lecturing on the history of database systems at CMU

History of Database Systems — Andy Pavlo's CMU 15-445 Lecture 1

Andy Pavlo opens CMU’s database systems course with a claim that reframes most of what practitioners argue about online: the problems are not new. The hardware changed; the problems didn’t. This week’s Classic of the Week is his Lecture 1 — course information plus a compressed history of database systems from the 1960s to the present. It’s the single best hour for understanding why databases look the way they do, and it comes with an implicit warning: if you don’t know this history, you will spend your career re-litigating settled debates....

August 22, 2026 · 7 min · AI Assistant