{"id":"https://openalex.org/W3154936774","doi":"https://doi.org/10.1145/3448016.3452826","title":"Query-by-Sketch: Scaling Shortest Path Graph Queries on Very Large Networks","display_name":"Query-by-Sketch: Scaling Shortest Path Graph Queries on Very Large Networks","publication_year":2021,"publication_date":"2021-06-09","ids":{"openalex":"https://openalex.org/W3154936774","doi":"https://doi.org/10.1145/3448016.3452826","mag":"3154936774"},"language":"en","primary_location":{"id":"doi:10.1145/3448016.3452826","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3448016.3452826","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2021 International Conference on Management of Data","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2104.09733","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Ye Wang","orcid":null},"institutions":[{"id":"https://openalex.org/I118347636","display_name":"Australian National University","ror":"https://ror.org/019wvm592","country_code":"AU","type":"education","lineage":["https://openalex.org/I118347636"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Ye Wang","raw_affiliation_strings":["Australian National University, Canberra, Australia"],"affiliations":[{"raw_affiliation_string":"Australian National University, Canberra, Australia","institution_ids":["https://openalex.org/I118347636"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Qing Wang","orcid":null},"institutions":[{"id":"https://openalex.org/I118347636","display_name":"Australian National University","ror":"https://ror.org/019wvm592","country_code":"AU","type":"education","lineage":["https://openalex.org/I118347636"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Qing Wang","raw_affiliation_strings":["Australian National University, Canberra, Australia"],"affiliations":[{"raw_affiliation_string":"Australian National University, Canberra, Australia","institution_ids":["https://openalex.org/I118347636"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Henning Koehler","orcid":null},"institutions":[{"id":"https://openalex.org/I51158804","display_name":"Massey University","ror":"https://ror.org/052czxv31","country_code":"NZ","type":"education","lineage":["https://openalex.org/I51158804"]}],"countries":["NZ"],"is_corresponding":false,"raw_author_name":"Henning Koehler","raw_affiliation_strings":["Massey University, Palmerston North, New Zealand"],"affiliations":[{"raw_affiliation_string":"Massey University, Palmerston North, New Zealand","institution_ids":["https://openalex.org/I51158804"]}]},{"author_position":"last","author":{"id":null,"display_name":"Yu Lin","orcid":null},"institutions":[{"id":"https://openalex.org/I118347636","display_name":"Australian National University","ror":"https://ror.org/019wvm592","country_code":"AU","type":"education","lineage":["https://openalex.org/I118347636"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Yu Lin","raw_affiliation_strings":["Australian National University, Canberra, Australia"],"affiliations":[{"raw_affiliation_string":"Australian National University, Canberra, Australia","institution_ids":["https://openalex.org/I118347636"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I118347636"],"apc_list":null,"apc_paid":null,"fwci":2.0007,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.86927052,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":93,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1946","last_page":"1958"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9987999796867371,"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.9987999796867371,"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.9925000071525574,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9918000102043152,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.6830999851226807},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.542900025844574},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.4657999873161316},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.39989998936653137},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.3873000144958496},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.3327000141143799},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.32600000500679016},{"id":"https://openalex.org/keywords/graph-property","display_name":"Graph property","score":0.29499998688697815}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6830999851226807},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6061000227928162},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.542900025844574},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5135999917984009},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.4657999873161316},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39989998936653137},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.3873000144958496},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3700999915599823},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34630000591278076},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.3327000141143799},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.32600000500679016},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.299699991941452},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.29499998688697815},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.2924000024795532},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.2921999990940094},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.29100000858306885},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.28529998660087585},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.26499998569488525},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.2606000006198883},{"id":"https://openalex.org/C7036158","wikidata":"https://www.wikidata.org/wiki/Q3385162","display_name":"Graph homomorphism","level":5,"score":0.26030001044273376},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25839999318122864},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.2513999938964844}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3448016.3452826","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3448016.3452826","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2021 International Conference on Management of Data","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2104.09733","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2104.09733","pdf_url":"https://arxiv.org/pdf/2104.09733","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:openresearch-repository.anu.edu.au:1885/315724","is_oa":false,"landing_page_url":"http://hdl.handle.net/1885/315724","pdf_url":null,"source":{"id":"https://openalex.org/S4306402539","display_name":"ANU Open Research (Australian National University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I118347636","host_organization_name":"Australian National University","host_organization_lineage":["https://openalex.org/I118347636"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIGMOD/PODS '21: Proceedings of the 2021 International Conference on Management of Data","raw_type":"Conference paper"},{"id":"pmh:oai:openresearch-repository.anu.edu.au:1885/733752830","is_oa":false,"landing_page_url":"https://hdl.handle.net/1885/733752830","pdf_url":null,"source":{"id":"https://openalex.org/S4306402539","display_name":"ANU Open Research (Australian National University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I118347636","host_organization_name":"Australian National University","host_organization_lineage":["https://openalex.org/I118347636"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the ACM SIGMOD International Conference on Management of Data","raw_type":"Conference paper"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2104.09733","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2104.09733","pdf_url":"https://arxiv.org/pdf/2104.09733","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W131619556","https://openalex.org/W1487146975","https://openalex.org/W1493214567","https://openalex.org/W1982184342","https://openalex.org/W1992229444","https://openalex.org/W1994924587","https://openalex.org/W2002767638","https://openalex.org/W2002838096","https://openalex.org/W2005945380","https://openalex.org/W2008018349","https://openalex.org/W2020880764","https://openalex.org/W2040122307","https://openalex.org/W2041172083","https://openalex.org/W2041916017","https://openalex.org/W2056403031","https://openalex.org/W2098636939","https://openalex.org/W2099083325","https://openalex.org/W2102842495","https://openalex.org/W2110452945","https://openalex.org/W2121815516","https://openalex.org/W2140271346","https://openalex.org/W2146583842","https://openalex.org/W2151400766","https://openalex.org/W2172107427","https://openalex.org/W2538876901","https://openalex.org/W2754517646","https://openalex.org/W2764587448","https://openalex.org/W4293232152"],"related_works":[],"abstract_inverted_index":{"Computing":[0],"shortest":[1,16,66,72,139],"paths":[2,17,73,140],"is":[3,85],"a":[4,38,49,65,110,128,204],"fundamental":[5],"operation":[6],"in":[7,37,48,141,195],"processing":[8],"graph":[9,68],"data.":[10],"In":[11,52],"many":[12],"real-world":[13,170],"applications,":[14],"discovering":[15],"between":[18,46,74],"two":[19],"vertices":[20,34,79,101,180],"empowers":[21],"us":[22],"to":[23,31,62,86,94,123],"make":[24],"full":[25],"use":[26],"of":[27,43,78,100,138,150,163],"the":[28,41,57,134,148,161,174],"underlying":[29],"structure":[30],"understand":[32],"how":[33],"are":[35],"related":[36],"graph,":[39],"e.g.":[40],"strength":[42],"social":[44,50],"ties":[45],"individuals":[47],"network.":[51],"this":[53,151],"paper,":[54],"we":[55,108,165],"study":[56],"shortest-path-graph":[58,143,193],"problem":[59],"that":[60,91,132,189],"aims":[61],"efficiently":[63,116],"compute":[64],"path":[67],"containing":[69],"exactly":[70],"all":[71],"any":[75],"arbitrary":[76],"pair":[77],"on":[80,168],"complex":[81],"networks.":[82],"Our":[83],"goal":[84],"design":[87],"an":[88],"exact":[89],"solution":[90],"can":[92,191],"scale":[93],"graphs":[95,199],"with":[96],"millions":[97],"or":[98],"billions":[99],"and":[102,153,181,200],"edges.":[103,184],"To":[104,158],"achieve":[105],"high":[106],"scalability,":[107],"propose":[109],"novel":[111],"method,":[112],"Query-by-Sketch":[113],"(QbS),":[114],"which":[115,173],"leverages":[117],"offline":[118],"labelling":[119],"(i.e.,":[120],"precomputed":[121],"labels)":[122],"guide":[124],"online":[125],"searching":[126],"through":[127],"fast":[129],"sketching":[130],"process":[131],"summarizes":[133],"important":[135],"structural":[136],"aspects":[137],"answering":[142],"queries.":[144],"We":[145],"theoretically":[146],"prove":[147],"correctness":[149],"method":[152],"analyze":[154],"its":[155],"computational":[156],"complexity.":[157],"empirically":[159],"verify":[160],"efficiency":[162],"QbS,":[164],"conduct":[166],"experiments":[167],"12":[169],"datasets,":[171],"among":[172],"largest":[175],"dataset":[176],"has":[177],"1.7":[178],"billion":[179,183],"7.8":[182],"The":[185],"experimental":[186],"results":[187],"show":[188],"QbS":[190],"answer":[192],"queries":[194],"microseconds":[196],"for":[197,206],"million-scale":[198],"less":[201],"than":[202],"half":[203],"second":[205],"billion-scale":[207],"graphs.":[208]},"counts_by_year":[{"year":2025,"cited_by_count":10},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2021-04-26T00:00:00"}