a) Dense
b) Sparse
c) Straight
d) Continuous
Answer: a
Explanation: In a dense nonclustering index, the index must store a list of pointers to all records with the same search-key value.
Related Posts
While inserting the record into the index, if the search-key value does not appear in the index.
Insertion of a large number of entries at a time into an index is referred to as __________ of the index
In B+ tree the node which points to another node is called
A search key containing more than one attribute is referred to as a _________ search key.
Incase the indices values are larger, index is created for these values of the index. This is called
In a __________ index, an index entry appears for only some of the search-key values.
An ____________ consists of a search-key value and pointers to one or more records with that value as their search-key value.
Join The Discussion