retagged by
1,113 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
retagged by

1 Answer

Answer:

Related questions

0 votes
0 votes
0 answers
3
admin asked Mar 30, 2020
1,191 views
Which of the following statements is/are TRUE for an undirected graph?Number of odd degree vertices is evenSum of degrees of all vertices is evenP onlyQ onlyBoth P and QN...