System Design Fundamentals • Week 301 / 13Interactive: how a B-tree index finds rowsAn index is a sorted map from column → rows; queries without one scan everything.StackShade deckPredict → explain → retrieve