Q36

MCQ2 marks, −0.67

An index in a DBMS is said to be dense if an index entry appears for every search-key value in the indexed file. Otherwise it is called a sparse index. Consider the following two statements. $\text{S1}$ : A hash index must be a dense index $\text{S2}$ : A $B^{+}$ tree index can be a sparse index Which one of the following options is correct?

(A)

Both $\text{S1}$ and $\text{S2}$ are true

(B)

Both $\text{S1}$ and $\text{S2}$ are false

(C)

$\text{S1}$ is true and $\text{S2}$ is false

(D)

$\text{S1}$ is false and $\text{S2}$ is true

Loading…