{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T05:59:03Z","timestamp":1774677543376,"version":"3.50.1"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031306747","type":"print"},{"value":"9783031306754","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-30675-4_18","type":"book-chapter","created":{"date-parts":[[2023,4,14]],"date-time":"2023-04-14T10:02:24Z","timestamp":1681466544000},"page":"269-285","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Contraction Hierarchies with\u00a0Label Restrictions Maintenance in\u00a0Dynamic Road Networks"],"prefix":"10.1007","author":[{"given":"Bo","family":"Feng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zi","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Long","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liping","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,4,15]]},"reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-642-20662-7_20","volume-title":"Experimental Algorithms","author":"I Abraham","year":"2011","unstructured":"Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.: A hub-based labeling algorithm for shortest paths in road networks. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol. 6630, pp. 230\u2013241. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20662-7_20"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Akiba, T., Iwata, Y., Yoshida, Y.: Fast exact shortest-path distance queries on large networks by pruned landmark labeling. In: SIGMOD, pp. 349\u2013360 (2013)","DOI":"10.1145\/2463676.2465315"},{"issue":"1","key":"18_CR3","first-page":"151","volume":"25","author":"S Anirban","year":"2022","unstructured":"Anirban, S., Wang, J., Islam, M.S., Kayesh, H., Li, J., Huang, M.L.: Compression techniques for 2-hop labeling for shortest distance queries. WWW 25(1), 151\u2013174 (2022)","journal-title":"WWW"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Buchhold, V., Sanders, P., Wagner, D.: Real-time traffic assignment using engineered customizable contraction hierarchies. ACM J. Exp. Algorithmics 24(1), 2.4:1\u20132.4:28 (2019)","DOI":"10.1145\/3362693"},{"key":"18_CR5","unstructured":"Chen, Y., Perera, L., Thompson, R.G.: An advanced method to provide best route information in city logistics with toll roads. ATRF (2018)"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Chen, Z., Fu, A.W., Jiang, M., Lo, E., Zhang, P.: P2H: efficient distance querying on road networks by projected vertex separators. In: SIGMOD, pp. 313\u2013325. ACM (2021)","DOI":"10.1145\/3448016.3459245"},{"key":"18_CR7","unstructured":"Chen, Z., Yuan, L., Han, L., Qian, Z.: Higher-order truss decomposition in graphs. IEEE TKDE, p. 1 (2021)"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Chen, Z., Yuan, L., Lin, X., Qin, L., Yang, J.: Efficient maximal balanced clique enumeration in signed networks. In: WWW, pp. 339\u2013349. ACM\/IW3C2 (2020)","DOI":"10.1145\/3366423.3380119"},{"key":"18_CR9","unstructured":"Dean, B.: Uber statistics 2022: How many people ride with uber? https:\/\/backlinko.com\/uber-users (2022)"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Dibbelt, J., Strasser, B., Wagner, D.: Customizable contraction hierarchies. ACM J. Exp. Algorithmics 21(1), 1.5:1\u20131.5:49 (2016)","DOI":"10.1145\/2886843"},{"key":"18_CR11","unstructured":"Didi. Didi statistics and facts (2022). https:\/\/expandedramblings.com\/index.php\/didi-chuxing-facts-statistics\/"},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1, 269\u2013271 (1959)","journal-title":"Numer. Math."},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"1443","DOI":"10.1016\/j.trpro.2016.05.217","volume":"14","author":"R Engstr\u00f6m","year":"2016","unstructured":"Engstr\u00f6m, R.: The roads\u2019 role in the freight transport system. Transp. Res. Procedia 14, 1443\u20131452 (2016)","journal-title":"Transp. Res. Procedia"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-540-68552-4_24","volume-title":"Experimental Algorithms","author":"R Geisberger","year":"2008","unstructured":"Geisberger, R., Sanders, P., Schultes, D., Delling, D.: Contraction hierarchies: faster and simpler hierarchical routing in road networks. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 319\u2013333. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68552-4_24"},{"issue":"4","key":"18_CR15","doi-asserted-by":"publisher","first-page":"492","DOI":"10.14778\/3372716.3372722","volume":"13","author":"K Lakhotia","year":"2019","unstructured":"Lakhotia, K., Kannan, R., Dong, Q., Prasanna, V.K.: Planting trees for scalable and efficient canonical hub labeling. Proc. VLDB Endow. 13(4), 492\u2013505 (2019)","journal-title":"Proc. VLDB Endow."},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Li, W., Qiao, M., Qin, L., Zhang, Y., Chang, L., Lin, X.: Scaling distance labeling on small-world networks. In: SIGMOD, pp. 1060\u20131077 (2019)","DOI":"10.1145\/3299869.3319877"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Li, Y., L.H. U, Yiu, M.L., Kou, N.M.: An experimental study on hub labeling based shortest path algorithms. Proc. VLDB Endow. 11(4), 445\u2013457 (2017)","DOI":"10.1145\/3186728.3164141"},{"issue":"5","key":"18_CR18","doi-asserted-by":"publisher","first-page":"1075","DOI":"10.1007\/s00778-020-00606-9","volume":"29","author":"B Liu","year":"2020","unstructured":"Liu, B., Yuan, L., Lin, X., Qin, L., Zhang, W., Zhou, J.: Efficient ($$\\alpha $$, $$\\beta $$)-core computation in bipartite graphs. VLDB J. 29(5), 1075\u20131099 (2020). https:\/\/doi.org\/10.1007\/s00778-020-00606-9","journal-title":"VLDB J."},{"key":"18_CR19","unstructured":"Mahajan, B.: Classification of roads in india. https:\/\/civiconcepts.com\/blog\/classification-of-roads"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Meng, L., Yuan, L., Chen, Z., Lin, X., Yang, S.: Index-based structural clustering on directed graphs. In: ICDE, pp. 2831\u20132844. IEEE (2022)","DOI":"10.1109\/ICDE53745.2022.00257"},{"issue":"2","key":"18_CR21","first-page":"191","volume":"1","author":"JL Mwakalonge","year":"2012","unstructured":"Mwakalonge, J.L., Moses, R.: Evaluation of truck lane restriction on non-limited access urban arterials. IJTST 1(2), 191\u2013204 (2012)","journal-title":"IJTST"},{"key":"18_CR22","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: SIGMOD, pp. 709\u2013724 (2018)","DOI":"10.1145\/3183713.3196913"},{"issue":"5","key":"18_CR23","doi-asserted-by":"publisher","first-page":"602","DOI":"10.14778\/3377369.3377371","volume":"13","author":"D Ouyang","year":"2020","unstructured":"Ouyang, D., Yuan, L., Qin, L., Chang, L., Zhang, Y., Lin, X.: Efficient shortest path index maintenance on dynamic road networks with theoretical guarantees. Proc. VLDB Endow. 13(5), 602\u2013615 (2020)","journal-title":"Proc. VLDB Endow."},{"issue":"2","key":"18_CR24","doi-asserted-by":"publisher","first-page":"69","DOI":"10.14778\/1921071.1921074","volume":"4","author":"MN Rice","year":"2010","unstructured":"Rice, M.N., Tsotras, V.J.: Graph indexing of road networks for shortest path queries with label restrictions. Proc. VLDB Endow. 4(2), 69\u201380 (2010)","journal-title":"Proc. VLDB Endow."},{"issue":"5","key":"18_CR25","doi-asserted-by":"publisher","first-page":"406","DOI":"10.14778\/2140436.2140438","volume":"5","author":"L Wu","year":"2012","unstructured":"Wu, L., Xiao, X., Deng, D., Cong, G., Zhu, A.D., Zhou, S.: Shortest path and distance queries on road networks: an experimental evaluation. Proc. VLDB Endow. 5(5), 406\u2013417 (2012)","journal-title":"Proc. VLDB Endow."},{"issue":"2","key":"18_CR26","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s00778-015-0408-z","volume":"25","author":"L Yuan","year":"2016","unstructured":"Yuan, L., Qin, L., Lin, X., Chang, L., Zhang, W.: Diversified top-k clique search. VLDB J. 25(2), 171\u2013196 (2016)","journal-title":"VLDB J."},{"issue":"5","key":"18_CR27","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1109\/TKDE.2017.2783933","volume":"30","author":"L Yuan","year":"2018","unstructured":"Yuan, L., Qin, L., Zhang, W., Chang, L., Yang, J.: Index-based densest clique percolation community search in networks. IEEE Trans. Knowl. Data Eng. 30(5), 922\u2013935 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"11","key":"18_CR28","doi-asserted-by":"publisher","first-page":"2640","DOI":"10.14778\/3551793.3551820","volume":"15","author":"J Zhang","year":"2022","unstructured":"Zhang, J., Li, W., Yuan, L., Qin, L., Zhang, Y., Chang, L.: Shortest-path queries on complex networks: experiments, analyses, and improvement. Proc. VLDB Endow. 15(11), 2640\u20132652 (2022)","journal-title":"Proc. VLDB Endow."},{"issue":"3","key":"18_CR29","doi-asserted-by":"publisher","first-page":"686","DOI":"10.14778\/3494124.3494148","volume":"15","author":"J Zhang","year":"2021","unstructured":"Zhang, J., Yuan, L., Li, W., Qin, L., Zhang, Y.: Efficient label-constrained shortest path queries on road networks: a tree decomposition approach. Proc. VLDB Endow. 15(3), 686\u2013698 (2021)","journal-title":"Proc. VLDB Endow."},{"key":"18_CR30","doi-asserted-by":"crossref","unstructured":"Zhang, M., Li, L., Hua, W., Mao, R., Chao, P., Zhou, X.: Dynamic hub labeling for road networks. In: ICDE, pp. 336\u2013347 (2021)","DOI":"10.1109\/ICDE51399.2021.00036"},{"key":"18_CR31","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Yu, J.X.: Relative subboundedness of contraction hierarchy and hierarchical 2-hop index in dynamic road networks. In: SIGMOD, pp. 1992\u20132005 (2022)","DOI":"10.1145\/3514221.3517875"},{"key":"18_CR32","doi-asserted-by":"crossref","unstructured":"Zhao, Y., Chen, Z., Chen, C., Wang, X., Lin, X., Zhang, W.: Finding the maximum $$k$$-balanced biclique on weighted bipartite graphs. IEEE TKDE, pp. 1\u201314 (2022)","DOI":"10.1109\/TKDE.2022.3206351"},{"key":"18_CR33","doi-asserted-by":"crossref","unstructured":"Zhu, A.D., Ma, H., Xiao, X., Luo, S., Tang, Y., Zhou, S.: Shortest path and distance queries on road networks: towards bridging theory and practice. In: SIGMOD, pp. 857\u2013868 (2013)","DOI":"10.1145\/2463676.2465277"}],"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-3-031-30675-4_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T12:09:01Z","timestamp":1710245341000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30675-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031306747","9783031306754"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30675-4_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"15 April 2023","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":"Tianjin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dasfaa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.tjudb.cn\/dasfaa2023\/","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":"Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"652","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":"125","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":"66","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":"19% - 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":"3","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.3","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}