{"id":"https://openalex.org/W2474823404","doi":"https://doi.org/10.14778/2947618.2947623","title":"The shortest path is not always a straight line","display_name":"The shortest path is not always a straight line","publication_year":2016,"publication_date":"2016-05-01","ids":{"openalex":"https://openalex.org/W2474823404","doi":"https://doi.org/10.14778/2947618.2947623","mag":"2474823404"},"language":"en","primary_location":{"id":"doi:10.14778/2947618.2947623","is_oa":false,"landing_page_url":"https://doi.org/10.14778/2947618.2947623","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/A5068567119","display_name":"Vasiliki Kalavri","orcid":"https://orcid.org/0000-0001-8219-4862"},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Vasiliki Kalavri","raw_affiliation_strings":["KTH Royal Institute of Technology, Stockholm, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"KTH Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026852251","display_name":"Tiago Simas","orcid":"https://orcid.org/0000-0002-3133-1537"},"institutions":[{"id":"https://openalex.org/I4210134591","display_name":"Telefonica Research and Development","ror":"https://ror.org/03qgzzb04","country_code":"ES","type":"company","lineage":["https://openalex.org/I4210097190","https://openalex.org/I4210134591"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Tiago Simas","raw_affiliation_strings":["Telefonica Research, Barcelona, Spain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Telefonica Research, Barcelona, Spain","institution_ids":["https://openalex.org/I4210134591"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006816032","display_name":"Dionysios Logothetis","orcid":"https://orcid.org/0009-0006-2501-1074"},"institutions":[{"id":"https://openalex.org/I4210099336","display_name":"Menlo School","ror":"https://ror.org/01240pn49","country_code":"US","type":"education","lineage":["https://openalex.org/I4210099336"]},{"id":"https://openalex.org/I4210114444","display_name":"Meta (United States)","ror":"https://ror.org/01zbnvs85","country_code":"US","type":"company","lineage":["https://openalex.org/I4210114444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dionysios Logothetis","raw_affiliation_strings":["Facebook, Menlo Park, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Facebook, Menlo Park, CA","institution_ids":["https://openalex.org/I4210114444","https://openalex.org/I4210099336"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5068567119"],"corresponding_institution_ids":["https://openalex.org/I86987016"],"apc_list":null,"apc_paid":null,"fwci":2.5341,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":{"value":0.93115202,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"9","issue":"9","first_page":"672","last_page":"683"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998000264167786,"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/T11106","display_name":"Data Management and Algorithms","score":0.9993000030517578,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.996399998664856,"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/computer-science","display_name":"Computer science","score":0.687743067741394},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.602592945098877},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5356521010398865},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.5202575922012329},{"id":"https://openalex.org/keywords/metric-space","display_name":"Metric space","score":0.4430857002735138},{"id":"https://openalex.org/keywords/graph-database","display_name":"Graph database","score":0.428066223859787},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.42172741889953613},{"id":"https://openalex.org/keywords/distance-hereditary-graph","display_name":"Distance-hereditary graph","score":0.4200168251991272},{"id":"https://openalex.org/keywords/block-graph","display_name":"Block graph","score":0.4191249907016754},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.38635414838790894},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33358800411224365},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.25407731533050537},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23203304409980774},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.20385593175888062},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2029975950717926}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.687743067741394},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.602592945098877},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5356521010398865},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.5202575922012329},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.4430857002735138},{"id":"https://openalex.org/C176225458","wikidata":"https://www.wikidata.org/wiki/Q595971","display_name":"Graph database","level":3,"score":0.428066223859787},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.42172741889953613},{"id":"https://openalex.org/C147792647","wikidata":"https://www.wikidata.org/wiki/Q5282847","display_name":"Distance-hereditary graph","level":5,"score":0.4200168251991272},{"id":"https://openalex.org/C43413943","wikidata":"https://www.wikidata.org/wiki/Q4927193","display_name":"Block graph","level":5,"score":0.4191249907016754},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.38635414838790894},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33358800411224365},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.25407731533050537},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23203304409980774},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.20385593175888062},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2029975950717926}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.14778/2947618.2947623","is_oa":false,"landing_page_url":"https://doi.org/10.14778/2947618.2947623","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/8","display_name":"Decent work and economic growth","score":0.550000011920929}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":51,"referenced_works":["https://openalex.org/W329597006","https://openalex.org/W641132676","https://openalex.org/W1448681276","https://openalex.org/W1489509891","https://openalex.org/W1969076407","https://openalex.org/W1970463918","https://openalex.org/W1980466385","https://openalex.org/W1981276685","https://openalex.org/W1991858502","https://openalex.org/W2001185269","https://openalex.org/W2012720017","https://openalex.org/W2016311778","https://openalex.org/W2019040312","https://openalex.org/W2029852131","https://openalex.org/W2047443612","https://openalex.org/W2062680454","https://openalex.org/W2068015060","https://openalex.org/W2070472314","https://openalex.org/W2076447414","https://openalex.org/W2077525424","https://openalex.org/W2082773934","https://openalex.org/W2085426754","https://openalex.org/W2096544401","https://openalex.org/W2096759649","https://openalex.org/W2100132188","https://openalex.org/W2101196063","https://openalex.org/W2108781142","https://openalex.org/W2109469951","https://openalex.org/W2110203109","https://openalex.org/W2110920860","https://openalex.org/W2112090702","https://openalex.org/W2117526408","https://openalex.org/W2123402141","https://openalex.org/W2124326114","https://openalex.org/W2138369586","https://openalex.org/W2143363350","https://openalex.org/W2146530408","https://openalex.org/W2149055390","https://openalex.org/W2153409685","https://openalex.org/W2154454189","https://openalex.org/W2155461593","https://openalex.org/W2162866953","https://openalex.org/W2170616854","https://openalex.org/W2171707538","https://openalex.org/W2396014138","https://openalex.org/W2432978112","https://openalex.org/W2604272474","https://openalex.org/W2620315948","https://openalex.org/W2769133055","https://openalex.org/W2963378502","https://openalex.org/W4245082111"],"related_works":["https://openalex.org/W3213475073","https://openalex.org/W2016823805","https://openalex.org/W2029046796","https://openalex.org/W2031331298","https://openalex.org/W1624237288","https://openalex.org/W1597094575","https://openalex.org/W2046509566","https://openalex.org/W2102094219","https://openalex.org/W1974819867","https://openalex.org/W2086098421"],"abstract_inverted_index":{"In":[0],"this":[1,110],"paper,":[2],"we":[3,62,84,122,138,149,152],"leverage":[4],"the":[5,8,13,23,28,37,43,64,89,92,102,107,129,155,209,213,233,246],"concept":[6],"of":[7,15,31,42,66,91,143,177,194,203,211,228,241],"metric":[9,20,38,93,103,130,156,214],"backbone":[10,21,39,94,104,131,157,215],"to":[11,46,230,243],"improve":[12,63],"efficiency":[14],"large-scale":[16],"graph":[17,45,49,67,76,81,221,236,248],"analytics.":[18],"The":[19],"is":[22],"minimum":[24],"subgraph":[25,202],"that":[26,126,151],"preserves":[27],"shortest":[29],"paths":[30],"a":[32,59,74,80,124,167,174,192,198],"weighted":[33],"graph.":[34],"We":[35,172,187,207,224],"use":[36],"in":[40,183,219,232,245],"place":[41],"original":[44],"compute":[47,101],"various":[48],"metrics":[50],"exactly":[51],"or":[52],"with":[53],"good":[54],"approximation.":[55],"By":[56],"computing":[57,128],"on":[58,70,95,216],"smaller":[60],"graph,":[61],"performance":[65,218],"analytics":[68],"applications":[69],"two":[71,220],"different":[72,144],"systems,":[73],"batch":[75],"processing":[77,249],"system":[78],"and":[79,115,146,148,180,238],"database.":[82],"Further,":[83],"provide":[85,173],"an":[86],"algorithm":[87,179,190],"for":[88,118,134,165],"computation":[90],"large":[96,135,184],"graphs.":[97,120,136],"While":[98],"one":[99],"can":[100,153],"by":[105,158],"solving":[106],"all-pairs-shortest-paths":[108],"problem,":[109],"approach":[111],"incurs":[112],"prohibitive":[113],"time":[114],"space":[116],"complexity":[117],"big":[119],"Instead,":[121],"propose":[123],"heuristic":[125],"makes":[127],"practical":[132],"even":[133],"Additionally,":[137],"analyze":[139],"several":[140],"real":[141,195],"datasets":[142],"sizes":[145],"domains":[147],"show":[150],"approximate":[154],"removing":[159],"only":[160],"first-order":[161],"semi-metric":[162],"edges;":[163],"edges":[164],"which":[166],"shorter":[168],"two-hop":[169],"path":[170],"exists.":[171],"distributed":[175],"implementation":[176],"our":[178,189],"apply":[181],"it":[182],"scale":[185],"scenarios.":[186],"evaluate":[188],"using":[191,212],"variety":[193],"graphs,":[196],"including":[197],"Facebook":[199],"social":[200],"network":[201],"~50":[204],"billion":[205],"edges.":[206],"measure":[208],"impact":[210],"runtime":[217],"management":[222],"systems.":[223],"achieve":[225],"query":[226],"speedups":[227,240],"up":[229,242],"6.7x":[231],"Neo4j":[234],"commercial":[235],"database":[237],"job":[239],"6x":[244],"Giraph":[247],"system.":[250]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":5}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}