https://nalar.dev/tags/data-placement/ Recent content in Data Placement on Nalar Hugo en-us Sun, 20 Sep 2026 00:00:00 +0000 https://nalar.dev/rendezvous-hashing-keeps-key-placement-stable-as-nodes-change/ Sun, 20 Sep 2026 00:00:00 +0000 https://nalar.dev/rendezvous-hashing-keeps-key-placement-stable-as-nodes-change/ <h1 id="rendezvous-hashing-keeps-key-placement-stable-as-nodes-change">Rendezvous Hashing Keeps Key Placement Stable as Nodes Change</h1> <p>Distributed systems often need a deterministic answer to a placement question: given a key and a current set of nodes, which node owns the key? A simple modulo rule such as <code>hash(key) % N</code> is compact, but changing <code>N</code> can move a large fraction of keys at once.</p> <p>Rendezvous hashing, also called highest-random-weight hashing, uses a different rule. For each key, it computes a deterministic score for every eligible node and selects the node with the highest score. Adding or removing a node changes placement only for keys whose ranking is affected by that membership change.</p>