Which one of the following is a key factor for preferring B-trees to binary search trees for indexing database relations?
(A) Database relations have a large number of records
(B) Database relations are sorted on the primary key
(C) B-trees require less memory than binary search trees
(D) Data transfer form disks is in blocks.
Answer: (D)
Explanation: A disk block contains fairly large number of keys. Unlike BST where each node contains only one key, B-Tree is designed to contain large number of keys so that tree height is small.
Quiz of this Question
Data Structures | B and B+ Trees | Question 2
Recommended Articles