Register

dense index

• retagged by
1,801 views
2 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

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · Segmentation really ...Next → · self dobt
← Previous in category · Database Normal FormNext in category → · self dobt
Position:
Show:

Related questions

0 0 votes
1 1 answer
1.1k
1.1k views
srestha asked Sep 16, 2017
1,114 views
Sparse and Dense index doubt
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 0 votes
1 1 answer
2.3k
2.3k views
set2018 asked Nov 10, 2017
2,296 views
sparse/dense indexing
which statement is true?1)for any data file it is possible to construct two separate sparse first level index on different keys.2)for any data file it is possible to cons...
24 24 votes
1 answers 1 answer
9.1k
9.1k views
reena_kandari asked Oct 26, 2017
9,074 views
B+tree with sparse/Dense indexing
Database file consists of $10,000$ records with record size of $100$ bytes, block size $512$ bytes. If sparse B+ tree index is built over given database file with search ...
0 0 votes
1 1 answer
948
948 views
AnilGoudar asked Jun 10, 2017
948 views
Self Doubt in Sparse Indexing and Dense Indexing
Is it possible to have an Index file which is both dense index and sparse Index?