The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.07 - July (2012 vol.24)
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
ABSTRACT
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.
INDEX TERMS
Continuous queries, spatial network, spatial databases.
CITATION
Sarana Nutanong, Egemen Tanin, Jie Shao, Rui Zhang, Kotagiri Ramamohanarao, "Continuous Detour Queries in Spatial Networks", IEEE Transactions on Knowledge & Data Engineering, vol.24, no. 7, pp. 1201-1215, July 2012, doi:10.1109/TKDE.2011.52
REFERENCES
[1] P.H. Bloch, N.M. Ridgway, and D.L. Sherrell, "Extending the Concept of Shopping: An Investigation of Browsing Activity," J. Academy of Marketing Science, vol. 17, no. 1, pp. 13-21, 1989.
[2] M. Brown, N. Pope, and K. Voges, "Buying or Browsing?: An Exploration of Shopping Orientations and Online Purchase Intention," European J. Marketing, vol. 37, no. 11, pp. 1666-1684, 2003.
[3] M.A. Cheema, L. Brankovic, X. Lin, W. Zhang, and W. Wang, "Multi-Guarded Safe Zone: An Effective Technique to Monitor Moving Circular Range Queries," Proc. IEEE 26th Int'l Conf. Data Eng. (ICDE), pp. 189-200, 2010.
[4] Z. Chen, H.T. Shen, X. Zhou, and J.X. Yu, "Monitoring Path Nearest Neighbor in Road Networks," Proc. 35th ACM SIGMOD Int'l Conf. Management of Data, pp. 591-602, 2009.
[5] H.-J. Cho and C.-W. Chung, "An Efficient and Scalable Approach to CNN Queries in a Road Network," Proc. 31st Int'l Conf. Very Large Data Bases (VLDB), pp. 865-876, 2005.
[6] A. Corral, Y. Manolopoulos, Y. Theodoridis, and M. Vassilakopoulos, "Closest Pair Queries in Spatial Databases," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 189-200, 2000.
[7] U. Demiryurek, F.B. Kashani, and C. Shahabi, "Efficient Continuous Nearest Neighbor Query in Spatial Networks Using Euclidean Restriction," Proc. 11th Int'l Symp. Advances in Spatial and Temporal Databases (SSTD), pp. 25-43, 2009.
[8] K. Deng, X. Zhou, H.T. Shen, S.W. Sadiq, and X. Li, "Instance Optimal Query Processing in Spatial Networks," VLDB J., vol. 18, no. 3, pp. 675-693, 2009.
[9] E.W. Dijkstra, "A Note on Two Problems in Connection with Graphs," Numeriche Mathematik, vol. 1, pp. 269-271, 1959.
[10] M.R. Kolahdouzan and C. Shahabi, "Voronoi-Based k Nearest Neighbor Search for Spatial Network Databases," Proc. 30th Int'l Conf. Very Large Data Bases (VLDB), pp. 840-851, 2004.
[11] M.R. Kolahdouzan and C. Shahabi, "Alternative Solutions for Continuous k Nearest Neighbor Queries in Spatial Network Databases," GeoInformatica, vol. 9, no. 4, pp. 321-341, 2005.
[12] L. Kulik and E. Tanin, "Incremental Rank Updates for Moving Query Points," Proc. Int'l Conf. Geographic Information Science (GIScience), pp. 251-268, 2006.
[13] F. Li, D. Cheng, M. Hadjieleftheriou, G. Kollios, and S.-H. Teng, "On Trip Planning Queries in Spatial Databases," Proc. Ninth Int'l Symp. Advances in Spatial and Temporal Databases (SSTD '05), pp. 273-290, 2005.
[14] W.W. Moe, "Buying, Searching, or Browsing: Differentiating between Online Shoppers Using in-Store Navigational Clickstream," J. Consumer Psychology, vol. 13, no. 1, pp. 29-39, 2003.
[15] K. Mouratidis, M.L. Yiu, D. Papadias, and N. Mamoulis, "Continuous Nearest Neighbor Monitoring in Road Networks," Proc. 32nd Int'l Conf. Very Large Data Bases (VLDB), pp. 43-54, 2006.
[16] S. Nutanong, R. Zhang, E. Tanin, and L. Kulik, "Analysis and Evaluation of ${\rm V}^{\ast}$ -$k{\rm NN}$ : An Efficient Algorithm for Moving $k{\rm NN}$ Queries," VLDB J., vol. 19, no. 3, pp. 307-332, 2010.
[17] A. Okabe, B. Boots, K. Sugihara, and S.N. Chiu, Spatial Tessellations: Concepts and Applications of Voronoi Diagrams, second ed. Wiley, 2000.
[18] A. Okabe, T. Satoh, T. Furuta, A. Suzuki, and K. Okano, "Generalized Network Voronoi Diagrams: Concepts, Computational Methods, and Applications," Int'l J. Geographical Information Science, vol. 22, no. 9, pp. 965-994, 2008.
[19] D. Papadias, Y. Tao, K. Mouratidis, and C.K. Hui, "Aggregate Nearest Neighbor Queries in Spatial Databases," ACM Trans. Database Systems, vol. 30, no. 2, pp. 529-576, 2005.
[20] D. Papadias, J. Zhang, N. Mamoulis, and Y. Tao, "Query Processing in Spatial Network Databases," Proc. 29th Int'l Conf. Very Large Data Bases (VLDB), pp. 802-813, 2003.
[21] M. Safar, "Group $k$ -Nearest Neighbors Queries in Spatial Network Databases," J. Geographical Systems, vol. 10, no. 4, pp. 407-416, 2008.
[22] H. Samet, J. Sankaranarayanan, and H. Alborzi, "Scalable Network Distance Browsing in Spatial Databases," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 43-54, 2008.
[23] M. Sharifzadeh, M.R. Kolahdouzan, and C. Shahabi, "The Optimal Sequenced Route Query," VLDB J., vol. 17, no. 4, pp. 765-787, 2008.
[24] M. Sharifzadeh and C. Shahabi, "Processing Optimal Sequenced Route Queries Using Voronoi Diagrams," GeoInformatica, vol. 12, no. 4, pp. 411-433, 2008.
[25] R.W. White and D. Morris, "Investigating the Querying and Browsing Behavior of Advanced Search Engine Users," Proc. 30th Ann. Int'l ACM SIGIR Conf. Research and Development in Information Retrieval, pp. 255-262, 2007.
[26] M.L. Yiu, N. Mamoulis, and D. Papadias, "Aggregate Nearest Neighbor Queries in Road Networks," IEEE Trans. Knowledge Data Eng., vol. 17, no. 6, pp. 820-833, June 2005.
[27] J.S. Yoo and S. Shekhar, "In-Route Nearest Neighbor Queries," GeoInformatica, vol. 9, no. 2, pp. 117-137, 2005.
[28] J. Zhang, M. Zhu, D. Papadias, Y. Tao, and D.L. Lee, "Location-Based Spatial Queries," Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 443-454, 2003.
17 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool