Efficient range queries in spatial databases over Peer-to-Peer Networks
by Ibrahim Kamel, Zaher Al Aghbari, Ahmed Mustafa
International Journal of Internet Protocol Technology (IJIPT), Vol. 4, No. 2, 2009

Abstract: 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.

Online publication date: Mon, 20-Jul-2009

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Internet Protocol Technology (IJIPT):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com