MENTAL MODEL · M6187

Consistent Hashing

SystemsHigh supportSystems Theory

Included

Version 1.0.0 · Updated 2026-07-30

CORE DEFINITION

A special hashing algorithm. When the size of the hash table (e.g., the number of servers) changes, only a small fraction of data needs to be remapped, without reshuffling all data. It solves the thrashing problem during scaling in distributed systems.

SCAFFOLDING EFFECT

psychology

Reduce cognitive load

Smoothly scalable architecture. When designing organizational structures or rules, consider future 'scaling'. A good system (like consistent hashing) minimizes disruption to existing systems when adding new people or departments, without needing to start over.

anchor

Anchor fast decisions

Map both nodes and data keys onto a circular hash space. When nodes are added or removed, only the data in the affected range is reassigned to adjacent nodes, reducing the rebalancing cost from O(N) to O(K/N).

MINIMUM ACTION

In progress 0/1

Practice this model in one real situation:

Choose a hash function to map nodes and keys onto the ring. 2. Assign each key to the first node encountered clockwise. 3. When adding or removing nodes, only migrate keys in the affected interval. 4. Use virtual nodes to smooth load distribution.

Check to track your progress (stored locally)

Learning progress0%

account_treeGenealogyexpand_more

menu_bookReferencesexpand_more

Source support: Explicit

link
zh.wikipedia.orghttps://zh.wikipedia.org/wiki/%E4%B8%80%E8%87%B4%E5%93%88%E5%B8%8CZH · Explicit
verified

RELATED MODELS