Subscribe
Issue No.05 - May (2013 vol.25)
pp: 1097-1110
Jing Li , University of Hong Kong, Hong Kong
Yin David Yang , Advanced Digital Sciences Center, Singapore
Nikos Mamoulis , University of Hong Kong, Hong Kong
ABSTRACT
Given a set of spatial points $(DS)$, each of which is associated with categorical information, e.g., restaurant, pub, etc., the optimal route query finds the shortest path that starts from the query point (e.g., a home or hotel), and covers a user-specified set of categories (e.g., {pub, restaurant, museum}). The user may also specify partial order constraints between different categories, e.g., a restaurant must be visited before a pub. Previous work has focused on a special case where the query contains the total order of all categories to be visited (e.g., museum $(\rightarrow)$ restaurant $(\rightarrow)$ pub). For the general scenario without such a total order, the only known solution reduces the problem to multiple, total-order optimal route queries. As we show in this paper, this na&#x00EF;ve approach incurs a significant amount of repeated computations, and, thus, is not scalable to large data sets. Motivated by this, we propose novel solutions to the general optimal route query, based on two different methodologies, namely backward search and forward search. In addition, we discuss how the proposed methods can be adapted to answer a variant of the optimal route queries, in which the route only needs to cover a subset of the given categories. Extensive experiments, using both real and synthetic data sets, confirm that the proposed solutions are efficient and practical, and outperform existing methods by large margins.
INDEX TERMS
Scattering, Indexes, Greedy algorithms, Spatial databases, Complexity theory, Electronic mail, Trajectory, spatial databases, Query processing
CITATION
Jing Li, Yin David Yang, Nikos Mamoulis, "Optimal Route Queries with Arbitrary Order Constraints", IEEE Transactions on Knowledge & Data Engineering, vol.25, no. 5, pp. 1097-1110, May 2013, doi:10.1109/TKDE.2012.36
REFERENCES
 [1] S. Asadi, X. Zhou, and G. Yang, "Using Local Popularity of Web Resources for Geo-Ranking of Search Engine Results," World Wide Web, vol. 12, no. 2, pp. 149-170, 2009. [2] A.R. Butz, "Alternative Algorithm for Hilbert's Space-Filling Curve," IEEE Trans. Computers, vol. C-20, no. 4, pp. 424-442, Apr. 1971. [3] X. Cao, G. Cong, and C.S. Jensen, "Retrieving Top-k Prestige-Based Relevant Spatial Web Objects," Proc. VLDB Endowment, vol. 3, no. 1, pp. 373-384, 2010. [4] H. Chen, W.S. Ku, M.T. Sun, and R. Zimmermann, "The Multi-Rule Partial Sequenced Route Query," Proc. 16th ACM SIGSPATIAL Int'l Conf. Advances in Geographic Information Systems (GIS), 2008. [5] Y.Y. Chen, T. Suel, and A. Markowetz, "Efficient Query Processing in Geographic Web Search Engines," Proc. ACM SIGMOD Int'l Conf. Management of Data (SIGMOD), 2006. [6] Z. Chen, H.T. Shen, X. Zhou, Y. Zheng, and X. Xie, "Searching Trajectories by Locations: An Efficiency Study," Proc. ACM SIGMOD Int'l Conf. Management of Data (SIGMOD), 2010. [7] G. Cong, C.S. Jensen, and D. Wu, "Efficient Retrieval of the Top-k Most Relevant Spatial Web Objects," Proc. VLDB Endowment, vol. 2, no. 1, pp. 337-348, 2009. [8] I. De Felipe, V. Hristidis, and N. Rishe, "Keyword Search on Spatial Databases," Proc. IEEE 24th Int'l Conf. Data Eng. (ICDE), 2008. [9] A. Guttman, "R-trees: A Dynamic Index Structure for Spatial Searching," Proc. ACM SIGMOD Int'l Conf. Management of Data (SIGMOD), 1984. [10] F. Li, D. Cheng, M. Hadjieleftheriou, G. Kollios, and S.H. Teng, "On Trip Planning Queries in Spatial Databases," Proc. Ninth Int'l Conf. Advances in Spatial and Temporal Databases (SSTD), 2005. [11] X. Ma, S. Shekhar, H. Xiong, and P. Zhang, "Exploiting a Page-Level Upper Bound for Multi-Type Nearest Neighbor Queries," Proc. 14th ACM SIGSPATIAL Int'l Conf. Advances in Geographic Information Systems (GIS), 2006. [12] D. Martinenghi and M. Tagliasacchi, "Proximity Rank Join," Proc. VLDB Endowment, vol. 3, no. 1, pp. 352-363, 2010. [13] M. Sharifzadeh, M.R. Kolahdouzan, and C. Shahabi, "The Optimal Sequenced Route Query," VLDB J.—Int'l J. Very Large Data Bases, vol. 17, no. 4, pp. 765-787, 2008. [14] D. Wu, M.L. Yiu, C.S. Jensen, and G. Cong, "Efficient Continuously Moving Top-K Spatial Keyword Query Processing," Proc. IEEE 27th Int'l Conf. Data Eng. (ICDE), 2011. [15] M.Y. Yiu, X. Dai, N. Mamoulis, and M. Vaitis, "Top-k Spatial Preference Queries," Proc. IEEE 23rd Int'l Conf. Data Eng. (ICDE), 2007. [16] D. Zhang, Y.M. Chee, A.M.A. Tung, and M. Kitsuregawa, "Keyword Search in Spatial Databases: Towards Searching by Document," Proc. IEEE Int'l Conf. Data Eng. (ICDE), 2009. [17] D. Zhang, B.C. Ooi, and A. Tung, "Locating Mapped Resources in Web 2.0," Proc. Int'l Conf. Data Eng. (ICDE), 2010.