323 search results - page 2 / 65 » Range-capable Distributed Hash Tables |
ICDE
2012
IEEE
11 years 7 months ago
2012
IEEE
—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 ...
SIGCOMM
2005
ACM
13 years 10 months ago
2005
ACM
Hash table is used as one of the fundamental modules in several network processing algorithms and applications such as route lookup, packet classification, per-flow state manage...
LCN
2006
IEEE
13 years 10 months ago
2006
IEEE
Structured Peer-to-Peer systems are designed for a highly scalable, self organizing, and efficient lookup for data. The key space of the so-called Distributed Hash Tables (DHTs) ...
KIVS
2005
Springer
13 years 10 months ago
2005
Springer
: We develop a model for the distribution of nodes in ring-based DHTs like Chord that position nodes randomly or based on hash-functions. As benefit of our model we get the distri...
SAINT
2008
IEEE
13 years 11 months ago
2008
IEEE