Database Indexing · Database Indexing: How a B-Tree Index Speeds Up Lookups
Question 1 of 5
A full scan of a 100,000-row table is slow even though in-memory comparisons are cheap. Which cost does an index mainly cut?
Tip: press 1-4 to answer, Enter to continue. Finish the quiz to bank your XP.