Distributed Hash Table: Difference between revisions
Jump to navigation
Jump to search
| Line 11: | Line 11: | ||
=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. | 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
- https://en.wikipedia.org/wiki/Distributed_hash_table
- https://www.coursera.org/lecture/data-structures/distributed-hash-tables-tvH8H
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