Sort-Based Shuffle: One File, Not N Squared

Early Spark had a shuffle implementation that did not scale, and understanding why it was replaced explains the design you rely on today. The original hash-based shuffle had each map task write a separate file for each reduce partition. With M map tasks and R reduce partitions, that is M times R files, and on a large cluster M times R is millions of tiny files. The operating system buckled under the file handles and the random I/O of opening millions of small files crushed performance. Sort-based shuffle, the default for years now, fixes this. Each map task writes a single data file containing all of its buckets, sorted by reduce partition, plus one small index file that records where each bucket begins within that data file. So instead of M times R files, the cluster has 2M files, one dat

About This Interactive Section

This section is part of the Shuffle Internals and Elimination lesson on DataDriven, a free data engineering interview prep platform. Each section includes explanations, worked examples, and hands-on code challenges that execute in real time. SQL queries run against a live PostgreSQL database. Python runs in a sandboxed Docker container. Data modeling problems validate against interactive schema canvases. All content is framed around what data engineering interviewers actually test at companies like Meta, Google, Amazon, Netflix, Stripe, and Databricks.

How DataDriven Lessons Work

DataDriven combines four interview rounds (SQL, Python, Data Modeling, Pipeline Architecture) with adaptive difficulty and spaced repetition. Easy problems get harder as you improve. Weak concepts resurface until you master them. Your readiness score tracks progress across every topic interviewers test. Every lesson section ends with problems you solve by writing and running real code, not by picking multiple-choice answers.