408 views
0 votes
0 votes
In dense index the index is created for every search key value, does it mean for every record there will be an entry in the dense index? if yes then clustering index need not be dense because clustering index will be created for the clustered attribute which need not be unique and thus for two same values of the clustered attribute in the file there will be only one entry in clustered index and hence for every record there is not an entry in clustering index, thus it is non-dense. What is it?

Please log in or register to answer this question.

Related questions

652
views
1 answers
0 votes
srestha asked Sep 16, 2017
652 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 , Plz show
794
views
2 answers
3 votes
iarnav asked Apr 21, 2018
794 views
Please give some example regarding number of edges in dense graph is - |E| < |V2|I get that when we take log both sides we get O(ElogV), but I can't get this |E| < |V2|
1.1k
views
1 answers
0 votes
Deepalitrapti asked Aug 14, 2018
1,123 views
1.4k
views
0 answers
2 votes
Kajal Khobragade asked Nov 23, 2017
1,381 views
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 ... of index has only one block?a) n/3^nb) log3nc) n/4^nd)log10n