in Databases retagged by
1,093 views
2 votes
2 votes

Which one of the following is a key factor for preferring $B$-trees to binary search trees for indexing database relations?

  1. Database relations have a large number of records
  2. Database relations are sorted on the primary key
  3. $B$-trees require less memory than binary search trees
  4. Data transfer from disks is in blocks
in Databases retagged by
by
1.1k views

1 Answer

1 vote
1 vote
Answer:

Related questions