Distributed Hash Table: Difference between revisions

From NovaOrdis Knowledge Base
Jump to navigation Jump to search
 
(3 intermediate revisions by the same user not shown)
Line 1: Line 1:
=External=
* https://en.wikipedia.org/wiki/Distributed_hash_table
* https://www.coursera.org/lecture/data-structures/distributed-hash-tables-tvH8H
=Internal=
=Internal=


Line 5: Line 10:


=Overview=
=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=
=Consistent Hashing=


<font color=darkgray>TODO [[Consistent_Hashing]]</font>
<font color=darkgray>TODO [[Consistent_Hashing]]</font>

Latest revision as of 18:20, 26 August 2018

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