Join algorithms (nested loop, sort-merge, hash join) in DBMS Theory - Practice Problems & Coding Challenges

Challenge - 5 Problems

🧠 Conceptual

intermediate

Understanding Nested Loop Join

Which statement best describes how a nested loop join works in database systems?

A It sorts both tables first and then merges them by scanning sequentially.

B It creates a hash table for the smaller table and probes it with rows from the larger table.

C It scans each row of the first table and for each row scans all rows of the second table to find matches.

D It uses indexes on both tables to directly find matching rows without scanning.

💡 Hint

Think about how many times the inner table is scanned for each row of the outer table.

A nested loop join works by taking each row from the first table and scanning all rows of the second table to find matching rows. This can be slow if tables are large.

📋 Factual

intermediate

Sort-Merge Join Characteristics

Which of the following is true about the sort-merge join algorithm?

A It only works if both tables have indexes on the join key.

B It requires both input tables to be sorted on the join key before merging.

C It compares every row of the first table with every row of the second table without sorting.

D It builds a hash table on the larger table and probes it with the smaller table.

💡 Hint

Consider what the 'merge' part of sort-merge join implies about the input data.

Sort-merge join requires both tables to be sorted on the join key so that they can be merged efficiently by scanning through both tables once.

🔍 Analysis

advanced

Choosing the Best Join Algorithm

Given two tables: one small and one very large, which join algorithm is generally the most efficient?

A Nested loop join, because it uses indexes to avoid scanning.

B Nested loop join, because it scans all rows of both tables repeatedly.

C Sort-merge join, because sorting is always faster than hashing.

D Hash join, because it builds a hash table on the smaller table and probes with the larger one.

💡 Hint

Think about which algorithm uses the smaller table to build a quick lookup structure.

Hash join is efficient when one table is small because it builds a hash table on the smaller table, allowing fast lookups when scanning the larger table.

❓ Comparison

advanced

Performance Differences Between Join Algorithms

Which of the following correctly compares the performance characteristics of nested loop join, sort-merge join, and hash join?

A Sort-merge join requires sorted inputs and is efficient for large datasets; hash join is efficient if enough memory is available; nested loop join is slow for large tables.

B Nested loop join is fastest for large unsorted tables; sort-merge join is slowest overall.

C Hash join always outperforms sort-merge join regardless of data size or memory.

D Nested loop join uses hashing internally; sort-merge join uses nested loops internally.

💡 Hint

Consider the requirements and typical use cases of each join algorithm.

Sort-merge join is efficient for large sorted datasets; hash join is fast if memory allows building a hash table; nested loop join is generally slow for large tables due to repeated scanning.

❓ Reasoning

expert

Memory Constraints Impact on Join Algorithm Choice

When memory is limited and cannot hold the entire smaller table for hashing, which join algorithm is most suitable?

A Sort-merge join, because it can handle large tables by sorting and merging in parts.

B None of the join algorithms can work without enough memory.

C Hash join, because it can always build a hash table regardless of memory size.

D Nested loop join, because it does not require sorting or hashing.

💡 Hint

Think about which algorithm can work efficiently even when data does not fit fully in memory.

Sort-merge join can handle large tables by sorting them in chunks and merging, making it suitable when memory is limited and hash join is not feasible.

Practice

1. Which join algorithm compares each row of one table with every row of another table to find matching pairs?

easy

A. Index join

B. Sort-merge join

C. Hash join

D. Nested loop join

Solution

1. Step 1: Understand the nested loop join process

   Nested loop join works by taking each row from the first table and comparing it with every row in the second table to find matches.

2. Step 2: Compare with other join types

   Sort-merge join sorts and merges, hash join uses hashing, and index join uses indexes, so they do not compare every pair.

3. Final Answer:

   Nested loop join -> Option D

4. Quick Check:

   Every row compared = Nested loop join [OK]

Hint: Nested loop = check all pairs one by one [OK]

Common Mistakes:

• Confusing nested loop with hash join
• Thinking sort-merge compares all pairs
• Assuming index join is same as nested loop

2. Which of the following is the correct description of a hash join algorithm?

easy

A. Sort both tables and merge matching rows

B. Use a hash table to find matching rows quickly

C. Compare each row of one table with every row of another

D. Use indexes to speed up join operations

Solution

1. Step 1: Recall hash join working

   Hash join builds a hash table on one table's join key to quickly find matching rows from the other table.

2. Step 2: Eliminate other options

   Sorting and merging is sort-merge join, comparing all pairs is nested loop, and using indexes is index join, not hash join.

3. Final Answer:

   Use a hash table to find matching rows quickly -> Option B

4. Quick Check:

   Hash table = fast matching [OK]

Hint: Hash join uses hash table for fast lookup [OK]

Common Mistakes:

• Mixing hash join with sort-merge join
• Thinking hash join compares all pairs
• Confusing index usage with hash join

3. Consider two tables A and B, each with 1000 rows. Which join algorithm is likely to perform best if both tables are already sorted on the join key?

medium

A. Nested loop join

B. Hash join

C. Sort-merge join

D. Cartesian join

Solution

1. Step 1: Analyze the condition of sorted tables

   Since both tables are sorted on the join key, sort-merge join can efficiently merge them by scanning once through both tables.

2. Step 2: Compare with other algorithms

   Nested loop join checks all pairs (slow), hash join builds hash table (extra work), Cartesian join is unrelated and very expensive.

3. Final Answer:

   Sort-merge join -> Option C

4. Quick Check:

   Sorted tables = sort-merge join best [OK]

Hint: Sorted tables? Use sort-merge join [OK]

Common Mistakes:

• Choosing nested loop for sorted tables
• Assuming hash join is always fastest
• Confusing Cartesian join with normal join

4. A database query uses a hash join but runs very slowly. Which of the following is a likely cause?

medium

A. The hash table does not fit in memory causing disk spills

B. The join keys are unique in both tables

C. Both tables are already sorted

D. The nested loop join was used instead

Solution

1. Step 1: Understand hash join memory use

   Hash join builds a hash table in memory. If it is too large, it spills to disk, slowing performance.

2. Step 2: Evaluate other options

   Sorted tables do not slow hash join, unique keys help performance, and nested loop join is a different algorithm.

3. Final Answer:

   The hash table does not fit in memory causing disk spills -> Option A

4. Quick Check:

   Memory overflow = slow hash join [OK]

Hint: Hash join slow? Check memory size for hash table [OK]

Common Mistakes:

• Blaming sorted tables for hash join slowness
• Ignoring memory limits in hash join
• Confusing nested loop join with hash join

5. You have two large tables to join on a key. Table A fits in memory but Table B is very large and unsorted. Which join algorithm is best to minimize disk I/O and why?

hard

A. Hash join, because building a hash on smaller Table A allows fast matching

B. Sort-merge join, because sorting both tables reduces I/O

C. Cartesian join, because it joins all rows regardless of keys

D. Nested loop join, because it checks all pairs without sorting

Solution

1. Step 1: Consider table sizes and memory

   Table A fits in memory, so building a hash table on it is efficient. Table B is large and unsorted, so sorting it would be expensive.

2. Step 2: Choose join algorithm minimizing disk I/O

   Hash join uses the smaller table in memory to quickly find matches in the larger table, reducing disk reads compared to sorting or nested loops.

3. Final Answer:

   Hash join, because building a hash on smaller Table A allows fast matching -> Option A

4. Quick Check:

   Small table in memory = hash join best [OK]

Hint: Small table fits memory? Use hash join [OK]

Common Mistakes:

• Choosing nested loop for large tables
• Preferring sort-merge without considering sorting cost
• Confusing Cartesian join with normal join