Tag
b-tree
- Oct 18, 2026 Page Splits and the Write Cost of a Single B-Tree Insert What an insert actually writes when a leaf page has no room, why the split propagates to the root, and how fill factor and right-links change the count. databases
- Jun 25, 2026 Fanout, Height, and Why B-Trees Stay Shallow How page size, key width, and pointer width determine the branching factor of a B-tree, and why three or four levels cover billions of keys. databases
- May 27, 2026 Key Ordering and Cursor Semantics in IndexedDB How IndexedDB compares keys of different types, why compound keys sort lexicographically, and how cursor direction and ranges decide which records a traversal visits. web platform
- Jan 3, 2026 Concurrent Descent and Page Latching in a Shared B-Tree How readers descend without blocking writers, why a split needs the parent as well as the child, and how the Lehman-Yao protocol avoids deadlock. databases
- Jun 2, 2025 Latch Coupling and Deadlock Avoidance in the Buffer Pool Why latches are not locks, how lock coupling keeps a B-tree descent deadlock-free, what a partitioned buffer pool hash table buys, and where contention concentrates. databases
- Apr 5, 2025 Prefix Compression and Suffix Truncation in Index Pages How shared key prefixes are stored once per page, why the first key of a page is stored whole, and what restart points cost a search inside a compressed page. databases
- Sep 6, 2024 Node Splits, Merges, and What the Fill Factor Buys How a B-tree page divides when it overflows, why merges are rarely performed, and what setting a fill factor at build time actually changes. databases
- Nov 24, 2023 Separator Keys and Search Routing in Internal Nodes How internal B-tree pages choose the keys that route a search, what happens when a separator is too short to be unique, and how duplicate keys are ordered. databases