Tag
cache-behaviour
- May 23, 2025 B-Tree Node Occupancy, Splits, and the Minimum Degree Why a B-tree fixes node size rather than height, how a split propagates to the root, and what the minimum degree buys in depth versus split frequency. data structures
- Jan 6, 2025 Eytzinger Layout: Storing a Search Tree in Level Order How laying out a binary search tree in breadth-first order removes pointer chasing, enables branch-free traversal and prefetching, and what it costs on updates. algorithms