Back to Browse

Chapter 6: Database Partitioning

114 views
Apr 26, 2026
8:53

⚑ Ever wondered how Cassandra stores petabytes? How DynamoDB serves millions of requests per second? How Bigtable powers Google Search? The answer is Partitioning β€” and this video teaches you everything you need to know. πŸ“– In this deep-dive into Chapter 6 of "Designing Data-Intensive Applications" by Martin Kleppmann, we cover: πŸ”‘ What partitioning (sharding) is and why it's non-negotiable at scale πŸ”‘ Key Range Partitioning vs Hash Partitioning β€” and how to choose πŸ”‘ The Celebrity Hot Spot problem β€” and how to solve it in application code πŸ”‘ Local vs Global Secondary Indexes β€” and their brutal trade-offs πŸ”‘ Rebalancing strategies: Fixed partitions, Dynamic partitions, and the Cassandra approach πŸ”‘ Why hash mod N will destroy your cluster πŸ”‘ Request Routing β€” ZooKeeper, Gossip Protocols, and Routing Tiers πŸ”‘ Massively Parallel Query Execution (MPP) for analytics Whether you're preparing for system design interviews at FAANG, building your first distributed system, or reading DDIA for the first time β€” this video gives you the mental models to think and build like a principal engineer.

Download

1 formats

Video Formats

360pmp47.1 MB

Right-click 'Download' and select 'Save Link As' if the file opens in a new tab.

Chapter 6: Database Partitioning | NatokHD