One Row in a Billion: B-Trees and Database Indexes

Find one customer by email among a billion rows in a few disk reads, not minutes: why reading every row and a binary search tree are both too slow on disk, and the structure inside nearly every database index, the B-tree.

Updated

Cheat sheet: One Row in a Billion: B-Trees and Database Indexes
Category
Data Structures
Level
Freelancer
Tags
Balanced Tree, B-Tree, data structures, Index (database)