B-Tree Index

A balanced, block-oriented search tree that keeps keys sorted for logarithmic point and range lookups, the classic read-optimized index structure in relational storage engines.

grounded in: HN trend theme 'Databases and data-plane performance' plus 'Learn-by-rebuilding-from-scratch' (rebuild a DB from scratch); complements existing lsm-tree/storage-engine cluster