Apa iku consistent hashing?

Question

Accepted Answer

**Consistent hashing** yaiku teknik kanggo ngebagekake data ing saindhenging node (server) sing **nyilisir redistribusi nalika node ditambah utawa dicopot** — beda karo simple hashing, kang ngaremap akeh kunci nalika jumlah node owah. Iki penting kanggo distributed caches, databases, lan distribusi beban.

## Masalah karo simple hashing

```text
Simple approach: node = hash(key) % N  (N = number of nodes)
  ✗ when N CHANGES (add/remove a node), N changes → MOST keys remap to different nodes →
    massive data movement / cache invalidation (almost everything moves!)
→ adding/removing a server causes huge disruption → bad for dynamic distributed systems.
```

## Cara consistent hashing gumawa

```text
Map both NODES and KEYS onto a HASH RING (a circle of hash values):
  → a key belongs to the FIRST node clockwise from it on the ring
  → adding/removing a node only affects keys in ONE segment of the ring (its neighbors) →
    only a SMALL fraction of keys move (≈ K/N, not most of them)
→ minimal redistribution when nodes change → much better for dynamic systems.
```

## Virtual nodes lan panggunaane

```text
✓ VIRTUAL NODES → each physical node maps to MANY points on the ring → EVEN distribution
  (avoids uneven load from few nodes/uneven placement) → handles heterogeneous capacity
USES:
  → distributed CACHES (e.g. memcached clusters) — add/remove cache nodes without mass
    invalidation
  → distributed DATABASES (Cassandra, DynamoDB) — partition data across nodes
  → load balancers; any system distributing data/load across a changing set of nodes
```

## Kenapa iki penting

Memahami consistent hashing yaiku kawruh tingkat senior sing berharga amarga iku **teknik dasar kanggo ngebagekake data ing sistem distribuir dinamis**, digunakake ing akeh sistem nyata, mula penting kanggo desain sistem distribuir.

Masalah sing ditangani yaiku nyata lan penting: **simple hashing** (`hash(key) % N`) nyebabake **akeh kunci ngaremap nalika jumlah node owah** (nambah utawa ncopot server ngerakke meh kabeh data — nyebabake gerakan data gedhe utawa invalidasi cache), akeh banget kanggo sistem distribuir dinamis kang node-e ditambah lan dicopot. **Consistent hashing** ngatasi iki karo nemap node lan kunci menyang **hash ring** (kunci ana ing node pisanan mengalur jam-jaman), mula nalika **nambah utawa ncopot node mung gerake fraksi cilik kunci** (sing ana ing segmen ring, ≈ K/N) tinimbang akeh — nyilisir redistribusi lan gangguan nalika set node owah.

Memahami iki — cara ring gumawa lan kenapa iku nyilisir gerakan kunci — yaiku insight kunci.

Memahami **virtual nodes** (nemap saben node fisik menyang akeh ring points kanggo distribusi rata, ngindhari beban ora rata sing dikarepake sawetara node utawa node sing ora ana ing panggonan apik, lan nangani kapasitas heterogen) nggambarake cara consistent hashing gumawa apik ing praktik.

Memahami **panggunaane** — distributed caches (nambah/ncopot cache nodes tanpa invalidasi gedhe), distributed databases (Cassandra, DynamoDB ngebagekake data), lan load balancers — njlentrehake kahantike-ne, amarga iku digunakake ing akeh sistem nyata sing wiyar kagungan.

Consistent hashing yaiku teknik distribuir sistem klasik lan penting sing asring katon ing diskusi desain sistem.

Amarga ngebagekake data ing set node dinamis (karo gangguan minimal nalika node owah) yaiku kabutuhan umum ing sistem distribuir lan consistent hashing ngatasi iku (nalika simple hashing gagal abot), lan amarga iku digunakake ing sistem nyata (distributed caches lan databases) lan memahami iku nggambarake kawruh sistem distribuir, memahami consistent hashing yaiku kawruh berharga tingkat senior — teknik dasar kanggo distribusi data ing sistem distribuir dinamis, digunakake ing akeh caches lan databases nyata, ngatasi masalah redistribusi kunci saka simple hashing, lan konsep klasik distribuir sistem nggambarake kedalaman sing dikarepake kanggo peran senior ngrancang sistem distribuir.