retagged by
1,303 views
2 votes
2 votes

Suppose blocks hold either three records, or Ten (Key,pointer) pairs. As a function of n, the number of records, for dense index.How many levels of index as is appropriate until the final level of index has only one block?

a) n/3^n

b) log3n

c) n/4^n

d)log10n

retagged by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
1
srestha asked Sep 16, 2017
598 views
Block size 1000 BSearch key 12 BPointer size 8BWhat is max records of DB1) For Dense index B+ tree of 2 level2) For Sparse index B+ tree of 2 levelHow ans will differ , P...
0 votes
0 votes
1 answer
4
AnilGoudar asked Jun 10, 2017
516 views
Is it possible to have an Index file which is both dense index and sparse Index?