Tag
page-layout
- 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 10, 2026 Page Compression: Prefix, Dictionary, and the Cost of Decoding How prefix truncation, shared dictionaries, and byte-level encoding shrink a page, why decompression sits on the critical path, and where compression defeats the buffer pool. databases
- Jul 18, 2025 Forecasting Table and Index Growth from Row Width and Page Fill Turning tuple width, page overhead, fill factor, and index amplification into a byte forecast, and the four effects that make a linear extrapolation wrong. 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
- Mar 29, 2025 Disk-Resident Graph Indexes and the Memory Bandwidth Wall What changes when the vector index no longer fits in RAM: page-oriented adjacency storage, the cost of a random read per hop, and why compression and caching decide throughput. information retrieval
- Sep 4, 2024 B-Tree Fanout Arithmetic and the Cost of a Point Lookup Why page-sized nodes give B-trees a fanout in the hundreds, how that collapses tree height to three or four levels, and where the arithmetic stops paying off. algorithms
- 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
- Dec 25, 2022 Slotted Pages: Fitting Variable-Length Records into Fixed-Size Blocks Why a page keeps its records at the end and its directory at the front, how item identifiers decouple record addresses from byte offsets, and where the free space goes. databases