Sciweavers

84 search results - page 3 / 17
» D1HT: a distributed one hop hash table
Sort
View
ICDE
2012
IEEE
277views Database» more  ICDE 2012»
11 years 8 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,...
GLOBECOM
2008
IEEE
14 years 6 days ago
A Dynamic Load-Balanced Hashing Scheme for Networking Applications
Abstract—Network applications often require large data storage resources, fast queries, and frequent updates. Hash tables support these operations with low costs, yet they cannot...
N. Sertac Artan, Haowei Yuan, H. Jonathan Chao
GLOBECOM
2007
IEEE
14 years 2 days ago
Bridging Distributed Hash Tables in Wireless Ad-Hoc Networks
—The adaptation of structured P2P networks, i.e. Distributed Hash Tables (DHTs), to wireless ad-hoc networks has been investigated in recent years. Existing work assume all peers...
Lawrence Cheng
PODC
2003
ACM
13 years 11 months ago
Routing networks for distributed hash tables
Routing topologies for distributed hashing in peer-to-peer networks are classified into two categories: deterministic and randomized. A general technique for constructing determi...
Gurmeet Singh Manku
P2P
2006
IEEE
101views Communications» more  P2P 2006»
13 years 11 months ago
Towards Scalable Mobility in Distributed Hash Tables
For the use in the Internet domain, distributed hash tables (DHTs) have proven to be an efficient and scalable approach to distributed content storage and access. In this paper, ...
Olaf Landsiedel, Stefan Götz, Klaus Wehrle