Encyclopedia of Database Systems

2018 Edition
| Editors: Ling Liu, M. Tamer Özsu

Distributed Hash Table

  • Wojciech GalubaEmail author
Reference work entry
DOI: https://doi.org/10.1007/978-1-4614-8265-9_1232




A Distributed Hash Table (DHT) is a decentralized system that provides the functionality of a hash table, i.e., insertion and retrieval of key-value pairs. Each node in the system stores a part of the hash table. The nodes are interconnected in a structured overlay network, which enables efficient delivery of the key lookup and key insertion requests from the requestor to the node storing the key. To guarantee robustness to arrivals and departures of nodes, the overlay network topology is maintained and the key-value pairs are replicated to several nodes.

Key Points

Every DHT defines its key space. For example, in many DHTs the keys are 160-bit integers, which is the output of the popular SHA1 hash function. Each node in the system has a specific location in the key space and stores the key-value pairs that are close to that location. The different DHT systems vary in the exact algorithms for deciding which node should store which key [2].

The DHT relies on a...

This is a preview of subscription content, log in to check access.

Recommended Reading

  1. 1.
    Rhea SC, Geels D, Roscoe T, Kubiatowicz J. Handling churn in a DHT. In: Proceedings of the USENIX 2004 Annual Technical Conference; 2004. p. 127–40.Google Scholar
  2. 2.
    Risson J, Moors T. Survey of research towards robust peer-to-peer networks: search methods. Comput Netw. 2006;50(17):3485–521.CrossRefzbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.EPFLLausanneSwitzerland

Section editors and affiliations

  • Karl Aberer
    • 1
  1. 1.Distributed Inf. Sys Lab.Inst. for Core Computing Science (IIF), EPFL-IC-IIF-LSIRLausanneSwitzerland