Six questions on page based B tree behaviour, left prefix rules, page splits, write costs, and why covering indexes can reduce base table reads.
0 / 6
Why are B tree indexes a natural fit for database storage engines?
Press 1 to 4 to pick an answer
Six questions on page based B tree behaviour, left prefix rules, page splits, write costs, and why covering indexes can reduce base table reads.
Why are B tree indexes a natural fit for database storage engines?