Dense vs sparse indexes in DBMS Theory - Quick Revision & Key Differences

Recall & Review

beginner

What is a dense index in database indexing?

A dense index has an index entry for every record in the data file. This means each search key value appears in the index along with a pointer to the actual record.

beginner

What is a sparse index in database indexing?

A sparse index has index entries only for some records, usually one per data block or page. It points to the first record in each block, not every record.

intermediate

How does a dense index affect search speed compared to a sparse index?

A dense index allows faster searches because it has an entry for every record, so the exact record can be found quickly. A sparse index may require scanning within a block after locating the pointer.

intermediate

What is a key advantage of using a sparse index?

A sparse index uses less storage space and requires less maintenance because it stores fewer index entries, making it more efficient for large datasets where full indexing is costly.

intermediate

In which scenario is a dense index preferred over a sparse index?

Dense indexes are preferred when fast, direct access to every record is needed, such as in primary key indexing or when records are frequently searched individually.

Which type of index contains an entry for every record in the data file?

A Dense index

B Sparse index

C Clustered index

D Hash index

A dense index has an index entry for every record, unlike a sparse index which has fewer entries.

What is a main benefit of a sparse index compared to a dense index?

A Faster search for every record

B Uses less storage space

C Has an entry for every record

D Requires more maintenance

Sparse indexes use less storage because they store fewer entries.

If you want quick access to every record, which index type should you choose?

A Sparse index

B No index

C Dense index

D Bitmap index

Dense indexes provide direct pointers to every record, enabling fast access.

Sparse indexes usually have entries pointing to:

A The first record in each block

B Every record

C Random records

D Only deleted records

Sparse indexes point to the first record in each data block or page.

Which index type requires scanning within a block after locating the pointer?

A B-tree index

B Dense index

C Hash index

D Sparse index

Sparse indexes may require scanning inside the block because they do not have entries for every record.

Explain the difference between dense and sparse indexes in simple terms.

Think about how many records each index points to.

When would you choose a sparse index over a dense index? Give reasons.

Consider trade-offs between speed and storage.

Practice

1. What is the main difference between a dense index and a sparse index in a database?

easy

A. Dense index stores data physically; sparse index stores data logically.

B. Sparse index has an entry for every record; dense index has entries for some records only.

C. Dense index has an entry for every record; sparse index has entries for some records only.

D. Sparse index is faster than dense index in all cases.

Solution

1. Step 1: Understand dense index definition

   A dense index contains an index entry for every record in the data file, making lookups very fast.

2. Step 2: Understand sparse index definition

   A sparse index contains entries only for some records, usually one per data block, saving space but requiring extra searching inside blocks.

3. Final Answer:

   Dense index has an entry for every record; sparse index has entries for some records only. -> Option C

4. Quick Check:

   Dense = every record, Sparse = some records [OK]

Hint: Dense = all entries, sparse = fewer entries [OK]

Common Mistakes:

• Confusing which index has entries for every record
• Thinking sparse index is always faster
• Assuming dense index saves more space

2. Which of the following is the correct syntax to describe a sparse index in a database textbook?

easy

A. "An index with entries for every record in the data file."

B. "An index that duplicates all data entries."

C. "An index that stores the entire data file."

D. "An index with entries only for some records, typically one per block."

Solution

1. Step 1: Recall sparse index definition

   Sparse index contains entries only for some records, usually one per block, to save space.

2. Step 2: Match options with definition

   "An index with entries only for some records, typically one per block." correctly describes sparse index as having entries only for some records.

3. Final Answer:

   "An index with entries only for some records, typically one per block." -> Option D

4. Quick Check:

   Sparse index = fewer entries per block [OK]

Hint: Sparse index = fewer entries, usually one per block [OK]

Common Mistakes:

• Choosing dense index description for sparse index
• Confusing sparse index with full data storage
• Selecting options that describe dense index

3. Consider a database with 1000 records stored in 100 blocks. If a sparse index has one entry per block, how many entries does the sparse index have?

medium

A. 100

B. 1000

C. 10

D. 1

Solution

1. Step 1: Understand sparse index entry count

   Sparse index has one entry per block, not per record.

2. Step 2: Calculate entries based on blocks

   Given 100 blocks, sparse index will have 100 entries.

3. Final Answer:

   100 -> Option A

4. Quick Check:

   Entries = blocks = 100 [OK]

Hint: Sparse index entries = number of blocks [OK]

Common Mistakes:

• Confusing entries with total records
• Assuming sparse index has one entry per record
• Choosing a number unrelated to blocks

4. A database administrator created an index with entries for every record but calls it a sparse index. What is the error in this scenario?

medium

A. The index is actually a dense index, not sparse.

B. Sparse index must have entries for every record.

C. Sparse index stores data physically, not index entries.

D. There is no error; this is a valid sparse index.

Solution

1. Step 1: Identify index type by entry count

   An index with entries for every record is a dense index by definition.

2. Step 2: Understand sparse index definition

   Sparse index has fewer entries, not one per record.

3. Final Answer:

   The index is actually a dense index, not sparse. -> Option A

4. Quick Check:

   Entries per record = dense, not sparse [OK]

Hint: Entries for every record means dense index [OK]

Common Mistakes:

• Thinking sparse index can have all entries
• Confusing physical data storage with index entries
• Believing no error exists in naming

5. You have a large database where fast search is critical, but storage space is limited. Which index type should you choose and why?

hard

A. Sparse index, because it uses less space and is always faster.

B. Dense index, because it provides faster search at the cost of more space.

C. Dense index, because it uses less space and slower search.

D. Sparse index, because it provides faster search and uses more space.

Solution

1. Step 1: Analyze speed vs space trade-off

   Dense index has an entry for every record, making search very fast but uses more space.

2. Step 2: Match requirement with index type

   Since fast search is critical, dense index is preferred despite higher space usage.

3. Final Answer:

   Dense index, because it provides faster search at the cost of more space. -> Option B

4. Quick Check:

   Fast search needs dense index [OK]

Hint: Fast search needs dense index, space saving needs sparse [OK]

Common Mistakes:

• Choosing sparse index for fastest search
• Confusing space usage of dense vs sparse
• Ignoring trade-offs between speed and storage