SELECT specific columns in SQL - Time & Space Complexity

Time Complexity: SELECT specific columns

O(n)

Understanding Time Complexity

When we ask how long a database query takes, we want to know how the work grows as the data grows.

Here, we look at how selecting only certain columns affects the time it takes to get results.

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

SELECT first_name, last_name, email
FROM customers
WHERE country = 'USA';

This query fetches only three columns from the customers who live in the USA.

Identify Repeating Operations

• Primary operation: Scanning each row in the customers table to check the country.
• How many times: Once for each row in the table (n times).

How Execution Grows With Input

As the number of rows grows, the database checks each row once to see if it matches the country.

Input Size (n)	Approx. Operations
10	10 checks
100	100 checks
1000	1000 checks

Pattern observation: The work grows directly with the number of rows.

Final Time Complexity

Time Complexity: O(n)

This means the time to run the query grows in a straight line as the table gets bigger.

Common Mistake

[X] Wrong: "Selecting fewer columns makes the query run much faster because it reads less data."

[OK] Correct: The main time is spent checking each row, not just reading columns. Selecting fewer columns helps with data transfer but does not reduce the number of rows checked.

Interview Connect

Understanding how queries scale with data size helps you write efficient database code and explain your thinking clearly in interviews.

Self-Check

"What if we added an index on the country column? How would the time complexity change?"