{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T12:21:47Z","timestamp":1767183707633,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030731939"},{"type":"electronic","value":"9783030731946"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-73194-6_31","type":"book-chapter","created":{"date-parts":[[2021,4,6]],"date-time":"2021-04-06T19:03:01Z","timestamp":1617735781000},"page":"457-473","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Optimal Sequenced Route Query with\u00a0POI Preferences"],"prefix":"10.1007","author":[{"given":"Wenbin","family":"Li","sequence":"first","affiliation":[]},{"given":"Huaijie","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Jian","family":"Yin","sequence":"additional","affiliation":[]},{"given":"Jianliang","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,4,6]]},"reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"Barua, S., Jahan, R., Ahmed, T.: Weighted optimal sequenced group trip planning queries. In: MDM, pp. 222\u2013227 (2017)","DOI":"10.1109\/MDM.2017.37"},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"Chen, H., Ku, W., Sun, M., Zimmermann, R.: The multi-rule partial sequenced route query. In: SIGSPATIAL, pp. 1\u201310 (2008)","DOI":"10.1145\/1463434.1463448"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"Costa, C.F., Nascimento, M.A., Mac\u00eado, J.A., Theodoridis, Y., Pelekis, N., Machado, J.: Optimal time-dependent sequenced route queries in road networks. In: SIGSPATIAL, pp. 1\u20134 (2015)","DOI":"10.1145\/2820783.2820846"},{"issue":"4","key":"31_CR4","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/s11280-015-0352-2","volume":"19","author":"Jian Dai","year":"2015","unstructured":"Dai, Jian., Liu, Chengfei., Xu, Jiajie, Ding, Zhiming: On personalized and sequenced route planning. World Wide Web 19(4), 679\u2013705 (2015). https:\/\/doi.org\/10.1007\/s11280-015-0352-2","journal-title":"World Wide Web"},{"key":"31_CR5","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: SIGMOD, pp. 47\u201357 (1984)","DOI":"10.1145\/971697.602266"},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"Kriegel, H., Kr\u00f6ger, P., Kunath, P., Renz, M., Schmidt, T.: Proximity queries in large traffic networks. In: GIS, pp. 1\u20138 (2007)","DOI":"10.1145\/1341012.1341040"},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"Li, F., Cheng, D., Hadjieleftheriou, M., Kollios, G., Teng, S.: On trip planning queries in spatial databases. In: SSTD, pp. 273\u2013290 (2005)","DOI":"10.1007\/11535331_16"},{"issue":"5","key":"31_CR8","first-page":"1097","volume":"25","author":"J Li","year":"2013","unstructured":"Li, J., Yang, Y.D., Mamoulis, N.: Optimal route queries with arbitrary order constraints. TKDE 25(5), 1097\u20131110 (2013)","journal-title":"TKDE"},{"key":"31_CR9","unstructured":"Liu, H., Jin, C., Yang, B., Zhou, A.: Finding top-k optimal sequenced routes, pp. 569\u2013580 (2018). CoRR abs\/1802.08014"},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"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\u2013724 (2018)","DOI":"10.1145\/3183713.3196913"},{"key":"31_CR11","first-page":"37","volume":"2018","author":"Y Sasaki","year":"2018","unstructured":"Sasaki, Y., Ishikawa, Y., Fujiwara, Y., Onizuka, M.: Sequenced route query with semantic hierarchy. EDBT 2018, 37\u201348 (2018)","journal-title":"EDBT"},{"issue":"4","key":"31_CR12","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.R., Shahabi, C.: The optimal sequenced route query. VLDB J 17(4), 765\u2013787 (2008)","journal-title":"VLDB J"},{"issue":"4","key":"31_CR13","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/s10707-007-0034-z","volume":"12","author":"M Sharifzadeh","year":"2008","unstructured":"Sharifzadeh, M., Shahabi, C.: Processing optimal sequenced route queries using voronoi diagrams. GeoInformatica 12(4), 411\u2013433 (2008)","journal-title":"GeoInformatica"},{"issue":"4","key":"31_CR14","first-page":"35","volume":"24","author":"A Singhal","year":"2001","unstructured":"Singhal, A.: Modern information retrieval: a brief overview. IEEE DEB 24(4), 35\u201343 (2001)","journal-title":"IEEE DEB"},{"key":"31_CR15","doi-asserted-by":"crossref","unstructured":"Yao, B., Tang, M., Li, F.: Multi-approximate-keyword routing in GIS data. In: SIGSPATIAL, pp. 201\u2013210 (2011)","DOI":"10.1145\/2093973.2094001"},{"key":"31_CR16","doi-asserted-by":"crossref","unstructured":"Yawalkar, P., Ranu, S.: Route recommendations on road networks for arbitrary user preference functions, pp. 602\u2013613 (2019)","DOI":"10.1109\/ICDE.2019.00060"},{"issue":"4","key":"31_CR17","first-page":"1846","volume":"12","author":"B Zheng","year":"2017","unstructured":"Zheng, B., Su, H., Hua, W., Zheng, K., Zhou, X., Li, G.: Efficient clue-based route search on road networks. TKDE 12(4), 1846\u20131859 (2017)","journal-title":"TKDE"},{"key":"31_CR18","doi-asserted-by":"crossref","unstructured":"Zhong, R., Li, G., Tan, K., Zhou, L.: G-tree: an efficient index for KNN search on road networks. In: CIKM, pp. 39\u201348 (2013)","DOI":"10.1145\/2505515.2505749"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-73194-6_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,6]],"date-time":"2021-04-06T19:22:39Z","timestamp":1617736959000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-73194-6_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030731939","9783030731946"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-73194-6_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"6 April 2021","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":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/dm.iis.sinica.edu.tw\/DASFAA2021\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"490","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"98","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the Corona pandemic this event was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}