Join algorithms (nested loop, hash, merge) in PostgreSQL - Time & Space Complexity

Time Complexity: Join algorithms (nested loop, hash, merge)

O(n x m) for nested loop, O(n + m) for hash and merge joins

Understanding Time Complexity

When databases combine tables using joins, the way they do it affects how long it takes. We want to understand how the time needed grows as the tables get bigger.

How does the choice of join method change the work done as data grows?

Scenario Under Consideration

Analyze the time complexity of these three join methods in PostgreSQL.

-- Nested Loop Join
SELECT * FROM tableA a
JOIN tableB b ON a.id = b.a_id;

-- Hash Join
SELECT * FROM tableA a
JOIN tableB b ON a.id = b.a_id;

-- Merge Join
SELECT * FROM tableA a
JOIN tableB b ON a.id = b.a_id
ORDER BY a.id, b.a_id;
    

These queries join two tables on matching IDs using different join algorithms.

Identify Repeating Operations

Each join method repeats operations differently:

• Nested Loop Join: For each row in tableA, it scans all rows in tableB.
• Hash Join: Builds a hash table for one table, then looks up matches for each row in the other.
• Merge Join: Both tables are sorted, then scanned once together to find matches.
• Primary operation: Comparing rows between tables to find matches.
• How many times: Nested loop does this many times (rows in A x rows in B), hash join once per row after hashing, merge join once per row in sorted order.

How Execution Grows With Input

Imagine tableA and tableB grow in size:

Input Size (rows in each table)	Nested Loop Ops	Hash Join Ops	Merge Join Ops
10	100 (10x10)	~20 (build + probe)	~20 (sorted scan)
100	10,000 (100x100)	~200 (build + probe)	~200 (sorted scan)
1000	1,000,000 (1000x1000)	~2000 (build + probe)	~2000 (sorted scan)

Nested loop grows very fast as tables get bigger, while hash and merge join grow more slowly, roughly proportional to the total rows.

Final Time Complexity

Time Complexity: O(n x m) for nested loop, O(n + m) for hash and merge joins

This means nested loop work grows by multiplying table sizes, but hash and merge join work grows by adding sizes, making them faster for big tables.

Common Mistake

[X] Wrong: "All join methods take the same time no matter table size."

[OK] Correct: Nested loop joins check every pair, so time grows fast with size. Hash and merge join use smarter ways to avoid checking all pairs, so they scale better.

Interview Connect

Understanding how join methods scale helps you explain database performance clearly. This skill shows you know how data size affects query speed, a key part of working with databases.

Self-Check

"What if one table is much smaller than the other? How would that affect the time complexity of each join method?"

Practice

1. Which join algorithm in PostgreSQL is best suited for small tables or when one table is very small compared to the other?

easy

A. Index Join

B. Hash Join

C. Nested Loop Join

D. Merge Join

Solution

1. Step 1: Understand Nested Loop Join usage

   Nested Loop Join works by scanning one table and for each row scanning the other table. It is efficient when one table is small.

2. Step 2: Compare with other joins

   Hash Join is better for large unsorted tables, Merge Join requires sorted inputs. Nested Loop is simplest and best for small tables.

3. Final Answer:

   Nested Loop Join -> Option C

4. Quick Check:

   Small table + Nested Loop Join = best [OK]

Hint: Small table joins usually use Nested Loop Join [OK]

Common Mistakes:

• Confusing Hash Join as best for small tables
• Thinking Merge Join works well without sorted data
• Assuming Index Join is a separate join algorithm

2. Which of the following is the correct syntax to hint PostgreSQL to use a Hash Join in a query?

easy

A. SELECT /*+ HashJoin */ * FROM table1 JOIN table2 ON table1.id = table2.id;

B. SET enable_hashjoin = on; SELECT * FROM table1 JOIN table2 ON table1.id = table2.id;

C. SELECT * FROM table1 HASH JOIN table2 ON table1.id = table2.id;

D. SELECT * FROM table1 JOIN table2 USING HASH(id);

Solution

1. Step 1: Understand PostgreSQL join hints

   PostgreSQL does not support inline join hints like /*+ HashJoin */ or HASH JOIN syntax.

2. Step 2: Use configuration to enable Hash Join

   We can enable or disable join types using SET commands, e.g., SET enable_hashjoin = on; before the query.

3. Final Answer:

   SET enable_hashjoin = on; SELECT ... -> Option B

4. Quick Check:

   PostgreSQL uses SET to enable join types [OK]

Hint: Use SET enable_hashjoin to control hash join usage [OK]

Common Mistakes:

• Using Oracle-style hints like /*+ HashJoin */
• Trying to write HASH JOIN in SQL syntax
• Using USING HASH() which is invalid

3. Given two tables employees(emp_id, dept_id) and departments(dept_id, name), what join algorithm will PostgreSQL most likely use for this query?

EXPLAIN SELECT * FROM employees JOIN departments ON employees.dept_id = departments.dept_id;

Assuming both tables are large and departments.dept_id is indexed.

medium

A. Nested Loop Join

B. Merge Join

C. Cross Join

D. Hash Join

Solution

1. Step 1: Analyze table sizes and indexes

   Both tables are large, so Nested Loop is inefficient. Departments has an index on dept_id.

2. Step 2: Determine join algorithm choice

   Hash Join is preferred for large tables without sorted data. Merge Join requires sorted inputs, which is not guaranteed here.

3. Final Answer:

   Hash Join -> Option D

4. Quick Check:

   Large tables + no sorted data = Hash Join [OK]

Hint: Large tables with join keys use Hash Join by default [OK]

Common Mistakes:

• Assuming index forces Nested Loop Join
• Thinking Merge Join is automatic without sorting
• Confusing Cross Join with inner join

4. You wrote this query:

SELECT * FROM orders o JOIN customers c ON o.customer_id = c.customer_id;

But PostgreSQL is using a Nested Loop Join causing slow performance. Which fix will most likely improve performance by enabling a better join algorithm?

medium

A. Disable Nested Loop Join with SET enable_nestloop = off;

B. Create an index on orders.customer_id

C. Rewrite query using LEFT JOIN instead of JOIN

D. Add ORDER BY on customer_id in the query

Solution

1. Step 1: Identify why Nested Loop is slow

   Nested Loop is slow on large tables without indexes or when better joins exist but are not chosen.

2. Step 2: Force PostgreSQL to avoid Nested Loop

   Disabling Nested Loop join with SET enable_nestloop = off forces PostgreSQL to pick Hash or Merge Join, improving performance.

3. Final Answer:

   Disable Nested Loop Join with SET enable_nestloop = off; -> Option A

4. Quick Check:

   Disable Nested Loop to force better join [OK]

Hint: Disable nested loop join to force hash or merge join [OK]

Common Mistakes:

• Assuming adding index always fixes join choice
• Changing JOIN type without understanding join algorithms
• Adding ORDER BY does not affect join algorithm

5. You have two large sorted tables sales(date, product_id, amount) and products(product_id, name). You want to join them on product_id efficiently. Which join algorithm should you prefer and why?

hard

A. Merge Join, because it exploits sorted order for fast merging

B. Hash Join, because it hashes the smaller table for fast lookup

C. Nested Loop Join, because it works well with sorted data

D. Cross Join, because it combines all rows

Solution

1. Step 1: Identify join algorithm suited for sorted tables

   Merge Join is designed to efficiently join two sorted inputs by merging them in order.

2. Step 2: Compare with other join algorithms

   Nested Loop is inefficient for large tables, Hash Join ignores sorting, Cross Join produces Cartesian product.

3. Final Answer:

   Merge Join, because it exploits sorted order for fast merging -> Option A

4. Quick Check:

   Sorted tables + Merge Join = efficient join [OK]

Hint: Use Merge Join when both tables are sorted on join keys [OK]

Common Mistakes:

• Choosing Nested Loop for large sorted tables
• Ignoring sorting and picking Hash Join
• Confusing Cross Join with inner join