The Community for Technology Leaders
Computer Science and Information Engineering, World Congress on (2009)
Los Angeles, California USA
Mar. 31, 2009 to Apr. 2, 2009
ISBN: 978-0-7695-3507-4
pp: 535-541
One of the most important kinds of queries in Spatial Network Databases (SNDB) to support location-based services (LBS) is the shortest path query. Given an object in a network, e.g. a location of a car on a road network, and a set of objects of interests, e.g. hotels, gas station, car, etc., the k-NN query returns the k nearest neighbors from the query object to interested objects. This paper proposes a k-NN algorithm with a set of index structures to support the situation of moving objects. This algorithm can transform a dynamic problem to a static problem. In this paper we focus on road networks. However, our algorithms do not use any domain specific information, and therefore can be applied to any network. This algorithm's complexity is O(i2log2i), and traditional Dijkstra's complexity is O(i2 (i+n)2).
Moving object, spatial network databases, distance index, k-NN

J. Li, Z. Ding and X. Yin, "Moving Continuous K Nearest Neighbor Queries in Spatial Network Databases," 2009 WRI World Congress on Computer Science and Information Engineering, CSIE(CSIE), Los Angeles, CA, 2009, pp. 535-541.
89 ms
(Ver 3.3 (11022016))