All Questions
Consistent Hashing easy

What primary inefficiency in traditional 'Modulo Hashing' (key % N) does Consistent Hashing address?

  1. A The occurrence of hash collisions where two distinct keys unfortunately generate the same underlying hash value.
  2. B The massive data reshuffling (resharding) required whenever a node is added or removed, which invalidates existing caches.
  3. C The fundamental inability to utilize string-based keys; Modulo arithmetic strictly requires integer inputs for calculation.
  4. D The excessive CPU utilization and computational overhead consumed during the initial hashing calculation phase.

One system design question a day, with spaced repetition so the ones you miss come back.

Get the app

Related questions