Why indexing speeds up data retrieval in DBMS Theory - Challenge Your Understanding

Challenge - 5 Problems

🧠 Conceptual

intermediate

How does an index improve search speed in a database?

Imagine you have a large book and want to find a specific topic quickly. How does using an index in a database help speed up finding data compared to searching every page?

A It copies all data to a new table for faster access.

B It creates a shortcut that points directly to the data location, avoiding scanning all records.

C It compresses the data to make it smaller and faster to read.

D It deletes unnecessary data to reduce the search area.

💡 Hint

Think about how a book's index helps you find pages without reading every page.

An index works like a map or shortcut that tells the database exactly where to find the data. This avoids looking through every record, making searches much faster.

📋 Factual

intermediate

What data structure is commonly used to implement database indexes?

Which data structure is most often used inside databases to organize indexes for fast data retrieval?

A Linked List

B Hash Table

C B-Tree

D Stack

💡 Hint

It is a balanced tree structure optimized for disk storage and quick search.

B-Trees keep data sorted and balanced, allowing quick searches, insertions, and deletions, which is why they are widely used for database indexes.

🔍 Analysis

advanced

Why might adding too many indexes slow down database performance?

While indexes speed up data retrieval, why can having too many indexes cause the database to slow down?

A Because indexes prevent the database from caching data in memory.

B Because each index requires extra storage space, which slows down the disk.

C Because indexes cause the database to scan all data multiple times.

D Because indexes must be updated during data changes, increasing write operation time.

💡 Hint

Think about what happens when you add or change data in a table with many indexes.

Every time data is inserted, updated, or deleted, all related indexes must also be updated. Having many indexes means more work during writes, which slows down these operations.

❓ Comparison

advanced

Compare clustered and non-clustered indexes in databases

What is the main difference between clustered and non-clustered indexes in how they organize data?

A Clustered indexes sort the actual data rows, while non-clustered indexes store pointers to data rows.

B Non-clustered indexes sort the actual data rows, while clustered indexes store pointers to data rows.

C Both clustered and non-clustered indexes store data in separate tables without sorting.

D Clustered indexes are only used for text data, non-clustered for numbers.

💡 Hint

One type changes the order of data storage, the other keeps data separate.

A clustered index determines the physical order of data in the table, sorting the rows. A non-clustered index keeps a separate structure with pointers to the data rows.

❓ Reasoning

expert

Why does an index reduce the number of disk reads during a query?

Explain why using an index reduces the number of disk reads needed to find data compared to scanning the whole table.

A Because the index organizes data in a way that allows the database to jump directly to the needed data blocks without reading all blocks.

B Because the index stores a full copy of the table in memory, eliminating disk reads.

C Because the index deletes irrelevant data from the disk, reducing the size of the table.

D Because the index compresses the data, so fewer disk blocks are needed to store it.

💡 Hint

Think about how a map helps you find a location without checking every street.

An index is structured to allow the database to quickly locate the exact disk blocks containing the data, avoiding reading the entire table and thus reducing disk I/O.

Practice

1. Why does indexing speed up data retrieval in a database?

easy

A. Because it creates a quick lookup structure like a book's index

B. Because it stores data in random order

C. Because it deletes unnecessary data automatically

D. Because it compresses all data to save space

Solution

1. Step 1: Understand what indexing does

   Indexing creates a special data structure that helps find data quickly without scanning the whole table.

2. Step 2: Compare to a book's index

   Just like a book's index lets you find a topic page fast, database indexes let the system find rows quickly.

3. Final Answer:

   Because it creates a quick lookup structure like a book's index -> Option A

4. Quick Check:

   Index = Quick lookup [OK]

Hint: Think of index as a book's index for fast search [OK]

Common Mistakes:

• Confusing indexing with data compression
• Thinking indexing deletes data
• Assuming indexing randomizes data order

2. Which of the following is the correct way to create an index on the column employee_id in SQL?

easy

A. CREATE employees INDEX idx_emp(employee_id);

B. MAKE INDEX idx_emp FROM employees(employee_id);

C. CREATE INDEX idx_emp ON employees(employee_id);

D. INDEX CREATE idx_emp ON employees(employee_id);

Solution

1. Step 1: Recall SQL syntax for creating an index

   The correct syntax starts with CREATE INDEX, followed by the index name, then ON and the table and column.

2. Step 2: Match syntax with options

   CREATE INDEX idx_emp ON employees(employee_id); matches the correct SQL syntax exactly.

3. Final Answer:

   CREATE INDEX idx_emp ON employees(employee_id); -> Option C

4. Quick Check:

   CREATE INDEX ... ON ... [OK]

Hint: Remember SQL starts with CREATE INDEX for indexes [OK]

Common Mistakes:

• Using wrong keyword order
• Confusing CREATE INDEX with other commands
• Missing ON keyword

3. Consider a table with 1 million rows and an index on the username column. What will likely happen when you run SELECT * FROM users WHERE username = 'alice';?

medium

A. The database uses the index to quickly find 'alice' without scanning all rows

B. The database scans all 1 million rows to find 'alice'

C. The query will fail because indexes cannot be used in SELECT

D. The database deletes all rows except 'alice'

Solution

1. Step 1: Understand the role of index in query

   The index on username helps the database find the row with 'alice' quickly without scanning the entire table.

2. Step 2: Analyze the query execution

   The database uses the index to jump directly to the matching row, improving speed.

3. Final Answer:

   The database uses the index to quickly find 'alice' without scanning all rows -> Option A

4. Quick Check:

   Index speeds up SELECT search [OK]

Hint: Index avoids full table scan for WHERE queries [OK]

Common Mistakes:

• Thinking index slows down SELECT
• Believing index is ignored in queries
• Assuming query deletes data

4. A developer notices that after adding an index, insert operations became slower. What is the most likely reason?

medium

A. The database deletes old data when indexing

B. Indexes require extra work to update during inserts

C. Indexes prevent any data from being inserted

D. The index compresses data causing delays

Solution

1. Step 1: Understand index maintenance during inserts

   When new rows are inserted, the index must also be updated to include the new data, adding extra work.

2. Step 2: Explain why this slows inserts

   This extra step means inserts take longer compared to no index.

3. Final Answer:

   Indexes require extra work to update during inserts -> Option B

4. Quick Check:

   Index update slows inserts [OK]

Hint: Index updates add overhead on inserts [OK]

Common Mistakes:

• Thinking indexes block inserts
• Believing indexes delete data
• Assuming indexes compress data during insert

5. You have a large table with millions of rows and frequent queries filtering by email. You create an index on email. However, queries are still slow. What could be a reason?

hard

A. The table is too big for any index to help

B. Indexes always make queries slow

C. The database ignores indexes on text columns

D. The index is not used because the query filters with a function like LOWER(email)

Solution

1. Step 1: Understand how functions affect index usage

   If a query applies a function like LOWER() on the indexed column, the index may not be used because the function changes the data.

2. Step 2: Explain why this causes slow queries

   Without using the index, the database must scan many rows, causing slow performance.

3. Final Answer:

   The index is not used because the query filters with a function like LOWER(email) -> Option D

4. Quick Check:

   Functions on indexed columns block index use [OK]

Hint: Functions on indexed columns disable index use [OK]

Common Mistakes:

• Assuming indexes always speed queries
• Believing table size alone blocks indexes
• Thinking text columns cannot be indexed