LearnViz CompSci
Home / Learn / Distributed Systems & Cloud / Distributed Hash Tables

Intermediate Topic 28 of 51 Distributed Systems & Cloud

Distributed Hash Tables

Decentralized key lookup across peers.

How it works

A distributed hash table provides a lookup service in which key-value pairs are spread over many nodes, with each node responsible for a portion of the key space and each key found in a small number of hops. Protocols such as Chord arrange nodes on a ring with finger tables for O(log n) lookups, Kademlia uses XOR distance and k-buckets, and Pastry and CAN use other geometries. Nodes join, leave and fail without central coordination, and replication stores keys on several nodes.

Where it is used

BitTorrent trackerless peer discovery, IPFS, Ethereum node discovery and some decentralized storage and naming systems use DHTs. Dynamo-style stores borrow related ideas.

Common pitfall

Churn requires continuous stabilization and replication. Malicious nodes can attack routing through Sybil and eclipse attacks, needing identity costs or verification. Lookup latency depends on the number of hops over the wide-area network. Load balancing needs virtual nodes. DHTs support exact-match lookups, not range queries.

Where it fits in the course

Distributed Hash Tables is topic 28 of 51 in Distributed Systems & Cloud, rated Intermediate. It follows Consistent Hashing. The next topic is Gossip Protocols.

Practice and explore

How to study this topic

  1. Read the explanation above and restate the definition in your own words.
  2. Open the interactive lesson and answer its mini quiz.
  3. Read the common pitfall, then write a short example that avoids it.
  4. Check your understanding in the Distributed Systems & Cloud quiz, and revisit the topic if you miss a question.

Frequently asked questions

What is Distributed Hash Tables?
Decentralized key lookup across peers. It belongs to Distributed Systems & Cloud and is an intermediate-level topic.
Where do people use Distributed Hash Tables?
BitTorrent trackerless peer discovery, IPFS, Ethereum node discovery and some decentralized storage and naming systems use DHTs.
What is the most common mistake with Distributed Hash Tables?
Churn requires continuous stabilization and replication.
What should I learn before this topic?
Start with Consistent Hashing, the topic just before it in Distributed Systems & Cloud.
How can I practice it?
Answer the mini quiz in the interactive lesson, then take the Distributed Systems & Cloud quiz. You can also explore Hash Table in the Visual Lab.
Is Distributed Hash Tables hard to learn?
It is an Intermediate topic. Be comfortable with the Beginner topics in this area first, then read the common pitfall carefully, since it is where most mistakes happen.
How long does it take to learn Distributed Hash Tables?
Most learners can read the explanation and finish the interactive lesson in under an hour. Fluency comes from applying the idea, so plan a few short practice sessions with the quiz.
Which topics are related to Distributed Hash Tables?
Consistent Hashing, Gossip Protocols, Saga Pattern are closely connected. The full list is in the related topics section of this page.
What should I study after Distributed Hash Tables?
Continue with Gossip Protocols, the next topic in Distributed Systems & Cloud.

Related topics