Voronoi-based range and continuous range query processing in mobile databases
Journal of Computer and System Sciences
Time constrained range search queries over moving objects in road networks
Proceedings of the 8th International Conference on Advances in Mobile Computing and Multimedia
Voronoi-based range query for trajectory data in spatial networks
Proceedings of the 2011 ACM Symposium on Applied Computing
Voronoi-based multi-level range search in mobile navigation
Multimedia Tools and Applications
Optimized skyline queries on road networks using nearest neighbors
Personal and Ubiquitous Computing
Multi-criteria optimization in GIS: continuous k-nearest neighbor search in mobile navigation
ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part I
Probabilistic Voronoi diagrams for probabilistic moving nearest neighbor queries
Data & Knowledge Engineering
Indexing network voronoi diagrams
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part I
| Hi-index | 0.00 |
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.