Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Efficient Evaluation of Continuous Range Queries on Moving Objects
DEXA '02 Proceedings of the 13th International Conference on Database and Expert Systems Applications
Flexible Information Discovery in Decentralized Distributed Systems
HPDC '03 Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing
A scalable content-addressable network
A scalable content-addressable network
Load balancing and locality in range-queriable data structures
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Spatial Data Query Support in Peer-to-Peer Systems
COMPSAC '04 Proceedings of the 28th Annual International Computer Software and Applications Conference - Workshops and Fast Abstracts - Volume 02
An Adaptive Protocol for Efficient Support of Range Queries in DHT-Based Systems
ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
Proceedings of the 12th annual ACM international workshop on Geographic information systems
P2PR-Tree: an R-tree-based spatial index for peer-to-peer environments
EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology
Efficient range queries in spatial databases over Peer-to-Peer Networks
International Journal of Internet Protocol Technology
Scalable spatial information discovery over Distributed Hash Tables
Proceedings of the Fourth International ICST Conference on COMmunication System softWAre and middlewaRE
Distributed continuous range query processing on moving objects
DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications
| Hi-index | 0.00 |
Geographic Information Systems (GIS) are increasingly managing very large sets of data and hence a centralized data repository may not always provide the most scalable solution. Here we introduce a novel approach to manage spatial data by leveraging structured Peer-to-Peer (P2P) systems based on Distributed Hash Tables (DHTs). DHT algorithms provide efficient exact-match object search capabilities without requiring global indexing and as a result they are extremely scalable. Furthermore, the adoption of uniform hash functions ensures excellent load balancing. However, range queries -- which are very common with spatial data -- cannot be executed efficiently because the hash functions unfortunately destroy any existing data locality. Here we report on the design of an Adaptive Spatial Peer-to-pEer Network (ASPEN) that extends Content Addressable Networks (CAN) to preserve spatial locality information while also retaining many of the load balancing properties of DHT systems. We introduce the concept of scatter regions, which are spatial data distribution units that optimize both load balancing and spatial range query processing at the same time. We present a data object key generation function and algorithms for spatial range queries. We rigorously evaluate our technique with both synthetic and real world data sets and the results demonstrate the efficient execution of spatial range queries in the ASPEN system.