Title: Continuous range search based on network Voronoi diagram

Authors: Kefeng Xuan, Geng Zhao, David Taniar, Bala Srinivasan, Maytham Safar, Marina Gavrilova

Addresses: Clayton School of Information Technology, Monash University, Australia. ' Clayton School of Information Technology, Monash University, Australia. ' Clayton School of Information Technology, Monash University, Australia. ' Clayton School of Information Technology, Monash University, Australia. ' Department of Computer Engineering, Kuwait University, Kuwait. ' Department of Computer Science, University of Calgary, Calgary, Canada

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.

Keywords: mobile navigation; GIS; geographic information systems; NVD; network Voronoi diagram; continuous range search; road networks; GPS; global positioning systems.

DOI: 10.1504/IJGUC.2009.027922

International Journal of Grid and Utility Computing, 2009 Vol.1 No.4, pp.328 - 335

Available online: 18 Aug 2009 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article