Sciweavers

1080 search results - page 68 / 216
» Distributed Hash Tables
Sort
View
WCW
2004
Springer
15 years 10 months ago
ShortCuts: Using Soft State to Improve DHT Routing
Distributed hash tables are increasingly being proposed as the core substrate for content delivery applications in the Internet, such as cooperative Web caches, Web index and sear...
Kiran Tati, Geoffrey M. Voelker
SPAA
2006
ACM
15 years 11 months ago
Towards a scalable and robust DHT
The problem of scalable and robust distributed data storage has recently attracted a lot of attention. A common approach in the area of peer-to-peer systems has been to use a dist...
Baruch Awerbuch, Christian Scheideler
VLDB
1990
ACM
118views Database» more  VLDB 1990»
15 years 9 months ago
Distributed Linear Hashing and Parallel Projection in Main Memory Databases
This paper extends the conceptsof the distributed linear hashedmain memory file system with the objective of supportinghigher level parallel dambaseoperations. The basicdistribute...
Charles Severance, Sakti Pramanik, P. Wolberg
137
Voted
FODO
1993
Springer
147views Algorithms» more  FODO 1993»
15 years 9 months ago
Design and Implementation of DDH: A Distributed Dynamic Hashing Algorithm
Abstract. DDH extends the idea of dynamic hashing algorithms to distributed systems. DDH spreads data across multiple servers in a network using a novel autonomous location discove...
Robert Devine
142
Voted
JUCS
2008
117views more  JUCS 2008»
15 years 5 months ago
Eliminating Cycles in Weak Tables
: Weak References constitute an elegant mechanism for an application to interact with its garbage collector. In most of its typical uses, weak references are used through weak tabl...
Alexandra Barros, Roberto Ierusalimschy