Crowdly
Add to Chrome
A table has 1,000,000 rows. A B-Tree index with height 3 is created on the pri...
✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
A table has 1,000,000 rows. A B-Tree index with height 3 is created on the primary key column. How many node lookups are required on average to find a row?
0%
0%
0%
100%