Cost-based optimization in DBMS Theory - Time & Space Complexity

Time Complexity: Cost-based optimization

O(n!)

Understanding Time Complexity

Cost-based optimization helps a database decide the best way to run a query efficiently.

We want to know how the time to find the best plan grows as the query or data size grows.

Scenario Under Consideration

Analyze the time complexity of this simplified cost-based optimizer process.

-- Pseudocode for cost-based optimization
FOR each possible query plan P
  ESTIMATE cost of P
SELECT plan with lowest cost
    

This code tries all possible ways to run a query, estimates their costs, and picks the cheapest one.

Identify Repeating Operations

Look for repeated steps that take most time.

• Primary operation: Checking each possible query plan.
• How many times: Number of plans grows with query complexity, often very fast.

How Execution Grows With Input

As the query gets more parts (like joins), the number of plans to check grows quickly.

Input Size (number of joins)	Approx. Plans Checked
2	2
4	~20
6	~400

Pattern observation: The number of plans grows very fast, much faster than just doubling.

Final Time Complexity

Time Complexity: O(n!)

This means the time to find the best plan grows extremely fast as the query size increases.

Common Mistake

[X] Wrong: "The optimizer checks only a few plans, so it runs quickly for any query."

[OK] Correct: In reality, the number of plans can explode with query size, making optimization costly.

Interview Connect

Understanding how optimization time grows helps you appreciate database design and query tuning skills.

Self-Check

What if the optimizer used heuristics to skip some plans? How would the time complexity change?

Practice

1. What is the main goal of cost-based optimization in a database system?

easy

A. To find the most efficient way to execute a query

B. To store data in the smallest space possible

C. To encrypt data for security

D. To backup the database automatically

Solution

1. Step 1: Understand the purpose of cost-based optimization

   Cost-based optimization evaluates different ways to run a query and estimates their costs.

2. Step 2: Identify the main goal

   The goal is to pick the plan with the lowest cost, meaning the fastest or least resource-heavy execution.

3. Final Answer:

   To find the most efficient way to execute a query -> Option A

4. Quick Check:

   Cost-based optimization = efficient query execution [OK]

Hint: Focus on efficiency and speed of query execution [OK]

Common Mistakes:

• Confusing optimization with data storage
• Thinking it handles security tasks
• Assuming it manages backups

2. Which of the following is a key input used by cost-based optimizers to estimate query costs?

easy

A. User login credentials

B. Data statistics like table size and index availability

C. Network bandwidth

D. Database backup schedules

Solution

1. Step 1: Identify what cost-based optimizers use

   They rely on data statistics such as table size, number of rows, and indexes to estimate costs.

2. Step 2: Match the correct input

   Data statistics directly affect the cost estimation, unlike user credentials or backup schedules.

3. Final Answer:

   Data statistics like table size and index availability -> Option B

4. Quick Check:

   Cost estimation uses data statistics [OK]

Hint: Remember: statistics guide cost estimates, not user info [OK]

Common Mistakes:

• Confusing user data with statistics
• Thinking network or backups affect cost estimation
• Ignoring the role of indexes

3. Consider a database query optimizer that chooses between two plans: Plan A costs 50 units, Plan B costs 80 units. Which plan will the optimizer select?

medium

A. Neither plan because cost is ignored

B. Plan B because it has a higher cost

C. Both plans equally because cost does not matter

D. Plan A because it has a lower cost

Solution

1. Step 1: Understand cost comparison

   The optimizer picks the plan with the lowest estimated cost to improve performance.

2. Step 2: Compare given costs

   Plan A costs 50 units, which is less than Plan B's 80 units, so Plan A is preferred.

3. Final Answer:

   Plan A because it has a lower cost -> Option D

4. Quick Check:

   Lower cost plan chosen = Plan A [OK]

Hint: Choose the plan with the smallest cost number [OK]

Common Mistakes:

• Picking higher cost plan mistakenly
• Ignoring cost values
• Assuming cost is irrelevant

4. A cost-based optimizer is not choosing the fastest query plan. What could be a likely reason?

medium

A. The data statistics are outdated or inaccurate

B. The database server is turned off

C. The query syntax is incorrect

D. The user has no permissions

Solution

1. Step 1: Identify factors affecting optimizer decisions

   The optimizer depends on accurate data statistics to estimate costs correctly.

2. Step 2: Analyze the problem cause

   If statistics are outdated, the optimizer may pick a suboptimal plan, causing slower queries.

3. Final Answer:

   The data statistics are outdated or inaccurate -> Option A

4. Quick Check:

   Outdated stats cause wrong plan choice [OK]

Hint: Check if statistics are current to fix optimizer issues [OK]

Common Mistakes:

• Blaming server status without checking stats
• Confusing syntax errors with optimization issues
• Assuming permissions affect plan choice

5. A database has two indexes on a table: one on column A and another on column B. A query filters on both columns. How does cost-based optimization decide which index to use?

hard

A. It ignores indexes and does a full table scan

B. It always uses the index on column A by default

C. It estimates the cost of using each index and picks the cheaper one

D. It uses both indexes simultaneously without cost estimation

Solution

1. Step 1: Understand index selection by cost-based optimizer

   The optimizer calculates the cost of using each index based on statistics like selectivity and size.

2. Step 2: Apply cost comparison to index choice

   It chooses the index that results in the lowest estimated cost for the query execution.

3. Final Answer:

   It estimates the cost of using each index and picks the cheaper one -> Option C

4. Quick Check:

   Index choice based on cost estimation [OK]

Hint: Optimizer picks index with lowest estimated cost [OK]

Common Mistakes:

• Assuming fixed index usage without cost check
• Thinking optimizer ignores indexes
• Believing it uses multiple indexes without cost analysis