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 from disks is in blocks
Answer: (D)
Explanation: Database queries can be executed faster when disk reads and writes whole blocks of data at once.But, nodes of binary search tree store a single key. So, in case of binary search tree, data transfer can not be done in blocks.
B+ tree is a balanced tree and multiple keys are stored in each node of a B+ tree.
Thus, disk can transfer data in blocks when B+ tree is used for indexing database relations.
Hence, option (D) is correct.
Please comment below if you find anything wrong in the above post.
Quiz of this Question