**MapReduce**: Disk-based. Each job writes to HDFS between map and reduce. Multi-stage = multiple disk I/O. Latency: minutes to hours per stage.
**Spark**: In-memory (when cached). DAG with lazy evaluation. RDD/DataFrame caching. 10–100x faster for iterative (ML, graph).
**Why Spark Won**: Iterative algorithms (e.g., PageRank, K-means) run 10–100x faster. Unified batch + streaming. DataFrame API + Catalyst.
**Scalability Trade-offs**: Spark needs more memory....
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 Globant. 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.