{"id":"https://openalex.org/W4312278390","doi":"https://doi.org/10.14778/3551793.3551820","title":"Shortest-path queries on complex networks","display_name":"Shortest-path queries on complex networks","publication_year":2022,"publication_date":"2022-07-01","ids":{"openalex":"https://openalex.org/W4312278390","doi":"https://doi.org/10.14778/3551793.3551820"},"language":"en","primary_location":{"id":"doi:10.14778/3551793.3551820","is_oa":false,"landing_page_url":"https://doi.org/10.14778/3551793.3551820","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/A5100377734","display_name":"Junhua Zhang","orcid":"https://orcid.org/0000-0001-6370-9031"},"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":"Junhua 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":"middle","author":{"id":"https://openalex.org/A5100451429","display_name":"Wentao Li","orcid":"https://orcid.org/0000-0003-4941-8814"},"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":"Wentao Li","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/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, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nanjing University of Science and Technology, 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/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/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"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.828,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.91447948,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":99},"biblio":{"volume":"15","issue":"11","first_page":"2640","last_page":"2652"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9940999746322632,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.827229380607605},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7380690574645996},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.6494885087013245},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.6107373237609863},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.6083682179450989},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5195170640945435},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.49470254778862},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.365378201007843},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.3385557532310486},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23649263381958008},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.11922881007194519}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.827229380607605},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7380690574645996},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.6494885087013245},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.6107373237609863},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.6083682179450989},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5195170640945435},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.49470254778862},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.365378201007843},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3385557532310486},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23649263381958008},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.11922881007194519},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.14778/3551793.3551820","is_oa":false,"landing_page_url":"https://doi.org/10.14778/3551793.3551820","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"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/17","score":0.4099999964237213,"display_name":"Partnerships for the goals"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W1493214567","https://openalex.org/W1555893171","https://openalex.org/W1820739428","https://openalex.org/W1969483458","https://openalex.org/W1994727615","https://openalex.org/W1994924587","https://openalex.org/W2005945380","https://openalex.org/W2008440715","https://openalex.org/W2019003829","https://openalex.org/W2020880764","https://openalex.org/W2041172083","https://openalex.org/W2058600246","https://openalex.org/W2085550081","https://openalex.org/W2092330486","https://openalex.org/W2099083325","https://openalex.org/W2111708605","https://openalex.org/W2114507260","https://openalex.org/W2142126162","https://openalex.org/W2143749277","https://openalex.org/W2144085134","https://openalex.org/W2146128955","https://openalex.org/W2146325624","https://openalex.org/W2152776677","https://openalex.org/W2274137191","https://openalex.org/W2567197845","https://openalex.org/W2764587448","https://openalex.org/W2784053634","https://openalex.org/W2791658191","https://openalex.org/W2798620495","https://openalex.org/W2948227434","https://openalex.org/W3012566266","https://openalex.org/W3030668353","https://openalex.org/W3032387886","https://openalex.org/W3154936774","https://openalex.org/W3167317442"],"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/W2962525871","https://openalex.org/W2171039275","https://openalex.org/W2388654557","https://openalex.org/W2388051136","https://openalex.org/W2364137215"],"abstract_inverted_index":{"The":[0,153],"shortest-path":[1,24,56],"query,":[2],"which":[3],"returns":[4],"the":[5,92,106,126,137,157,166],"shortest":[6],"path":[7],"between":[8],"two":[9,59,107],"vertices,":[10],"is":[11,28,38],"a":[12,116,170],"basic":[13],"operation":[14],"on":[15,78,142],"complex":[16],"networks":[17],"and":[18,69],"has":[19],"numerous":[20],"applications.":[21],"To":[22,99],"handle":[23,51],"queries,":[25],"one":[26],"option":[27,37],"to":[29,39,50,54,90,124,149,164],"use":[30,40,48,87],"traversal-based":[31],"methods":[32,46,62,85,110,141],"(e.g.,":[33],"breadth-first":[34],"search);":[35],"another":[36],"extension-based":[41,84,118],"methods,":[42,161],"i.e.,":[43],"extending":[44],"existing":[45],"that":[47],"indexes":[49],"shortest-distance":[52],"queries":[53],"support":[55],"queries.":[57],"These":[58],"types":[60,108],"of":[61,75,109,139,159],"make":[63],"different":[64,140],"trade-offs":[65],"in":[66,95],"query":[67,133],"time":[68],"space":[70,97,128],"cost,":[71],"but":[72],"comprehensive":[73],"studies":[74],"their":[76],"performance":[77,138],"real-world":[79,145],"graphs":[80,146],"are":[81],"lacking.":[82],"Moreover,":[83],"usually":[86],"extra":[88],"attributes":[89],"extend":[91],"indexes,":[93],"resulting":[94],"high":[96],"costs.":[98],"address":[100],"these":[101],"issues,":[102],"we":[103],"thoroughly":[104],"compare":[105,136],"mentioned":[111],"above.":[112],"We":[113,135],"also":[114],"propose":[115],"new":[117],"approach,":[119],"Monotonic":[120],"Landmark":[121],"Labeling":[122],"(MLL),":[123],"reduce":[125],"required":[127],"cost":[129],"while":[130],"still":[131],"guaranteeing":[132],"time.":[134],"ten":[143],"large":[144],"with":[147],"up":[148],"5.5":[150],"billion":[151],"edges.":[152],"experimental":[154],"results":[155],"reveal":[156],"characteristics":[158],"various":[160],"allowing":[162],"practitioners":[163],"select":[165],"appropriate":[167],"method":[168],"for":[169],"specific":[171],"application.":[172]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":5}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}