Narrow and Wide Dependencies
Some operations keep each partition’s work local; others need rows from everywhere. That difference is where stage boundaries and expensive recovery come from.
Some operations keep each partition’s work local; others need rows from everywhere. That difference is where stage boundaries and expensive recovery come from.
Row computation waits for an action, while planning may happen earlier. See how plans become stages and tasks, and where shuffle boundaries cost time.
Understand partition distributions, salted aggregates and joins, broadcast plans, coalesce, and Parquet file counts while preserving query semantics.
Understand Spark drivers, executors, partitions, memory limits, caching, and the conditions for recomputation and recovery.