"분산 해시 테이블"의 두 판 사이의 차이

수학노트
둘러보기로 가기 검색하러 가기
(→‎노트: 새 문단)
 
 
(같은 사용자의 중간 판 2개는 보이지 않습니다)
1번째 줄: 1번째 줄:
 +
==관련된 항목들==
 +
* [[카뎀리아]]
 +
* [[비트토렌트]]
 +
 +
 +
 
== 노트 ==
 
== 노트 ==
  
11번째 줄: 17번째 줄:
 
===소스===
 
===소스===
 
  <references />
 
  <references />
 +
 +
==메타데이터==
 +
===위키데이터===
 +
* 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]

소스

  1. ↑ Applying Kademlia Distributed Hash Table to Libplanet
  2. ↑ Distributed Hash Tables
  3. ↑ Distributed hash table based ID management optimization for internet of things
  4. ↑ Chord: Building a DHT (Distributed Hash Table) in Golang
  5. ↑ 5.0 5.1 What Is a Distributed Hash Table?
  6. ↑ 6.0 6.1 4. Distributed Hash Tables: Architecture and Implementation

메타데이터

위키데이터

Spacy 패턴 목록

  • [{'LOWER': 'distributed'}, {'LOWER': 'hash'}, {'LEMMA': 'table'}]
  • [{'LEMMA': 'DHT'}]
원본 주소 "https://wiki.mathnt.net/index.php?title=분산_해시_테이블&oldid=51492"