Modern B-Tree techniques
summary
Walks through concrete techniques: visualizes B‑trees with PG bench and Neato, explains link trees used in PostgreSQL and Peter Gigan’s work to postpone splits, shows prefix and dynamic prefix truncation, indirection vectors that store a first byte to save CPU and fit the vector in cache, partitioned index builds that cut index prep time reduced almost twice, DP3 designs for persistent memory, CAS-installed delta chaining for cheap updates, and learned‑index approximations that replace parts of the tree.
AI-written summary · about
chapters (5)
related talks
27mDropping Into B-Trees
40mnbtree Indexes in PostgreSQL: Useful New Features
53mAdvanced Indexing Techniques in PostgreSQL
48mTricks from in-memory databases
48mB-tree Indexes in Databases Illustrated by IndexedDB and PostgreSQL
45mA Deep Dive into PostgreSQL Indexing
45mThe Database: A Sophisticated and Special Data Structure
46mA Deep Dive Into PostgreSQL Indexing