Efficient Range Queries in Spatial Databases over Peer-to-Peer Networks

/ Matt Artz

International Journal of Internet Protocol Technology, 2009 – Vol. 4, No.2 pp. 79 – 90

Ibrahim Kamel, Zaher Al Aghbari, and Ahmed Mustafa

“Peer-to-Peer (P2P) network, e.g., Chord, is designed mainly for one-dimensional data retrieval and point queries. Multimedia and spatial applications require efficient execution of range queries. This paper proposes an efficient scheme to support range query over Chord while balancing the storage load. The paper proposes a rotating token scheme that places the joining nodes in appropriate locations to share loads with overloaded nodes. To support range queries, we utilise an order-preserving mapping function to map keys to nodes in an order preserving manner. Simulation experiments show significant gain in storage load balancing and the performance of range queries over Chord.”

One thought on “Efficient Range Queries in Spatial Databases over Peer-to-Peer Networks”

  1. Pingback: Tweets that mention Efficient Range Queries in Spatial Databases over Peer-to-Peer Networks « GIS and Science -- Topsy.com

Comments are closed.