Spatial tessellations: concepts and applications of Voronoi diagrams
Spatial tessellations: concepts and applications of Voronoi diagrams
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Distance-based indexing for high-dimensional metric spaces
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Optimal multi-step k-nearest neighbor search
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Distance browsing in spatial databases
ACM Transactions on Database Systems (TODS)
Closest pair queries in spatial databases
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Indexing the positions of continuously moving objects
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Spatial databases with application to GIS
Spatial databases with application to GIS
A road network embedding technique for k-nearest neighbor search in moving object databases
Proceedings of the 10th ACM international symposium on Advances in geographic information systems
An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps
IEEE Transactions on Knowledge and Data Engineering
Fast Nearest Neighbor Search in High-Dimensional Space
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Indexing the Distance: An Efficient Method to KNN Processing
Proceedings of the 27th International Conference on Very Large Data Bases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Fast Nearest Neighbor Search in Medical Image Databases
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
K-Nearest Neighbor Search for Moving Query Point
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Continuous nearest neighbor search
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Query processing in spatial network databases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
An efficient weighted nearest neighbour classifier using vertical data representation
International Journal of Business Intelligence and Data Mining
Content-based personalised recommendation in virtual shopping environment
International Journal of Business Intelligence and Data Mining
PINE-guided cache replacement policy for location-dependent data in mobile environment
Proceedings of the 1st international conference on PErvasive Technologies Related to Assistive Environments
On Mining Movement Pattern from Mobile Users
International Journal of Distributed Sensor Networks - Heterogenous Wireless Ad Hoc and Sensor Networks
Two-site Voronoi diagrams in geographic networks
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Continuous range search based on network Voronoi diagram
International Journal of Grid and Utility Computing
Multiple Object Types KNN Search Using Network Voronoi Diagram
ICCSA '09 Proceedings of the International Conference on Computational Science and Its Applications: Part II
Voronoi-based range and continuous range query processing in mobile databases
Journal of Computer and System Sciences
Approximate static and continuous range search in mobile navigation
Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication
Time constrained range search queries over moving objects in road networks
Proceedings of the 8th International Conference on Advances in Mobile Computing and Multimedia
Path branch points in mobile navigation
Proceedings of the 8th International Conference on Advances in Mobile Computing and Multimedia
Event sharing in vehicular networks using geographic vectors and maps
Mobile Information Systems
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
Round-trip voronoi diagrams and doubling density in geographic networks
Transactions on Computational Science XIV
Hi-index | 0.00 |
A frequent type of query in a car navigation system is to find the k nearest neighbors (kNN) of a given query object (e.g., car) using the actual road network maps. With road networks (spatial networks), the distances between objects depend on their network connectivity and it is computationally expensive to compute the distances (e.g., shortest paths) between objects. In this paper, we propose a novel approach to efficiently and accurately evaluate kNN queries in a mobile information system that uses spatial network databases. The approach uses first order Voronoi diagram and Dijkstra's algorithm. This approach is based on partitioning a large network to small Voronoi regions, and then pre-computing distances across the regions. By performing across the network computation for only the border points of the neighboring regions, we avoid global pre-computation between every object-pair. Our empirical experiments with real-world data sets show that our proposed solution outperforms approaches that are based on on-line distance computation by up to one order of magnitude. In addition, our approach has better response times than approaches that are based on pre-computation.