323 search results - page 35 / 65 » Range-capable Distributed Hash Tables |
AINA
2007
IEEE
14 years 2 months ago
2007
IEEE
Distributed Hash Tables (DHTs) are very efficient for querying based on key lookups, if only a small number of keys has to be registered by each individual peer. However, building...
DEXA
2004
Springer
14 years 7 days ago
2004
Springer
The Iceberg SemiJoin (ISJ) of two datasets R and S returns the tuples in R which join with at least k tuples of S. The ISJ operator is essential in many practical applications incl...
NSDI
2004
13 years 10 months ago
2004
Structured peer-to-peer hash tables provide decentralization, self-organization, failure-resilience, and good worst-case lookup performance for applications, but suffer from high ...
ICDE
2008
IEEE
14 years 10 months ago
2008
IEEE
We study the scalable management of XML data in P2P networks based on distributed hash tables (DHTs). We identify performance limitations in this context, and propose an array of t...
PDCAT
2009
Springer
14 years 3 months ago
2009
Springer
An immense amount of information is processed on the Internet due to its spread, increasing the severity of such problems as the disclosure of personal information; privacy protec...