Database Indexing with B-Trees

Hard

computer-science Amazon Databricks

Why do relational databases typically use B-trees (or B+ trees) for indexing rather than binary search trees?

Multiple Choice

B-trees are simpler to implement than binary trees B-trees have a high branching factor that keeps the tree shallow, minimizing the number of slow disk I/O operations needed for lookups Binary search trees cannot store strings, only integers B-trees guarantee O(1) lookup time, while BSTs are O(log n)

Correct!

Incorrect — try again next time!

Upgrade to Pro to unlock solutions and explanations

Database Indexing with B-Trees

Multiple Choice

Related problems

Deep-dive guides