Window functions in Apache Spark - Time & Space Complexity
We want to understand how the time to run window functions changes as data grows.
How does the number of rows affect the work done by window functions?
Analyze the time complexity of the following code snippet.
from pyspark.sql import Window
from pyspark.sql.functions import row_number
window_spec = Window.partitionBy('category').orderBy('value')
df = df.withColumn('row_num', row_number().over(window_spec))
This code adds a row number within each category, ordering rows by value.
Identify the loops, recursion, array traversals that repeat.
- Primary operation: For each row, the window function looks at other rows in the same category to order them.
- How many times: This happens once per row, but ordering within each category involves comparing rows in that category.
As the number of rows grows, the work to order rows in each category grows too.
| Input Size (n) | Approx. Operations |
|---|---|
| 10 | About 10 rows ordered in groups |
| 100 | More rows, ordering within categories grows roughly with n log n per category |
| 1000 | Ordering cost increases more noticeably as groups get bigger |
Pattern observation: The ordering inside each category grows faster than just the number of rows, because sorting takes more work as groups get larger.
Time Complexity: O(n log m)
This means the time grows with the number of rows times the log of the average group size, due to sorting within each group.
[X] Wrong: "Window functions always run in linear time with the number of rows."
[OK] Correct: Sorting inside each group takes more time than just looking at each row once, so the cost depends on group sizes and sorting.
Understanding how window functions scale helps you explain performance in real data tasks and shows you know how grouping and ordering affect work done.
"What if we removed the orderBy clause from the window specification? How would the time complexity change?"
Practice
Solution
Step 1: Understand window function behavior
Window functions calculate values across related rows but keep all original rows intact.Step 2: Compare with grouping
Grouping reduces rows by aggregation, but window functions add columns without reducing rows.Final Answer:
To perform calculations across rows related to the current row without collapsing the data -> Option AQuick Check:
Window functions add calculations without grouping ≠ A [OK]
- Confusing window functions with groupBy aggregations
- Thinking window functions filter rows
- Assuming window functions join datasets
Solution
Step 1: Recall PySpark window spec syntax
The correct methods are partitionBy() and orderBy() chained on Window.Step 2: Check method order and names
partitionBy comes first, then orderBy; groupBy and sortBy are incorrect here.Final Answer:
Window.partitionBy('department').orderBy('salary') -> Option CQuick Check:
Use partitionBy then orderBy methods [OK]
- Using groupBy instead of partitionBy
- Using sortBy instead of orderBy
- Using incorrect method names like partition or order
from pyspark.sql import SparkSession
from pyspark.sql.window import Window
from pyspark.sql.functions import rank
spark = SparkSession.builder.getOrCreate()
data = [("Alice", "Sales", 5000), ("Bob", "Sales", 4000), ("Charlie", "Sales", 5000)]
df = spark.createDataFrame(data, ["name", "department", "salary"])
windowSpec = Window.partitionBy("department").orderBy("salary")
df = df.withColumn("rank", rank().over(windowSpec))
df.orderBy("salary").show()Solution
Step 1: Understand rank() behavior
Rank assigns the same rank to ties and skips ranks after ties.Step 2: Apply rank over salary ascending
Bob has salary 4000 ranked 1; Alice and Charlie both have 5000, so both get rank 2.Final Answer:
[ ("Bob", 4000, 1), ("Alice", 5000, 2), ("Charlie", 5000, 2) ] -> Option AQuick Check:
rank() ties share rank, next rank skips [OK]
- Confusing rank() with dense_rank()
- Assigning different ranks to tied values
- Not ordering data before applying rank
from pyspark.sql.window import Window
from pyspark.sql.functions import row_number
windowSpec = Window.partitionBy('department')
df = df.withColumn('row_num', row_number().over(windowSpec.orderBy('salary')))Solution
Step 1: Check windowSpec usage
windowSpec is a WindowSpec object; calling orderBy on it is valid and returns a new WindowSpec.Step 2: Confirm chaining
Chaining orderBy on windowSpec is allowed to refine the window specification.Final Answer:
windowSpec.orderBy('salary') is valid; no error in code -> Option BQuick Check:
WindowSpec supports chaining orderBy to refine window [OK]
- Calling orderBy on windowSpec instead of Window
- Assuming row_number can't be used with partitionBy
- Forgetting to import Window or functions
Solution
Step 1: Define window for 3-day moving average per store
Partition by 'store' to separate stores, order by 'date' for time sequence, use rowsBetween(-2, 0) for current and previous 2 rows.Step 2: Apply avg() over this window
Use avg('sales').over(windowSpec) to compute moving average over the defined window.Final Answer:
Use Window.partitionBy('store').orderBy('date').rowsBetween(-2, 0) and avg('sales').over(windowSpec) -> Option DQuick Check:
rowsBetween(-2,0) for 3-day window, partition by store [OK]
- Using rangeBetween instead of rowsBetween for row count
- Not partitioning by store
- Using wrong rowsBetween range (like 0 to 2)
Ready to prove it?
Pass the test and this pattern moves unknown
