distributed hash table

Hello, you have come here looking for the meaning of the word distributed hash table. In DICTIOUS you will not only get to know all the dictionary meanings for the word distributed hash table, but we will also tell you about its etymology, its characteristics and you will know how to say distributed hash table in singular and plural. Everything you need to know about the word distributed hash table you have here. The definition of the word distributed hash table will help you to be more precise and correct when speaking or writing your texts. Knowing the definition ofdistributed hash table, as well as those of other words, enriches your vocabulary and provides you with more and better linguistic resources.

English

English Wikipedia has an article on:
Wikipedia

Noun

distributed hash table (plural distributed hash tables)

  1. (computer science) A decentralised distributed system that performs the functions of a hash table.
    • 1992, Nobuyuki Ichiyoshi, Konighi Komura, Asymptotic Load Balance of Distributed Hash Tables, Institute for New Generation Computer Technology staff (editors), FGCS '92: Fifth Generation Computer Systems 1992, Volume 2, IOS Press, page 869,
      The distributed hash table is a parallelization of the hash table obtained by dividing the table into subtables of equal size and allocating them to the processors. We also discuss communication overheads, and find that, in the case of mesh multicomputers, unless the network channel bandwidth grows sufficiently as p grows, the network will eventually become a performance bottleneck for distributed hash tables.
    • 2006, Theoni Pitoura, Nikos Ntarmos, Peter Triantafillou, Replication, Load Balancing and Efficient Range Query Processing in DHTs, Yannis Ioannidis, Marc H. Scholl, et al. (editors), Advances in Database Technology - EDBT 2006: 10th International Conference, Proceedings, Springer, LNCS 3896, page 131,
      We consider the conflicting problems of ensuring data-access load balancing and efficiently processing range queries on peer-to-peer data networks maintained over Distributed Hash Tables (DHTs).
    • 2008, Zoi Kaoudi, Iris Miliarski, Manolis Koubarakis, RDFS Reasoning and Query Answering on Top of DHTs, Amit Sheth, Steffen Staab, Mike Dean, Massimo Paolucci, Diana Maynard, Timothy Finin, Krishnaprasad Thirunarayan (editors), The Semantic Web - ISWC 2008: 7th International Semantic Web Conference, Proceedings, Springer, LNCS 5318, page 499,
      We study the problem of distributed RDFS reasoning and query answering on top of distributed hash tables. Our goal in this paper is to compare and evaluate two well-known approaches to RFDS reasoning, namely backward and forward chaining, on top of distributed hash tables. We show how to implement both algorithms on top of the distributed hash table Bamboo and prove their correctness.

Synonyms

  • (decentralised distributed system): DHT (initialism)

Translations

Further reading

Wikious
Boobota
Sagapedia