Chapter 6 Partitioning, Designing Data Intensive Application

This video contains:

- Partitioning
- How Partitioning and Replication are used together?
- Partitioning by Key Value
- Partitioning by Key Range
- Partitioning by Hash Key
- Rebalancing Partitions
- Hash Mod N
- Fixed Partition
- Dynamic Partition
- Request Routing
- Manual or Automatic rebalancing

Playlist link: Cracking The Coding Interview

[engineeringwithnisha]

Playlist link: Cracking The Coding Interview

[shivampandey]

Hey Code Darshan, I just want to tell you to keep making such videos. Not many developers are aware of these concepts, but sooner or later, they will need to understand the concepts. The approach which you have taken to make videos on the Designing Data-Intensive Applications book is up to the mark. I plan to follow your next playlist of Cracking The Coding Interview as well, once I complete this.

[ashutoshshukla]

great video. you cover everything in short.

[wrushu]

Great job. I have a question? I didn't get the bottleneck in Hash(Key) % ~N (~N # of partition that # of nodes).
Benefits I understood :-
Data do not move outside the partition
Just the partition moves in or out to new nodes

[ashutoshkumar]

First thanks for the video, it's really great. could it be possible to share the underlying ppt?