GATE Exam | Aptitude Questions | GATE Syllabus | GATE Result | Mock Test | GATE Preparation
0 votes

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 form disks is in blocks.

asked in File organization, indexing (B and B+ trees) by gate

1 Answer

0 votes
D

Data transfer form disks is in blocks.
answered by gate

Related questions

The best answer to any question