Proceedings of the 12th annual ACM international workshop on Geographic information systems
A Scalable P2P Platform for the Knowledge Grid
IEEE Transactions on Knowledge and Data Engineering
Distributed cache table: efficient query-driven processing of multi-term queries in P2P networks
P2PIR '06 Proceedings of the international workshop on Information retrieval in peer-to-peer networks
CISS: An efficient object clustering framework for DHT-based peer-to-peer applications
Computer Networks: The International Journal of Computer and Telecommunications Networking
Using a distributed quadtree index in peer-to-peer networks
The VLDB Journal — The International Journal on Very Large Data Bases
Subrange Caching: Handling Popular Range Queries in DHTs
Globe '08 Proceedings of the 1st international conference on Data Management in Grid and Peer-to-Peer Systems
eSciGrid: A P2P-based e-science Grid for scalable and efficient data sharing
Future Generation Computer Systems
PRoBe: multi-dimensional range queries in p2p networks
WISE'05 Proceedings of the 6th international conference on Web Information Systems Engineering
CISS: an efficient object clustering framework for DHT-Based peer-to-peer applications
DBISP2P'04 Proceedings of the Second international conference on Databases, Information Systems, and Peer-to-Peer Computing
Efficient processing of XPath queries with structured overlay networks
OTM'05 Proceedings of the 2005 OTM Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, COA, and ODBASE - Volume Part II
| Hi-index | 0.00 |
Peer-to-peer computing paradigm is emerging as a scalable and robust model for sharing media objects. In this paper, we propose an architecture and describe the associated algorithms and data structures to support the execution of range selection queries over data scattered across a P2P network especially for resource discovery in grid environments.We develop a distributed data structure referred to as a range addressable network that provides the following two quality-of-service guarantees: (i) the located peer is one with the smallest superset of the query range (important from the application perspective), and (ii) in a P2P network of n peers, a query is routed through O(log n) peers before the intended peer is found (important from the system perspective).Our preliminary experimental evaluation indicates that the range addressable network has desirable properties of scalability and load-balancing, which are crucial for the success of a large-scale P2P system.