Intermediate
Database Management Systems
Q46 / 100
What is a B-tree index?
Correct! Well done.
Incorrect.
The correct answer is B) A self-balancing tree data structure used for indexing, providing O(log n) search, insert, and delete for range queries and equality lookups
B
Correct Answer
A self-balancing tree data structure used for indexing, providing O(log n) search, insert, and delete for range queries and equality lookups
Explanation
B-tree (balanced tree) indexes support equality (=), range (<, >, BETWEEN), ORDER BY, and GROUP BY operations efficiently. The tree height is O(log n), so queries touch few disk pages.
Progress
46/100