What is the advantage of using B+trees over B-trees for indexing?
2024
What is the advantage of using B+trees over B-trees for indexing?
Answer: B. B+trees allow efficient range queries by including all key values in each leaf node. — B+ trees offer better range query performance because all keys are stored in leaf nodes that are linked together. This structure allows for sequential access…
- A.
B+trees offer faster search performance due to more keys per node.
- B.
B+trees allow efficient range queries by including all key values in each leaf node.
- C.
B+trees require less storage space for the same number of keys.
- D.
B+trees are simpler to implement and maintain.
Attempted by 297 students.
Show answer & explanation
Correct answer: B
B+ trees offer better range query performance because all keys are stored in leaf nodes that are linked together. This structure allows for sequential access of data without traversing internal tree levels.