Consistent Hashing, Systems Thinking, System Design Concepts, System Design Interview, Distributed Systems.
hash(“D”) = 60 After adding Node D, the data ownership might change: Data 1: Stays with Node B Data 2: Moves from Node A to Node D Data 3: Stays with Node C Node Removal: Let’s say we remove Node A from the system. Only the data assigned to Node A needs to be redistributed: Data 2: Stays with Node