Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.