184 search results - page 2 / 37 » Efficient Range Query Retrieval for Non-Uniform Data Distrib... |
GIR
2006
ACM
13 years 11 months ago
2006
ACM
In this paper, we present a novel indexing data structure called RDHT (Range capable Distributed Hash Table) derived from skip lists and specifically designed for storing and retr...
EDBT
2006
ACM
13 years 7 months ago
2006
ACM
We consider the conflicting problems of ensuring data-access load balancing and efficiently processing range queries on peer-to-peer data networks maintained over Distributed Hash ...
P2P
2008
IEEE
13 years 11 months ago
2008
IEEE
Unstructured peer-to-peer infrastructure has been widely employed to support large-scale distributed applications. Many of these applications, such as locationbased services and m...
NBIS
2007
Springer
13 years 11 months ago
2007
Springer
Range queries, retrieving all keys within a given range, is an important add-on for Distributed Hash Tables (DHTs), as they rely only on exact key matching lookup. In this paper we...
VLDB
2007
ACM
14 years 5 months ago
2007
ACM
This paper addresses the efficient processing of similarity queries in metric spaces, where data is horizontally distributed across a P2P network. The proposed approach does not r...