TLDR Tech / Data
PostgreSQL Blink-tree Implementation
PostgreSQL uses Blink-Tree, a high-concurrency version of B-tree indexes, which includes a "link" pointer between sibling nodes and a "high-key" boundary marker in each node. This design allows searches to quickly move to the right sibling without holding locks across multiple levels during reads. Structure changes, like page splits, utilize brief bottom-up lock-coupling on only a few nodes at a time, significantly reducing lock contention.
Read the full story