GATE 2000

Question 22

B⁺-trees are preferred to binary trees in databases because

A	Disk capacities are greater than memory capacities
B	Disk access is much slower than memory access
C	Disk data transfer rates are much less than memory data transfer rates
D	Disks are more reliable than memory

Question 22 Explanation:

In B⁺ trees it is easy to reduce the number of last level access from the disk when the disk size is too large.

Correct Answer: B

Question 22 Explanation:

In B⁺ trees it is easy to reduce the number of last level access from the disk when the disk size is too large.