Q28

MCQ1 mark, −0.25

Which 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

Loading…