Distributed Hash Table

From NovaOrdis Knowledge Base
Revision as of 18:20, 26 August 2018 by Ovidiu (talk | contribs) (→‎Overview)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

External

Internal

Overview

Get a number of nodes. Distribute data on nodes. Naive approach is to use hash(k) mod n, where n is the number of computers. Better is to use consistent hashing.

Consistent Hashing

TODO Consistent_Hashing