Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Distance browsing in spatial databases
ACM Transactions on Database Systems (TODS)
CCAM: A Connectivity-Clustered Access Method for Networks and Network Computations
IEEE Transactions on Knowledge and Data Engineering
Indexing the Trajectories of Moving Objects in Networks*
Geoinformatica
An efficient and scalable approach to CNN queries in a road network
VLDB '05 Proceedings of the 31st 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
Voronoi-based K nearest neighbor search for spatial network databases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
The islands approach to nearest neighbor querying in spatial networks
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
Monitoring Aggregate k-NN Objects in Road Networks
SSDBM '08 Proceedings of the 20th international conference on Scientific and Statistical Database Management
Generalized network Voronoi diagrams: Concepts, computational methods, and applications
International Journal of Geographical Information Science
Two-site Voronoi diagrams in geographic networks
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Computing isochrones in multi-modal, schedule-based transport networks
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
GPU-based computation of distance functions on road networks with applications
Proceedings of the 2009 ACM symposium on Applied Computing
Continually answering constraint k-NN queries in unstructured P2P systems
Journal of Computer Science and Technology
Distributed, concurrent range monitoring of spatial-network constrained mobile objects
SSTD'07 Proceedings of the 10th international conference on Advances in spatial and temporal databases
Efficient successor retrieval operations for aggregate query processing on clustered road networks
Information Sciences: an International Journal
Defining isochrones in multimodal spatial networks
Proceedings of the 20th ACM international conference on Information and knowledge management
Round-trip voronoi diagrams and doubling density in geographic networks
Transactions on Computational Science XIV
Scalable computation of isochrones with network expiration
SSDBM'12 Proceedings of the 24th international conference on Scientific and Statistical Database Management
Saturn: a fast keyword kNN search system in road networks
WAIM'13 Proceedings of the 14th international conference on Web-Age Information Management
| Hi-index | 0.00 |
One of the most important kinds of queries in Spatial Network Databases (SNDB) to support Location-Based Services (LBS) is the k-Nearest Neighbors (k-NN) query. Given a point in a network, e.g. a location of a car on a road network, and a set of points of interests, e.g. hotels, gas stations, etc., the k-NN query returns the k points of interest closest to the query point. The network distance is used in such a query instead of the Euclidean distance. Dijkstra's algorithm is a well known solution to this problem. In this paper, we propose a storage schema with a set of index structures to support an efficient execution of a slightly modified version of the Dijkstra's algorithm. We show in an experimental evaluation with generated data sets that our proposal is more efficient than the state-of-the-art solution to this problem.