Learn System design : How distributed datastore works(basics)?

Learn System design the easy way!!

This is the second session of distributed datastores basics
In this session you will learn how nosql(cassandra) works in contrary to RDBMS!!

[pkr]

I have been going through the videos in this playlist and have watched most of them. The videos are easy to understand, well explained and touches the core concepts of distributed systems without going too much into fancy details (except for probably NFLX video). They are a delight to watch. Thank you, and please keep posting :)

[abhishekp]

I did really well in system design interview recently for one of the biggest company in the world because of you, I dint end up getting offer because of other round but grateful for your videos.

[amanpervaiz]

This is one of the top channels for system design. The videos are well researched and very well presented. Looking forward to going through all your videos and waiting for more!

[H-CSELEKrishnaMohan]

This is great and thanks for this video sir

[nknnithinabc]

NOTES:
In this cluster, there is no Such Master/Slave
Every Node stores a portion of data[Primary duty] and backup of other nodes[Secondary duty]


2:09 - NOSQL data is stores in various nodes


6:50 - Consistent Hashing tells us which node shud backup which data of which node


9:20 - In case of sharding, records go to server based on key Values. In consistent hashing, records go to server based on values of hash(Key)

[saiakhil]

Thank you very much. I needed this brief explanation

[biswajeetpatra]

Very clear and concise high level description....

[roshankumar]

Awesome explanation !! Please keep teaching us new concepts.

[sharatchandra]

I thank you for creating such a fantastic and well prepared series

[darioBoverio]

Excellent explanation, like the other videos! Thanks for sharing!

[creative-freedom]

In all consistent hashing algoritjms, when a node(system) joins or leaves the hash ring, only the neighboring nodes will be affected(rearranged).. usually it's just the one next node.. that's the main purpose of consistent hashing.. less damage for ring changes !!

[HimanshuSingh_]

I don't understand why 7 people have disliked the video..
Anyways great content. Thanks for sharing your knowledge with us.

[dasenthil]

I am trying to prepare the system design interview. your video is very help.

[NaturalPro]

Really simple and awesome to understand dude.Thanks a ton....

[ashishrane]

Thanks for the clear explanation and as suggested I had a look at cassandra architecture .
I have a question about when a node goes down new writes to that node will be directed to other node. which means the hashes get remapped .
Q1 : Also if the node after a while comes up then would it again be responsible for same hash range or different range?
Q2: Does data balancing occur everytime a node goes down or joins the cluster?
Q3: What happens to the read/writes during the time this re-balancing is happening? Specifically availability?
Q4: Typically how long would the re-balancing operation take place.?


Maybe it would be good if we have video on Cassandra

[anuragreddygv]

Awesome work man... keep them coming!!

[shashanknaik]

First of all kudos for the effort, excellent explanation. And would like to see a video on distributed messaging queue like kafka or Amazon sqs

[amithbkman]

Nice. I really like your videos. Very helpful

[ektagupta]

Thanks Narendra, I have just started viewing your series of videos on Distributed system design.
Your explanation looks simple and good.
However, I have one basic question to as you... why have you used term "Datastore" and not used "Database". Any particular reason regarding usage of this terminology?

[sauravdas]

What algorithm is used for Rebalancing after a node is added/deleted?