Why query optimization reduces execution time in DBMS Theory - Challenge Your Understanding

Challenge - 5 Problems

🧠 Conceptual

intermediate

How does query optimization improve performance?

Which of the following best explains why query optimization reduces execution time in a database?

A It increases the number of rows scanned to ensure accuracy.

B It rearranges the query to use indexes and efficient join methods, reducing the amount of data processed.

C It duplicates data to speed up retrieval.

D It disables caching to force fresh data reads.

💡 Hint

Think about how databases avoid unnecessary work.

Query optimization finds the best way to run a query by using indexes and efficient joins, which reduces the data scanned and speeds up execution.

📋 Factual

intermediate

What is a common technique used in query optimization?

Which technique is commonly used by query optimizers to reduce execution time?

A Using indexes to quickly locate rows

B Full table scan of all tables involved

C Ignoring WHERE clauses to speed up processing

D Duplicating tables to avoid joins

💡 Hint

Think about how databases find data quickly.

Indexes allow the database to find rows quickly without scanning entire tables, which reduces execution time.

🔍 Analysis

advanced

Analyzing the effect of join order on execution time

Consider a query joining three tables: A, B, and C. How does changing the join order affect execution time?

A Join order has no effect on execution time.

B Join order only affects the output, not performance.

C Changing join order always increases execution time.

D Changing join order can reduce intermediate result size, speeding up the query.

💡 Hint

Think about how intermediate results affect processing.

Choosing the right join order can minimize the size of intermediate results, reducing the amount of data processed and speeding up execution.

❓ Comparison

advanced

Comparing execution plans with and without optimization

Which statement correctly compares execution plans of a query with and without optimization?

A Optimized plans use indexes and fewer scans; unoptimized plans often use full scans.

B Both plans always use the same indexes and scans.

C Optimized plans ignore indexes to speed up execution.

D Unoptimized plans use indexes more efficiently than optimized plans.

💡 Hint

Consider how optimization changes data access methods.

Optimized plans typically use indexes and avoid full table scans, reducing data processed and execution time.

❓ Reasoning

expert

Why does reducing disk I/O lower query execution time?

Why does query optimization focus on reducing disk input/output (I/O) operations to lower execution time?

A Reducing disk I/O increases network traffic, which speeds up queries.

B Disk I/O is faster than CPU processing, so more I/O improves speed.

C Disk I/O is slower than memory operations, so reducing it speeds up queries.

D Disk I/O has no impact on query execution time.

💡 Hint

Think about the speed difference between disk and memory.

Disk operations are slower than memory operations. Optimizers reduce disk I/O to avoid waiting for slow data reads, thus lowering execution time.

Practice

1. Why does query optimization reduce execution time in a database?

easy

A. It finds the fastest way to access and process data

B. It increases the size of the database

C. It deletes unnecessary data automatically

D. It slows down the query to save resources

Solution

1. Step 1: Understand the role of query optimization

   Query optimization helps the database find the best method to retrieve data efficiently.

2. Step 2: Connect optimization to execution time

   By choosing the fastest access path, the query runs quicker, reducing execution time.

3. Final Answer:

   It finds the fastest way to access and process data -> Option A

4. Quick Check:

   Optimization = Faster queries [OK]

Hint: Optimization means finding the fastest data access path [OK]

Common Mistakes:

• Thinking optimization deletes data
• Believing optimization increases database size
• Assuming optimization slows queries

2. Which of the following is a correct reason why query optimization reduces execution time?

easy

A. It uses indexes to quickly locate data

B. It duplicates data to speed up queries

C. It ignores query conditions to save time

D. It compresses the database files automatically

Solution

1. Step 1: Identify the role of indexes in optimization

   Indexes help the database find data faster without scanning the whole table.

2. Step 2: Understand why other options are incorrect

   Duplicating data or ignoring conditions would cause errors or inefficiency, not speed.

3. Final Answer:

   It uses indexes to quickly locate data -> Option A

4. Quick Check:

   Indexes speed up data search [OK]

Hint: Indexes help queries run faster by quick data lookup [OK]

Common Mistakes:

• Thinking data duplication speeds queries
• Believing ignoring conditions helps
• Confusing compression with optimization

3. Consider a query that retrieves customer names from a large table without an index on the name column. After adding an index on the name column, what is the expected effect on execution time?

medium

A. Execution time will increase because indexes slow down queries

B. Execution time will decrease because the index speeds up data retrieval

C. Execution time will stay the same because indexes have no effect

D. Execution time will be unpredictable and random

Solution

1. Step 1: Understand the effect of adding an index

   An index on the name column allows the database to find names faster without scanning all rows.

2. Step 2: Predict the impact on execution time

   Because the database uses the index, the query runs faster, reducing execution time.

3. Final Answer:

   Execution time will decrease because the index speeds up data retrieval -> Option B

4. Quick Check:

   Index added = faster query [OK]

Hint: Adding index usually reduces query time [OK]

Common Mistakes:

• Thinking indexes slow down queries
• Believing indexes have no effect
• Assuming execution time is random

4. A query is running slowly because it scans the entire table. Which change will most likely fix this problem?

medium

A. Increase the size of the database

B. Remove all indexes from the table

C. Add an index on the column used in the WHERE clause

D. Rewrite the query without any conditions

Solution

1. Step 1: Identify the cause of slow query

   Full table scan happens when no index exists on columns used in filtering conditions.

2. Step 2: Apply the fix by adding an index

   Adding an index on the WHERE clause column helps the database find matching rows faster, avoiding full scans.

3. Final Answer:

   Add an index on the column used in the WHERE clause -> Option C

4. Quick Check:

   Index on filter column = faster query [OK]

Hint: Index columns used in WHERE to speed queries [OK]

Common Mistakes:

• Removing indexes thinking it helps
• Increasing database size to fix speed
• Removing query conditions to speed up

5. A database query joins two large tables without indexes on the join columns. How does query optimization reduce execution time in this case?

hard

A. By deleting duplicate rows before joining

B. By automatically creating indexes on all columns

C. By running the join on a smaller sample of data only

D. By choosing a join method that minimizes data scanning, like a hash join

Solution

1. Step 1: Understand join optimization without indexes

   Without indexes, the optimizer selects the best join algorithm to reduce scanning, such as a hash join.

2. Step 2: Explain why other options are incorrect

   The optimizer does not create indexes automatically, delete data, or sample data unless explicitly told.

3. Final Answer:

   By choosing a join method that minimizes data scanning, like a hash join -> Option D

4. Quick Check:

   Optimizer picks efficient join method [OK]

Hint: Optimizer picks best join method to save time [OK]

Common Mistakes:

• Thinking optimizer auto-creates indexes
• Believing optimizer deletes data
• Assuming optimizer samples data automatically