{"id":"https://openalex.org/W3008629102","doi":"https://doi.org/10.14778/3377369.3377371","title":"Efficient shortest path index maintenance on dynamic road networks with theoretical guarantees","display_name":"Efficient shortest path index maintenance on dynamic road networks with theoretical guarantees","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3008629102","doi":"https://doi.org/10.14778/3377369.3377371","mag":"3008629102"},"language":"en","primary_location":{"id":"doi:10.14778/3377369.3377371","is_oa":false,"landing_page_url":"https://doi.org/10.14778/3377369.3377371","pdf_url":null,"source":{"id":"https://openalex.org/S4210226185","display_name":"Proceedings of the VLDB Endowment","issn_l":"2150-8097","issn":["2150-8097"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the VLDB Endowment","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5043155390","display_name":"Dian Ouyang","orcid":"https://orcid.org/0000-0002-9472-4389"},"institutions":[{"id":"https://openalex.org/I129604602","display_name":"The University of Sydney","ror":"https://ror.org/0384j8v12","country_code":"AU","type":"education","lineage":["https://openalex.org/I129604602"]},{"id":"https://openalex.org/I36399199","display_name":"Nanjing University of Science and Technology","ror":"https://ror.org/00xp9wg62","country_code":"CN","type":"education","lineage":["https://openalex.org/I36399199"]}],"countries":["AU","CN"],"is_corresponding":false,"raw_author_name":"Dian Ouyang","raw_affiliation_strings":["Nanjing University of Science and Technology, Nanjing, China and The University of Sydney, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nanjing University of Science and Technology, Nanjing, China and The University of Sydney, Australia","institution_ids":["https://openalex.org/I129604602","https://openalex.org/I36399199"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069580961","display_name":"Long Yuan","orcid":"https://orcid.org/0000-0001-8111-0401"},"institutions":[{"id":"https://openalex.org/I36399199","display_name":"Nanjing University of Science and Technology","ror":"https://ror.org/00xp9wg62","country_code":"CN","type":"education","lineage":["https://openalex.org/I36399199"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Long Yuan","raw_affiliation_strings":["Nanjing University of Science and Technology, Nanjing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nanjing University of Science and Technology, Nanjing, China","institution_ids":["https://openalex.org/I36399199"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046220908","display_name":"Lu Qin","orcid":"https://orcid.org/0000-0001-6068-5062"},"institutions":[{"id":"https://openalex.org/I114017466","display_name":"University of Technology Sydney","ror":"https://ror.org/03f0f6041","country_code":"AU","type":"education","lineage":["https://openalex.org/I114017466"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Lu Qin","raw_affiliation_strings":["University of Technology, Sydney, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Technology, Sydney, Australia","institution_ids":["https://openalex.org/I114017466"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037530341","display_name":"Lijun Chang","orcid":"https://orcid.org/0000-0002-6830-3900"},"institutions":[{"id":"https://openalex.org/I129604602","display_name":"The University of Sydney","ror":"https://ror.org/0384j8v12","country_code":"AU","type":"education","lineage":["https://openalex.org/I129604602"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Lijun Chang","raw_affiliation_strings":["The University of Sydney, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of Sydney, Australia","institution_ids":["https://openalex.org/I129604602"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100386104","display_name":"Ying Zhang","orcid":"https://orcid.org/0000-0002-2674-1638"},"institutions":[{"id":"https://openalex.org/I114017466","display_name":"University of Technology Sydney","ror":"https://ror.org/03f0f6041","country_code":"AU","type":"education","lineage":["https://openalex.org/I114017466"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Ying Zhang","raw_affiliation_strings":["University of Technology, Sydney, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Technology, Sydney, Australia","institution_ids":["https://openalex.org/I114017466"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079659938","display_name":"Xuemin Lin","orcid":"https://orcid.org/0000-0003-2396-7225"},"institutions":[{"id":"https://openalex.org/I31746571","display_name":"UNSW Sydney","ror":"https://ror.org/03r8z3t63","country_code":"AU","type":"education","lineage":["https://openalex.org/I31746571"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Xuemin Lin","raw_affiliation_strings":["The University of New South Wales, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The University of New South Wales, Australia","institution_ids":["https://openalex.org/I31746571"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.9059,"has_fulltext":false,"cited_by_count":76,"citation_normalized_percentile":{"value":0.97037511,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":"13","issue":"5","first_page":"602","last_page":"615"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11344","display_name":"Traffic Prediction and Management Techniques","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T13282","display_name":"Automated Road and Building Extraction","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7940874099731445},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7896973490715027},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.564258873462677},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5639699697494507},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5035209059715271},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.47339189052581787},{"id":"https://openalex.org/keywords/index","display_name":"Index (typography)","score":0.47303101420402527},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47069740295410156},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.4188433885574341},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.41136419773101807},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3305138349533081},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2823103666305542},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.12523213028907776},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.09574490785598755}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7940874099731445},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7896973490715027},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.564258873462677},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5639699697494507},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5035209059715271},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.47339189052581787},{"id":"https://openalex.org/C2777382242","wikidata":"https://www.wikidata.org/wiki/Q6017816","display_name":"Index (typography)","level":2,"score":0.47303101420402527},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47069740295410156},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4188433885574341},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.41136419773101807},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3305138349533081},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2823103666305542},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.12523213028907776},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.09574490785598755},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.14778/3377369.3377371","is_oa":false,"landing_page_url":"https://doi.org/10.14778/3377369.3377371","pdf_url":null,"source":{"id":"https://openalex.org/S4210226185","display_name":"Proceedings of the VLDB Endowment","issn_l":"2150-8097","issn":["2150-8097"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the VLDB Endowment","raw_type":"journal-article"},{"id":"pmh:oai:opus.lib.uts.edu.au:10453/144953","is_oa":false,"landing_page_url":"http://hdl.handle.net/10453/144953","pdf_url":null,"source":{"id":"https://openalex.org/S4306401357","display_name":"UTS ePRESS (University of Technology Sydney)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I114017466","host_organization_name":"University of Technology Sydney","host_organization_lineage":["https://openalex.org/I114017466"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6399999856948853,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W166260623","https://openalex.org/W1483530364","https://openalex.org/W1493214567","https://openalex.org/W1530939456","https://openalex.org/W1571096325","https://openalex.org/W1601313669","https://openalex.org/W1779869868","https://openalex.org/W1986652726","https://openalex.org/W2006097619","https://openalex.org/W2014889099","https://openalex.org/W2034435578","https://openalex.org/W2041916017","https://openalex.org/W2081863845","https://openalex.org/W2101823987","https://openalex.org/W2104317982","https://openalex.org/W2112513979","https://openalex.org/W2112738128","https://openalex.org/W2131237536","https://openalex.org/W2143083884","https://openalex.org/W2146583842","https://openalex.org/W2148831787","https://openalex.org/W2169528473","https://openalex.org/W2231297807","https://openalex.org/W2253723033","https://openalex.org/W2257437291","https://openalex.org/W2297018065","https://openalex.org/W2394103513","https://openalex.org/W2421052367","https://openalex.org/W2531385306","https://openalex.org/W2579664199","https://openalex.org/W2588514192","https://openalex.org/W2728796024","https://openalex.org/W2774090050","https://openalex.org/W2774854434","https://openalex.org/W2791658191","https://openalex.org/W2798620495","https://openalex.org/W2801139070","https://openalex.org/W2802530743","https://openalex.org/W2942445691","https://openalex.org/W2950844687","https://openalex.org/W2951242183","https://openalex.org/W2963732503","https://openalex.org/W2970568805","https://openalex.org/W3130246349"],"related_works":["https://openalex.org/W2198982833","https://openalex.org/W2767202586","https://openalex.org/W2523719706","https://openalex.org/W2375775343","https://openalex.org/W1990043277","https://openalex.org/W4223969905","https://openalex.org/W2171039275","https://openalex.org/W2388654557","https://openalex.org/W2170980056","https://openalex.org/W4310124294"],"abstract_inverted_index":{"Computing":[0],"the":[1,39,64,76,124,133,159,182,192,196,217,231,235],"shortest":[2,26,77,97],"path":[3,27,78,98],"between":[4],"two":[5],"vertices":[6],"is":[7,15,68,137],"a":[8,18,30,146,152,175],"fundamental":[9],"problem":[10,81],"in":[11,17,38,52,86,107,195],"road":[12,48,66,84,135,214],"networks":[13,49,85,215],"that":[14,220],"applied":[16],"wide":[19],"variety":[20],"of":[21,32,43,102,130,155,226],"applications.":[22],"To":[23,140],"support":[24,46],"efficient":[25,120,188],"query":[28,113],"processing,":[29],"plethora":[31],"index-based":[33],"methods":[34],"have":[35],"been":[36],"proposed":[37],"literature,":[40],"but":[41],"few":[42],"them":[44],"can":[45],"dynamic":[47,83],"commonly":[50],"encountered":[51],"practice,":[53],"as":[54,94],"their":[55],"corresponding":[56],"index":[57,79,125,128,194],"structures":[58],"cannot":[59],"be":[60],"efficiently":[61],"maintained":[62],"when":[63,132],"input":[65,134],"network":[67,136],"dynamically":[69,138],"updated.":[70,139],"Motivated":[71],"by":[72],"this,":[73],"we":[74,144,165,186],"study":[75],"maintenance":[80],"on":[82,150,181,212],"this":[87,142,163],"paper.":[88],"We":[89,207],"adopt":[90],"Contraction":[91],"Hierarchies":[92],"(CH)":[93],"our":[95,210,221],"underlying":[96],"computation":[99],"method":[100],"because":[101],"its":[103],"outstanding":[104],"overall":[105],"performance":[106],"pre-processing":[108],"time,":[109],"space":[110],"cost,":[111],"and":[112,116,173,199,216],"processing":[114],"time":[115],"aim":[117],"to":[118,122,157,190,230],"design":[119,166],"algorithms":[121,189,211],"maintain":[123,158,191],"structure,":[126],"shortcut":[127,160,176,193],",":[129],"CH":[131],"achieve":[141],"goal,":[143],"propose":[145,174],"shortcut-centric":[147],"paradigm":[148],"focusing":[149],"exploring":[151],"small":[153],"number":[154],"shortcuts":[156],"index.":[161],"Following":[162],"paradigm,":[164],"an":[167],"auxiliary":[168],"data":[169],"structure":[170],"named":[171],"SS-Graph":[172],"weight":[177],"propagation":[178],"mechanism":[179],"based":[180],"SS-Graph.":[183],"With":[184],"them,":[185],"devise":[187],"streaming":[197,236],"update":[198,201],"batch":[200],"scenarios":[202],"with":[203],"non-trivial":[204],"theoretical":[205],"guarantees.":[206],"experimentally":[208],"evaluate":[209],"real":[213],"results":[218],"demonstrate":[219],"approach":[222],"achieves":[223],"2--3":[224],"orders":[225],"magnitude":[227],"speedup":[228],"compared":[229],"state-of-the-art":[232],"algorithm":[233],"for":[234],"update.":[237]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":19},{"year":2024,"cited_by_count":13},{"year":2023,"cited_by_count":13},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":15},{"year":2020,"cited_by_count":6}],"updated_date":"2026-07-25T15:57:00.446498","created_date":"2025-10-10T00:00:00"}