Continuous range search based on network Voronoi diagram
by Kefeng Xuan, Geng Zhao, David Taniar, Bala Srinivasan, Maytham Safar, Marina Gavrilova
International Journal of Grid and Utility Computing (IJGUC), Vol. 1, No. 4, 2009

Abstract: Due to the boom of GIS and GPS, various queries in spatial and mobile database become hot spot issues nowadays, typically, range search and k nearest neighbour queries. Both problems have undergone extensive development for many years, from focusing on the Euclidean distance to network distance, and from dealing with static objects to moving objects. In every step forward, there have been many literature reports, but only a few have dealt with Continuous Range Search (CRS) query processing. Even though the existing approach to CRS has an acceptable performance, it is still impractical because the query path needs to be segmented. In this paper, we propose a new approach based on network Voronoi diagram for range search, where the query path does not need to be segmented.

Online publication date: Tue, 18-Aug-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 Grid and Utility Computing (IJGUC):
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