Self joins in Apache Spark - Time & Space Complexity
When we use self joins in Apache Spark, we combine a table with itself to find related rows.
We want to know how the time to do this grows as the data gets bigger.
Analyze the time complexity of the following code snippet.
from pyspark.sql import SparkSession
spark = SparkSession.builder.getOrCreate()
df = spark.createDataFrame([
(1, "A"),
(2, "B"),
(3, "A"),
(4, "C")
], ["id", "category"])
joined_df = df.alias("df1").join(df.alias("df2"), on="category")
joined_df.show()
This code joins the DataFrame with itself on the "category" column to find pairs with the same category.
Identify the loops, recursion, array traversals that repeat.
- Primary operation: Matching each row in the first DataFrame with rows in the second DataFrame that share the same category.
- How many times: For each of the n rows, it compares with potentially many rows in the other copy, depending on category matches.
As the number of rows grows, the number of comparisons grows quickly because each row can match multiple rows in the other copy.
| Input Size (n) | Approx. Operations |
|---|---|
| 10 | About 100 comparisons |
| 100 | About 10,000 comparisons |
| 1000 | About 1,000,000 comparisons |
Pattern observation: The work grows roughly with the square of the input size.
Time Complexity: O(n^2)
This means if you double the data size, the work to join grows about four times.
[X] Wrong: "Self joins take linear time because it's just one table."
[OK] Correct: Actually, joining a table with itself compares many pairs of rows, so the work grows much faster than just reading the data once.
Understanding how self joins scale helps you explain performance in real data tasks and shows you can think about costs clearly.
"What if we added a filter before the join to reduce rows? How would the time complexity change?"
Practice
What is the main purpose of a self join in Apache Spark?
Solution
Step 1: Understand the concept of self join
A self join means joining a DataFrame to itself to compare or relate rows within the same dataset.Step 2: Differentiate from other joins
Other joins combine different DataFrames or filter rows, but self join specifically uses the same DataFrame twice.Final Answer:
To join a DataFrame with itself to compare rows within the same dataset -> Option AQuick Check:
Self join = join DataFrame to itself [OK]
- Confusing self join with joining different DataFrames
- Thinking self join stacks rows vertically
- Assuming self join is just filtering rows
Which of the following is the correct way to create aliases for a self join in Spark using DataFrame API?
df1 = df.alias('a')
df2 = df.alias('b')
joined = df1.join(df2, ...)Solution
Step 1: Use alias() method for self join
In Spark, to join a DataFrame to itself, you create aliases usingalias()to distinguish the two references.Step 2: Check the syntax correctness
df1 = df.alias('a'); df2 = df.alias('b'); joined = df1.join(df2, 'id') usesalias()correctly and joins on a column 'id'. df1 = df.as('a'); df2 = df.as('b'); joined = df1.join(df2, 'id') usesas()which is not a valid DataFrame method in Spark.Final Answer:
df1 = df.alias('a'); df2 = df.alias('b'); joined = df1.join(df2, 'id') -> Option AQuick Check:
Use alias() for self join [OK]
- Using as() instead of alias()
- Not creating aliases and causing ambiguous columns
- Copying DataFrame instead of aliasing
Given the following Spark code, what will be the output count?
from pyspark.sql import SparkSession
spark = SparkSession.builder.getOrCreate()
data = [(1, 'A'), (2, 'B'), (3, 'A')]
df = spark.createDataFrame(data, ['id', 'group'])
df1 = df.alias('df1')
df2 = df.alias('df2')
joined = df1.join(df2, (df1.group == df2.group) & (df1.id != df2.id))
print(joined.count())Solution
Step 1: Understand the data and join condition
Data has 3 rows: (1, 'A'), (2, 'B'), (3, 'A'). The join matches rows with the same group but different ids.Step 2: Count matching pairs
Group 'A' has ids 1 and 3, so pairs are (1,3) and (3,1) = 2 matches. Group 'B' has only one id, so no match. Total matches = 2 rows. However, since the join is a cross join on the condition, each pair appears twice (once as (1,3) and once as (3,1)), so total count is 4.Final Answer:
4 -> Option BQuick Check:
Count matching pairs with condition = 4 [OK]
- Counting only one direction of pairs
- Including rows where id equals
- Ignoring symmetric pairs
Identify the error in this Spark self join code snippet:
df1 = df.alias('a')
df2 = df.alias('b')
joined = df1.join(df2, df1.id == df2.id)
joined.show()What is the problem?
Solution
Step 1: Analyze the join condition
The join condition isdf1.id == df2.id, which matches rows with the same id, including the same row joined to itself.Step 2: Identify missing filter to exclude self matches
There is no condition to exclude rows where the two aliases refer to the same row, so the join includes self matches.Final Answer:
The join condition causes each row to join with itself, no filtering -> Option CQuick Check:
Join condition includes self matches [OK]
- Not excluding rows where both aliases are same
- Assuming alias() is missing
- Confusing syntax error with logic error
You have a DataFrame df with columns employee_id, manager_id, and department. You want to find pairs of employees who work in the same department and share the same manager but are different employees. Which self join condition is correct?
Solution
Step 1: Understand the requirement
We want pairs of employees in the same department, with the same manager, but different employee IDs.Step 2: Translate to join condition
The join condition must check equality of department and manager_id, and inequality of employee_id to avoid self pairs.Final Answer:
df1.department == df2.department AND df1.manager_id == df2.manager_id AND df1.employee_id != df2.employee_id -> Option DQuick Check:
Same department & manager, different employees [OK]
- Matching employee_id to manager_id incorrectly
- Not excluding same employee pairs
- Checking for different managers instead of same
Ready to prove it?
Pass the test and this pattern moves unknown
