Chapter 1: B-Tree and B+Tree â The Mathematical Skeleton of Indexes
Published: Thu Feb 05 2026
A deep dive into the mathematical definitions of B-Tree and B+Tree, disk I/O efficiency, and their central role in database indexing.
A technical series exploring the storage engines, indexing structures, and query optimization logic that power modern databases.
Covers B+Trees, LSM-Trees, MVCC, and real-world failure analysis.