**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....
This hard-level Spark/Big Data question appears frequently in data engineering interviews at companies like Cognizant. While less common, it tests deeper understanding that distinguishes strong candidates. Mastering the underlying concepts (join, optimization, partition) will help you answer variations of this question confidently.
This is a senior-level question that tests architectural thinking. Lead with the high-level design, then drill into specifics. Discuss trade-offs explicitly - there is rarely one correct answer. Show awareness of scale, fault tolerance, and operational complexity.
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.
This answer is partially locked
Unlock the full expert answer with code examples and trade-offs
Practice real interviews with AI feedback, track progress, and get interview-ready faster.
Pro starts at $24/mo - cancel anytime
Get the most asked SQL questions with expert answers. Instant download.
No spam. Unsubscribe anytime.
Paste your answer and get instant AI feedback with a FAANG-level improved version.
Analyze My Answer — FreeAccording 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.