This research paper presents novel B-tree node layout designs that achieve high read and write performance while maintaining pageability for efficient disk storage. The authors demonstrate that carefully engineered contiguous memory layouts can match or exceed the performance of existing B-tree variants like Bw-tree and FP-tree.
Background
B-trees remain fundamental to database storage engines, but their classic design has limitations in modern systems with large main memory and SSDs. Recent years have seen alternative index structures like Bw-tree and FP-tree emerge, but this work revisits and improves the classic B-tree approach.
- Source
- Lobsters
- Published
- Oct 9, 2026 at 08:52 AM
- Score
- 7.0 / 10