Dense vs sparse indexes in DBMS Theory - Performance Comparison

Time Complexity: Dense vs sparse indexes

O(log n)

Understanding Time Complexity

When using indexes in databases, it is important to understand how quickly they help find data as the database grows.

We want to know how the time to search changes with dense and sparse indexes.

Scenario Under Consideration

Analyze the time complexity of searching using dense and sparse indexes.

-- Dense index: one index entry per record
SELECT record FROM data_table WHERE key = search_key; -- using dense index

-- Sparse index: one index entry per block of records
SELECT record FROM data_table WHERE key = search_key; -- using sparse index

This code shows searching for a record using either a dense or sparse index in a database.

Identify Repeating Operations

Look at what repeats when searching with each index type.

• Primary operation: Searching through index entries to find the correct record or block.
• How many times: For dense index, one entry per record; for sparse index, one entry per block of records.

How Execution Grows With Input

As the number of records grows, the number of index entries grows differently for dense and sparse indexes.

Input Size (n)	Dense Index Entries	Sparse Index Entries
10	10	2 (assuming 5 records per block)
100	100	20
1000	1000	200

Pattern observation: Dense index entries grow directly with the number of records, while sparse index entries grow slower because they index blocks.

Final Time Complexity

Time Complexity: O(log n)

This means searching using either index grows slowly and efficiently as the database size increases.

Common Mistake

[X] Wrong: "Sparse indexes always make searching slower because they have fewer entries."

[OK] Correct: Sparse indexes reduce the number of index entries, but searching still uses efficient methods like binary search, so the time grows slowly.

Interview Connect

Understanding how dense and sparse indexes affect search time helps you explain database performance clearly and confidently in real-world discussions.

Self-Check

"What if the sparse index indexed every 10th record instead of every block? How would that change the time complexity?"

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