**Partitioning**: repartition by key before shuffle; coalesce before write. Reduces skew and small files.
**Broadcast Join**: Small table < 100MB to all executors; no shuffle. Critical for star schema.
**Predicate Pushdown**: Filters pushed to Parquet/ORC; skip row groups. Partition pruning on directory structure.
**Caching**: MEMORY_AND_DISK for reused DFs; unpersist when done.
**AQE**: Runtime coalesce of shuffle partitions; skew join split; broadcast join switch....
The complete answer continues with detailed implementation patterns, architectural trade-offs, and production-grade considerations. It covers performance optimization strategies, common pitfalls to avoid, and real-world examples from companies like Cognizant. The answer also includes follow-up discussion points that interviewers commonly explore.
Continue Reading the Full Answer
Unlock the complete expert answer with code examples, trade-offs, and pro tips - plus 1,863+ more.
Or upgrade to Platform Pro - $39
Engineers who used these answers got offers at
AmazonDatabricksSnowflakeGoogleMeta
According to DataEngPrep.tech, this is one of the most frequently asked Spark/Big Data interview questions, reported at 1 company. DataEngPrep.tech maintains a curated database of 1,863+ real data engineering interview questions across 7 categories, verified by industry professionals.