GATEverse Practice, past papers & mock tests
GATE 2026 · CS2 - Afternoon
Database ManagementIndexinghardMCQ2 marks
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. S1: A hash index must be a dense index S2: A B+ tree index can be a sparse index Which one of the following options is correct?
Save your progress

Related Database Management PYQs