Publication 2013 Issue No. 5 - May Abstract - Optimal Route Queries with Arbitrary Order Constraints
 This Article Share Bibliographic References Add to: Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb Search Similar Articles Articles by Jing Li Articles by Yin David Yang Articles by Nikos Mamoulis
Optimal Route Queries with Arbitrary Order Constraints
May 2013 (vol. 25 no. 5)
pp. 1097-1110
 ASCII Text x Jing Li, Yin David Yang, Nikos Mamoulis, "Optimal Route Queries with Arbitrary Order Constraints," IEEE Transactions on Knowledge and Data Engineering, vol. 25, no. 5, pp. 1097-1110, May, 2013.
 BibTex x @article{ 10.1109/TKDE.2012.36,author = {Jing Li and Yin David Yang and Nikos Mamoulis},title = {Optimal Route Queries with Arbitrary Order Constraints},journal ={IEEE Transactions on Knowledge and Data Engineering},volume = {25},number = {5},issn = {1041-4347},year = {2013},pages = {1097-1110},doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2012.36},publisher = {IEEE Computer Society},address = {Los Alamitos, CA, USA},}
 RefWorks Procite/RefMan/Endnote x TY - JOURJO - IEEE Transactions on Knowledge and Data EngineeringTI - Optimal Route Queries with Arbitrary Order ConstraintsIS - 5SN - 1041-4347SP1097EP1110EPD - 1097-1110A1 - Jing Li, A1 - Yin David Yang, A1 - Nikos Mamoulis, PY - 2013KW - ScatteringKW - IndexesKW - Greedy algorithmsKW - Spatial databasesKW - Complexity theoryKW - Electronic mailKW - TrajectoryKW - spatial databasesKW - Query processingVL - 25JA - IEEE Transactions on Knowledge and Data EngineeringER -
Jing Li, University of Hong Kong, Hong Kong
Yin David Yang, Advanced Digital Sciences Center, Singapore
Nikos Mamoulis, University of Hong Kong, Hong Kong
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ï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 and Data Engineering, vol. 25, no. 5, pp. 1097-1110, May 2013, doi:10.1109/TKDE.2012.36