Info
Consistent Hashing is an algorithm of partitioning and storing data in a distributed manner with limited disruption of the service. Cassandra does this during Partitioning. When we say consistent Hashing, we mean an algorithm where in an event of node failure, we won’t recalculate all of the hashes, but just a part.
Hashes are calculated based on a primary key. Data is distributed in a ring of nodes. In the event of a node failure, we will recalculate only that specific part of the ring.