Part 1 of 5 · 1 min read
Why this page comes first
In this module you will
- Explain why a dataset outgrows a single machine and needs partitioning.
- Compare range partitioning and hash partitioning on where each row ends up.
- Define skew, and explain why a poor partitioning key causes it.
- Choose a reasonable partitioning key for a described workload.
Earlier levels assumed a single machine held the whole dataset. This page opens the level that removes that assumption. It covers the two basic strategies for splitting one dataset across many machines, and the main way that split can go wrong.