Abstract
The optimal sequenced route (OSR) query, as a popular problem in route planning for smart cities, searches for a minimum-distance route passing through several POIs in a specific order from a starting position. In reality, POIs are usually rated, which helps users in making decisions. Existing OSR queries neglect the fact that the POIs in the same category could have different scores, which may affect users’ route choices. In this paper, we study a novel variant of OSR query, namely Rating Constrained Optimal Sequenced Route query (RCOSR), in which the rating score of each POI in the optimal sequenced route should exceed the query threshold. To efficiently process RCOSR queries, we first extend the existing TD-OSR algorithm to propose a baseline method, called MTDOSR. To tackle the shortcomings of MTDOSR, we try to design a new RCOSR algorithm, namely Optimal Subroute Expansion (OSE) Algorithm. To enhance the OSE algorithm, we propose a Reference Node Inverted Index (RNII) to accelerate the distance computation of POI pairs in OSE and quickly retrieve the POIs of each category. To make full use of the OSE and RNII, we further propose a new efficient RCOSR algorithm, called Recurrent Optimal Subroute Expansion (ROSE), which recurrently utilizes OSE to compute the current optimal route as the guiding path and update the distance of POI pairs to guide the expansion. The experimental results demonstrate that the proposed algorithm significantly outperforms the existing approaches.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
Between two POIs, the shortest path is used in default, e.g., \(\{p_1^S, v_3, p_1^R\}\) is for \(p _1^S, p_1^R\).
- 2.
Theoretically, the reference node can be any point in the road network, but for simplicity we select the nodes as the reference nodes.
- 3.
References
Barua, S., Jahan, R., Ahmed, T.: Weighted optimal sequenced group trip planning queries. In: MDM, pp. 222–227 (2017)
Chen, H., Ku, W., Sun, M., Zimmermann, R.: The multi-rule partial sequenced route query. In: SIGSPATIAL, pp. 1–10 (2008)
Costa, C.F., Nascimento, M.A., Macêdo, J.A., Theodoridis, Y., Pelekis, N., Machado, J.: Optimal time-dependent sequenced route queries in road networks. In: SIGSPATIAL, pp. 1–4 (2015)
Dai, Jian., Liu, Chengfei., Xu, Jiajie, Ding, Zhiming: On personalized and sequenced route planning. World Wide Web 19(4), 679–705 (2015). https://doi.org/10.1007/s11280-015-0352-2
Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: SIGMOD, pp. 47–57 (1984)
Kriegel, H., Kröger, P., Kunath, P., Renz, M., Schmidt, T.: Proximity queries in large traffic networks. In: GIS, pp. 1–8 (2007)
Li, F., Cheng, D., Hadjieleftheriou, M., Kollios, G., Teng, S.: On trip planning queries in spatial databases. In: SSTD, pp. 273–290 (2005)
Li, J., Yang, Y.D., Mamoulis, N.: Optimal route queries with arbitrary order constraints. TKDE 25(5), 1097–1110 (2013)
Liu, H., **, C., Yang, B., Zhou, A.: Finding top-k optimal sequenced routes, pp. 569–580 (2018). CoRR abs/1802.08014
Ouyang, D., Qin, L., Chang, L., Lin, X., Zhang, Y., Zhu, Q.: When hierarchy meets 2-hop-labeling: efficient shortest distance queries on road networks. In: ICMD, pp. 709–724 (2018)
Sasaki, Y., Ishikawa, Y., Fujiwara, Y., Onizuka, M.: Sequenced route query with semantic hierarchy. EDBT 2018, 37–48 (2018)
Sharifzadeh, M., Kolahdouzan, M.R., Shahabi, C.: The optimal sequenced route query. VLDB J 17(4), 765–787 (2008)
Sharifzadeh, M., Shahabi, C.: Processing optimal sequenced route queries using voronoi diagrams. GeoInformatica 12(4), 411–433 (2008)
Singhal, A.: Modern information retrieval: a brief overview. IEEE DEB 24(4), 35–43 (2001)
Yao, B., Tang, M., Li, F.: Multi-approximate-keyword routing in GIS data. In: SIGSPATIAL, pp. 201–210 (2011)
Yawalkar, P., Ranu, S.: Route recommendations on road networks for arbitrary user preference functions, pp. 602–613 (2019)
Zheng, B., Su, H., Hua, W., Zheng, K., Zhou, X., Li, G.: Efficient clue-based route search on road networks. TKDE 12(4), 1846–1859 (2017)
Zhong, R., Li, G., Tan, K., Zhou, L.: G-tree: an efficient index for KNN search on road networks. In: CIKM, pp. 39–48 (2013)
Acknowledgments
This work is supported by the National Natural Science Foundation of China (61902438, 61902439, U1811264, U19112031), Natural Science Foundation of Guangdong Province under Grant (2019A1515011704, 2019A1515011159), Guangdong Basic and Applied Basic Research Foundation (2019B1515130001), National Science Foundation for Post-Doctoral Scientists of China under Grant (2018M643307, 2019M663237), Young Teacher Training Project of Sun Yat-sen University under Grant (19lgpy214,19lgpy223)and Hong Kong RGC Grant 12200817.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Li, W., Zhu, H., Liu, W., Yin, J., Xu, J. (2021). Optimal Sequenced Route Query with POI Preferences. In: Jensen, C.S., et al. Database Systems for Advanced Applications. DASFAA 2021. Lecture Notes in Computer Science(), vol 12681. Springer, Cham. https://doi.org/10.1007/978-3-030-73194-6_31
Download citation
DOI: https://doi.org/10.1007/978-3-030-73194-6_31
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-73193-9
Online ISBN: 978-3-030-73194-6
eBook Packages: Computer ScienceComputer Science (R0)