Overflow in consistent hashing · Ryan Marcus
14 Sep 2018
Consistent hashing was first proposed in 1997 by David Karger et al., and is used today in many large-scale data management systems, including (for example) Apache Cassandra. Consistent hashing helps reduce the number of items that need to be moved from one machine to another when the number of machines in a cluster changes.
The basic idea is to use two hash functions1 – one, , which maps each data item to a point on a circle (generally represented as an angle between and ), and ano...
Read more at rmarcus.info