분산 해시 테이블
노트
- So how does Kademlia implement a distributed hash table?[1]
- In a distributed implementation, known as a distributed hash table, or DHT, the hash table is distributed among a set of nodes.[2]
- Meanwhile, the Distributed Hash Table (DHT) is adopted as the underlying structure to construct the basic UID management methodology.[3]
- In computing, Chord is a protocol and algorithm for a peer-to-peer distributed hash table.[4]
- A Distributed Hash Table is a decentralized data store that looks up data based on key-value pairs.[5]
- Every node in a distributed hash table is responsible for a set of keys and their associated values.[5]
- A distributed hash table provides incremental scalability of throughput and data capacity as more nodes are added to the cluster.[6]
- All components of the distributed hash table are built using an asynchronous, event-driven programming style.[6]
소스
- ↑ Applying Kademlia Distributed Hash Table to Libplanet
- ↑ Distributed Hash Tables
- ↑ Distributed hash table based ID management optimization for internet of things
- ↑ Chord: Building a DHT (Distributed Hash Table) in Golang
- ↑ 5.0 5.1 What Is a Distributed Hash Table?
- ↑ 6.0 6.1 4. Distributed Hash Tables: Architecture and Implementation