Sciweavers

29 search results - page 1 / 6
» Incrementally improving lookup latency in distributed hash t...
Sort
View
SIGMETRICS
2003
ACM
119views Hardware» more  SIGMETRICS 2003»
13 years 9 months ago
Incrementally improving lookup latency in distributed hash table systems
Distributed hash table (DHT) systems are an important class of peer-to-peer routing infrastructures. They enable scalable wide-area storage and retrieval of information, and will ...
Hui Zhang 0002, Ashish Goel, Ramesh Govindan
ICDE
2012
IEEE
277views Database» more  ICDE 2012»
11 years 6 months ago
Lookup Tables: Fine-Grained Partitioning for Distributed Databases
—The standard way to scale a distributed OLTP DBMS is to horizontally partition data across several nodes. Ideally, this results in each query/transaction being executed at just ...
Aubrey Tatarowicz, Carlo Curino, Evan P. C. Jones,...
P2P
2007
IEEE
132views Communications» more  P2P 2007»
13 years 10 months ago
The Design and Evaluation of Techniques for Route Diversity in Distributed Hash Tables
To achieve higher efficiency over their unstructured counterparts, structured peer-to-peer systems hold each node responsible for serving a specified set of keys and correctly r...
Cyrus Harvesf, Douglas M. Blough
NSDI
2010
13 years 5 months ago
Cheap and Large CAMs for High Performance Data-Intensive Networked Systems
We show how to build cheap and large CAMs, or CLAMs, using a combination of DRAM and flash memory. These are targeted at emerging data-intensive networked systems that require mas...
Ashok Anand, Chitra Muthukrishnan, Steven Kappes, ...
GLOBECOM
2009
IEEE
13 years 11 months ago
Peer-to-Peer Single Hop Distributed Hash Tables
Abstract—Efficiently locating information in large-scale distributed systems is a challenging problem to which Peer-to-Peer (P2P) Distributed Hash Tables (DHTs) can provide a hi...
Luiz Rodolpho Monnerat, Cláudio L. Amorim