Why it matters

Hopscotch is cache-optimal hash. Understanding shapes performance tuning.

Advertisement

The architecture

Each item within H slots of h(k).

Insert: probe within H; if none, hop existing.

Hopscotch hashingItem at h(k)or nearbyNeighborhood Hsmall windowHoppingmove existing itemsH typically 32; excellent cache behavior; concurrent variants exist
Hopscotch.
Advertisement

How it works end to end

H = 32 typical.

Cache lines fit neighborhood.

Concurrent-friendly.

Load factor high (>90%).