2013 IEEE 27th International Conference on Advanced Information Networking and Applications (AINA) (2009)
Bradford, United Kingdom
May 26, 2009 to May 29, 2009
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/AINA.2009.82
One of the most frequent queries in spatial and mobile databases is range search, which is originated from the construction of R-tree that limits the spatial database application to Euclidean distance. Nowadays, Geographic Information System (GIS) demands the applications to be practicable for factual distance, normally identified as network distance. Even though some algorithms are engaged in this area, network distance range search is still a time consuming and storage space occupation task. In this paper, we propose a novel approach which is based on Network Voronoi Diagram that is diffusely used in geometrical analysis. We are looking into how to improve the performance of range search query processing using Network Voronoi Diagram.
Spatial Query Processing, Voronoi Diagram, Mobile Query Processing, Spatial Databases, Mobile Databases, Query Processing
David Taniar, Geng Zhao, Bala Srinivasan, Maytham Safar, Kefeng Xuan, Marina Gavrilova, "Network Voronoi Diagram Based Range Search", 2013 IEEE 27th International Conference on Advanced Information Networking and Applications (AINA), vol. 00, no. , pp. 741-748, 2009, doi:10.1109/AINA.2009.82