1,696 views
2 votes
2 votes

Consider the following statement below:

$A)$ A clustered index may be either sparse or dense.

$B)$ Every $B^{+}$ tree index is dense.

Which of the above statement is true?


Is clustering Index can be dense. Dense means non-ordering field, but clustering field should be ordering field 

right??

1 Answer

0 votes
0 votes

A ) clustered index will be dense index if there is no duplicate values in data file

and A clustered index will be sparse if there is duplicate values in data file and duplicate value only have one entry in clustered index making it sparse index 

so A is True

B ) if data file is sorted, then leaf may constitute sparse index.

if data file is unsorted then leaf have to constitute dense index.

so B is False here

it is logical so i think no reference is required but otherwise u can see here https://cseweb.ucsd.edu/classes/fa19/cse132A-a/slides/indexing.pdf

 

 

Related questions

2 votes
2 votes
1 answer
2
2 votes
2 votes
2 answers
3
nish kim asked Jan 19, 2018
1,265 views
Database file consist 1250 records. Block can hold either 3 records or (10 keys, 11 pointers). The maximum number of levels of index required for sparse B+ tree index for...