nbtree Indexes in PostgreSQL: Useful New Features
summary
An overview of PostgreSQL b-tree (nbtree) indexes: how their internal structures and core operations work, common operational problems like index bloat, and significant behavioral changes introduced in PostgreSQL 12. The talk explains practical implications of those changes for maintaining and using the standard b-tree index type in production.
AI-written summary · about
chapters (8)
- 0:00Introduction
- 1:52Uber's problems and community
- 6:58B-tree index structure
- 16:56Current implementation flaws
- 21:34v12 index format
- 27:17Concurrent index rebuild
- 29:27v12 additional improvements
- 30:42Q&A
related talks
48mB-tree Indexes in Databases Illustrated by IndexedDB and PostgreSQL
53mAdvanced Indexing Techniques in PostgreSQL
49mFlexible Indexing with Postgres
47mThe Whole Truth About Indexes in PostgreSQL
27mDropping Into B-Trees
38mModern B-Tree techniques
52mA Deep Dive into PostgreSQL Indexing
45mA Deep Dive into PostgreSQL Indexing
