B+ trees are preferred to binary trees in databases because

Home » Database » Database miscellaneous » Question

B⁺ trees are preferred to binary trees in databases because

1. disk capacities are greater than memory capacities
2. disk access is much slower than memory access
3. disk data transfer rates are much less than memory data transfer rates
4. disks are more reliable than memory

Correct Option: B

We know that indexing is better if the data block is large. Now, B⁺ trees are preferred over the binary search trees as in B⁺ trees, transfer of data is in form of data blocks. These data blocks can store large information while transferring, information on a single block is more efficient.