LAG and LEAD for row comparison in PostgreSQL - Time & Space Complexity
We want to understand how the time needed to run queries using LAG and LEAD changes as the data grows.
How does the number of rows affect the work done by these functions?
Analyze the time complexity of the following code snippet.
SELECT
id,
value,
LAG(value) OVER (ORDER BY id) AS prev_value,
LEAD(value) OVER (ORDER BY id) AS next_value
FROM data_table;
This query compares each row's value with the previous and next rows based on the id order.
Identify the loops, recursion, array traversals that repeat.
- Primary operation: Scanning each row once and accessing neighboring rows.
- How many times: Once per row in the table.
As the number of rows grows, the query processes each row once to find previous and next values.
| Input Size (n) | Approx. Operations |
|---|---|
| 10 | About 10 operations |
| 100 | About 100 operations |
| 1000 | About 1000 operations |
Pattern observation: The work grows directly with the number of rows, increasing steadily.
Time Complexity: O(n)
This means the time to run the query grows in a straight line as the number of rows increases.
[X] Wrong: "LAG and LEAD scan the whole table multiple times, so time grows much faster than the number of rows."
[OK] Correct: These functions only look at each row once and access neighbors directly, so they do not multiply the work by scanning repeatedly.
Understanding how window functions like LAG and LEAD scale helps you explain query performance clearly and confidently in real situations.
"What if we added a PARTITION BY clause to the window functions? How would the time complexity change?"
Practice
LAG function in PostgreSQL?Solution
Step 1: Understand LAG function behavior
TheLAGfunction returns the value from a previous row based on the current row's position.Step 2: Compare with other options
LEADaccesses the next row, sorting and deleting duplicates are unrelated toLAG.Final Answer:
To access data from a previous row in the same result set -> Option DQuick Check:
LAG = previous row data access [OK]
- Confusing LAG with LEAD
- Thinking LAG sorts rows
- Assuming LAG deletes duplicates
LEAD to get the next row's salary ordered by employee_id?Solution
Step 1: Recall correct LEAD syntax
The correct syntax usesLEAD(column) OVER (ORDER BY column)to specify the column and ordering.Step 2: Check each option
LEAD(salary) OVER (ORDER BY employee_id) matches the correct syntax; others misuse parentheses or clause order.Final Answer:
LEAD(salary) OVER (ORDER BY employee_id) -> Option AQuick Check:
LEAD(column) OVER (ORDER BY column) [OK]
- Placing ORDER BY outside OVER clause
- Missing parentheses around ORDER BY
- Putting ORDER BY inside function parameters
sales with columns month and revenue, what will this query return?SELECT month, revenue, LAG(revenue) OVER (ORDER BY month) AS prev_revenue FROM sales;
Solution
Step 1: Understand LAG with ORDER BY month
TheLAG(revenue)returns the revenue from the previous month ordered bymonth.Step 2: Interpret query output
Each row shows current month revenue and previous month's revenue inprev_revenue. The first row'sprev_revenuewill be NULL.Final Answer:
Each row shows current month revenue and previous month's revenue -> Option CQuick Check:
LAG = previous row value [OK]
- Confusing LAG with LEAD
- Expecting next month's revenue instead
- Thinking query causes error
SELECT employee_id, salary, LEAD(salary) ORDER BY employee_id FROM employees;
Solution
Step 1: Check LEAD function syntax
LEAD requires an OVER() clause to specify ordering and partitioning.Step 2: Analyze query structure
The query usesLEAD(salary)withoutOVER(), causing a syntax error.Final Answer:
Missing OVER() clause for LEAD function -> Option BQuick Check:
Window functions need OVER() [OK]
- Omitting OVER() clause
- Placing ORDER BY outside OVER()
- Confusing window functions with aggregates
hire_date. Which query correctly uses LAG to achieve this?Solution
Step 1: Understand LAG usage for filtering
Window functions likeLAGcannot be used directly in WHERE clause; use subquery or CTE to compute then filter.Step 2: Analyze options
SELECT employee_id, salary FROM (SELECT employee_id, salary, LAG(salary) OVER (ORDER BY hire_date) AS prev_salary FROM employees) t WHERE salary > prev_salary; correctly uses subquery. The second option's subquery LAG lacks OVER clause (syntax error). The third uses alias in WHERE (invalid). The fourth uses HAVING without GROUP BY (invalid).Final Answer:
SELECT employee_id, salary FROM (SELECT employee_id, salary, LAG(salary) OVER (ORDER BY hire_date) AS prev_salary FROM employees) t WHERE salary > prev_salary; -> Option AQuick Check:
Subquery to filter on window functions [OK]
- Using alias in WHERE clause
- Misusing HAVING without GROUP BY
- Incorrect subquery for LAG
Ready to prove it?
Pass the test and this pattern moves unknown
