{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T13:09:49Z","timestamp":1778332189665,"version":"3.51.4"},"publisher-location":"Singapore","reference-count":28,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819203772","type":"print"},{"value":"9789819203789","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-92-0378-9_15","type":"book-chapter","created":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T12:21:19Z","timestamp":1778329279000},"page":"235-251","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Diversified Top-k Optimal Routes with\u00a0Collective Spatial Keywords in\u00a0Road Networks"],"prefix":"10.1007","author":[{"given":"Qiulin","family":"An","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiajia","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chengcheng","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Linlin","family":"Ding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,10]]},"reference":[{"key":"15_CR1","unstructured":"9th dimacs implementation challenge - shortest paths. http:\/\/users.diag.uniroma1.it\/challenge9\/download.shtml"},{"key":"15_CR2","unstructured":"Openstreetmap. https:\/\/www.openstreetmap.org\/"},{"key":"15_CR3","unstructured":"Real historical trajectory data. https:\/\/transitfeeds.com\/"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Cao, X., Chen, L., Cong, G., Xiao, X.: Keyword-aware optimal route search. PVLDB 5(11) (2012)","DOI":"10.14778\/2350229.2350234"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Chondrogiannis, T., Bouros, P., Gamper, J., Leser, U.: Alternative routing: k-shortest paths with limited overlap. In: ACM SIGSPATIAL. pp.\u00a01\u20134 (2015)","DOI":"10.1145\/2820783.2820858"},{"key":"15_CR6","unstructured":"Chondrogiannis, T., Bouros, P., Gamper, J., Leser, U.: Exact and approximate algorithms for finding k-shortest paths with limited overlap (2017)"},{"key":"15_CR7","unstructured":"Chondrogiannis, T., Bouros, P., Gamper, J., Leser, U., Blumenthal, D.B.: Finding k-dissimilar paths with minimum collective length. In: ACM SIGSPATIAL (2018)"},{"issue":"5","key":"15_CR8","doi-asserted-by":"publisher","first-page":"1023","DOI":"10.1007\/s00778-020-00604-x","volume":"29","author":"T Chondrogiannis","year":"2020","unstructured":"Chondrogiannis, T., Bouros, P., Gamper, J., Leser, U., Blumenthal, D.B.: Finding k-shortest paths with limited overlap. VLDB J. 29(5), 1023\u20131047 (2020)","journal-title":"VLDB J."},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Fe\u00a0Lipe, I.D., Hristidis, V., Rishe, N.: Keyword search on spatial databases. In: IEEE ICDE, pp. 656\u2013665 (2008)","DOI":"10.1109\/ICDE.2008.4497474"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Gao, J., Qiu, H., Jiang, X., Wang, T., Yang, D.: Fast top-k simple shortest paths discovery in graphs. In: CIKM, pp. 509\u2013518. ACM (2010)","DOI":"10.1145\/1871437.1871504"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Haryanto, A.A., Islam, M.S., Taniar, D., Cheema: Ig-Tree: an efficient spatial keyword index for planning best path queries on road networks. WWW (2019)","DOI":"10.1007\/s11280-018-0643-5"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Hashem, T., Ali, M.E.: Trip planning and scheduling queries in spatial databases: a survey. In: BDA, vol. 10721, pp. 164\u2013178. Springer (2017)","DOI":"10.1007\/978-3-319-72413-3_11"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Lettich, F., Nascimento, M., Anwar, S.: Trade-off aware sequenced routing queries (or OSR queries when pois are not free). In: MDM, pp. 59\u201368. IEEE (2020)","DOI":"10.1109\/MDM48529.2020.00027"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Li, J., An, Q., Song, Y., Xiong, X., Li, L., Jin, F., Zhou, X.: Route optimization with collective spatial keywords: a skyline-based approach:. VLDBJ (2025)","DOI":"10.1007\/s00778-025-00940-w"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Li, J., An, Q., Zhao, Y., Zhu, R., Guo, N.: Keywords and stops aware optimal routes on road networks. In: APWeb-WAIM (1), pp. 299\u2013314. Springer (2023)","DOI":"10.1007\/978-981-97-2303-4_20"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Li, J., Hu, J., Li, L., Xiong, X., Xia, X.: Efficient multi-request route planning on road network. In: ISPA, pp. 617\u2013624. IEEE (2020)","DOI":"10.1109\/ISPA-BDCloud-SocialCom-SustainCom51426.2020.00103"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Li, J., Xiong, X., Li, L., He, D., Zong, C., Zhou, X.: Finding top-k optimal routes with collective spatial keywords on road networks. In: ICDE. IEEE (2023)","DOI":"10.1109\/ICDE55515.2023.00035"},{"issue":"5","key":"15_CR18","first-page":"1097","volume":"25","author":"J Li","year":"2012","unstructured":"Li, J., Yang, Y.D., Mamoulis, N.: Optimal route queries with arbitrary order constraints. TKDE 25(5), 1097\u20131110 (2012)","journal-title":"TKDE"},{"issue":"3","key":"15_CR19","first-page":"488","volume":"30","author":"H Liu","year":"2017","unstructured":"Liu, H., Jin, C., Yang, B., Zhou, A.: Finding top-k shortest paths with diversity. TKDE 30(3), 488\u2013502 (2017)","journal-title":"TKDE"},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Liu, H., Jin, C., Yang, B., Zhou, A.: Finding top-k optimal sequenced routes. In: ICDE, pp. 569\u2013580. IEEE (2018)","DOI":"10.1109\/ICDE.2018.00058"},{"issue":"4","key":"15_CR21","first-page":"869","volume":"18","author":"EHC Lu","year":"2016","unstructured":"Lu, E.H.C., Chen, H.S., Tseng, V.S.: An efficient framework for multirequest route planning in urban environments. TITS 18(4), 869\u2013879 (2016)","journal-title":"TITS"},{"issue":"11","key":"15_CR22","first-page":"3199","volume":"15","author":"Z Luo","year":"2022","unstructured":"Luo, Z., Li, L., Zhang, M., Hua, W., Xu, Y., Zhou, X.: Diversified top-k route planning in road network. PVLDB 15(11), 3199\u20133212 (2022)","journal-title":"PVLDB"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Ouyang, D., Qin, L., Chang, L., Lin, X.: When hierarchy meets 2-hop-labeling: efficient shortest distance queries on road networks. In: SIGMOD (2018)","DOI":"10.1145\/3183713.3196913"},{"key":"15_CR24","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1007\/s00778-006-0038-6","volume":"17","author":"M Sharifzadeh","year":"2008","unstructured":"Sharifzadeh, M., Kolahdouzan, M., Shahabi, C.: The optimal sequenced route query. VLDB J. 17, 765\u2013787 (2008)","journal-title":"VLDB J."},{"key":"15_CR25","doi-asserted-by":"crossref","unstructured":"Zheng, B., Xu, J., Lee, W.C., Lee, D.L.: Grid-partition index: a hybrid method for nearest-neighbor queries in wireless location-based services. VLDBJ (2006)","DOI":"10.1007\/s00778-004-0146-0"},{"key":"15_CR26","doi-asserted-by":"crossref","unstructured":"Zhong, R., Li, G., Tan, K.L., Zhou, L.: G-Tree: an efficient index for KNN search on road networks. In: CIKM, pp. 39\u201348 (2013)","DOI":"10.1145\/2505515.2505749"},{"issue":"8","key":"15_CR27","first-page":"2175","volume":"27","author":"R Zhong","year":"2015","unstructured":"Zhong, R., Li, G., Tan, K.L., Zhou, L., Gong, Z.: G-Tree: an efficient and scalable index for spatial search on road networks. TKDE 27(8), 2175\u20132189 (2015)","journal-title":"TKDE"},{"issue":"1","key":"15_CR28","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s41019-022-00177-5","volume":"7","author":"H Zhu","year":"2022","unstructured":"Zhu, H., Li, W., Liu, W., Yin, J., Xu, J.: Top K optimal sequenced route query with poi preferences. Data Sci. Eng. 7(1), 3\u201315 (2022)","journal-title":"Data Sci. Eng."}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-92-0378-9_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T12:21:26Z","timestamp":1778329286000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-92-0378-9_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819203772","9789819203789"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-981-92-0378-9_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"10 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DASFAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database Systems for Advanced Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jeju","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Korea (Republic of)","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 April 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dasfaa2026.github.io\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}