Spatial Data Query Support in Peer-to-Peer Systems

  • Authors:
  • Roger Zimmermann;Wei-Shinn Ku;Haojun Wang

  • Affiliations:
  • University of Southern California;University of Southern California;University of Southern California

  • Venue:
  • COMPSAC '04 Proceedings of the 28th Annual International Computer Software and Applications Conference - Workshops and Fast Abstracts - Volume 02
  • Year:
  • 2004

Quantified Score

Hi-index 0.01

Visualization

Abstract

Recently distributed hash table (DHT) mechanisms have been proposed to manage data in very large, structured peer-to-peer (P2P) systems. DHT algorithms provide efficient exact-match object search capabilities without requiring global indexing and are hence extremely scalable. However, range queries 驴 which are very common with spatial data 驴 cannot be executed efficiently in these systems because the adoption of uniform hash functions to ensure excellent load balancing unfortunately destroys any existing data locality. In this report we propose a novel technique to preserve spatial locality information while also keeping some of the load balancing properties of DHT based systems. We describe our design as an extension of content-addressable networks (CAN) and illustrate the feasibility of supporting spatial range queries.