"분산 해시 테이블"의 두 판 사이의 차이
둘러보기로 가기
검색하러 가기
Pythagoras0 (토론 | 기여) (→메타데이터: 새 문단) |
Pythagoras0 (토론 | 기여) |
||
| 18번째 줄: | 18번째 줄: | ||
<references /> | <references /> | ||
| − | == 메타데이터 == | + | ==메타데이터== |
| − | |||
===위키데이터=== | ===위키데이터=== | ||
* ID : [https://www.wikidata.org/wiki/Q863506 Q863506] | * ID : [https://www.wikidata.org/wiki/Q863506 Q863506] | ||
| + | ===Spacy 패턴 목록=== | ||
| + | * [{'LOWER': 'distributed'}, {'LOWER': 'hash'}, {'LEMMA': 'table'}] | ||
| + | * [{'LEMMA': 'DHT'}] | ||
2021년 2월 17일 (수) 01:41 기준 최신판
관련된 항목들
노트
- 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
메타데이터
위키데이터
- ID : Q863506
Spacy 패턴 목록
- [{'LOWER': 'distributed'}, {'LOWER': 'hash'}, {'LEMMA': 'table'}]
- [{'LEMMA': 'DHT'}]