**Why optimization matters**: Shuffle on both sides = expensive; broadcast eliminates shuffle for large table. **Approach**: `df1.join(broadcast(df2), "key")` or set `spark.sql.autoBroadcastJoinThreshold` (e.g., 100MB). Broadcast sends small table to all executors; large table stays put. **Scalability trade-offs**: Small table must fit executor memory; verify with EXPLAIN. **Cost implications**: No shuffle for large side = 5–50x faster....
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 Dunnhumby. 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.