Concept
Virtual nodes
Virtual nodes place each server at many points on a hash ring instead of one. Each server then owns many small stretches that add up to a nearly equal share of the keys. When a server leaves, its keys are spread over all the others instead of landing on a single neighbour.
Where you'll see it
Related concepts
Sources: Dynamo: Amazon's highly available key-value store (SOSP 2007) ↗ · Karger et al.: Consistent hashing and random trees (STOC 1997) ↗ · Mirrokni, Thorup, Zadimoghaddam: Consistent hashing with bounded loads ↗ · Report a problem
The definition is in our own words; the sources are those of the lesson Virtual nodes & hot keys.