-
Which one of the following is a key factor for preferring B+ trees to binary search trees for indexing database relations?
-
- Database relations have a large number of records
- Database relations are sorted on the primary key
- B+ trees require less memory than binary search trees
- Data transfer from disks is in blocks
- Database relations have a large number of records
Correct Option: D
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 from disk to primary memory is in form of data blocks. These data blocks can store large information while transferring, information on a single block is more efficient.
