The Community for Technology Leaders
Green Image
Issue No. 07 - July (2012 vol. 24)
ISSN: 1041-4347
pp: 1201-1215
Sarana Nutanong , University of Maryland, College Park
Egemen Tanin , University of Melbourne, Victoria and NICTA Victoria Research Laboratory
Jie Shao , University of Melbourne, Victoria
Rui Zhang , University of Melbourne, Victoria
Kotagiri Ramamohanarao , University of Melbourne, Victoria and NICTA Victoria Research Laboratory
We study the problem of finding the shortest route between two locations that includes a stopover of a given type. An example scenario of this problem is given as follows: “On the way to Bob's place, Alice searches for a nearby take-away Italian restaurant to buy a pizza.” Assuming that Alice is interested in minimizing the total trip distance, this scenario can be modeled as a query where the current Alice's location (start) and Bob's place (destination) function as query points. Based on these two query points, we find the minimum detour object (MDO), i.e., a stopover that minimizes the sum of the distances: 1) from the start to the stopover, and 2) from the stopover to the destination. In a realistic location-based application environment, a user can be indecisive about committing to a particular detour option. The user may wish to browse multiple (k) MDOs before making a decision. Furthermore, when a user moves, the k{\rm MDO} results at one location may become obsolete. We propose a method for continuous detour query (CDQ) processing based on incremental construction of a shortest path tree. We conducted experimental studies to compare the performance of our proposed method against two methods derived from existing k-nearest neighbor querying techniques using real road-network data sets. Experimental results show that our proposed method significantly outperforms the two competitive techniques.
Continuous queries, spatial network, spatial databases.

R. Zhang, J. Shao, E. Tanin, K. Ramamohanarao and S. Nutanong, "Continuous Detour Queries in Spatial Networks," in IEEE Transactions on Knowledge & Data Engineering, vol. 24, no. , pp. 1201-1215, 2011.
83 ms
(Ver 3.3 (11022016))