{"id":"https://openalex.org/W2051257608","doi":"https://doi.org/10.1145/2389241.2389248","title":"Finding Alternative Shortest Paths in Spatial Networks","display_name":"Finding Alternative Shortest Paths in Spatial Networks","publication_year":2012,"publication_date":"2012-12-01","ids":{"openalex":"https://openalex.org/W2051257608","doi":"https://doi.org/10.1145/2389241.2389248","mag":"2051257608"},"language":"en","primary_location":{"id":"doi:10.1145/2389241.2389248","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2389241.2389248","pdf_url":null,"source":{"id":"https://openalex.org/S90119964","display_name":"ACM Transactions on Database Systems","issn_l":"0362-5915","issn":["0362-5915","1557-4644"],"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":"ACM Transactions on Database Systems","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/A5028885505","display_name":"Kexin Xie","orcid":"https://orcid.org/0000-0003-0766-7206"},"institutions":[{"id":"https://openalex.org/I165143802","display_name":"University of Queensland","ror":"https://ror.org/00rqy9422","country_code":"AU","type":"education","lineage":["https://openalex.org/I165143802"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Kexin Xie","raw_affiliation_strings":["University of Queensland"],"affiliations":[{"raw_affiliation_string":"University of Queensland","institution_ids":["https://openalex.org/I165143802"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101668439","display_name":"Ke Deng","orcid":null},"institutions":[{"id":"https://openalex.org/I165143802","display_name":"University of Queensland","ror":"https://ror.org/00rqy9422","country_code":"AU","type":"education","lineage":["https://openalex.org/I165143802"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Ke Deng","raw_affiliation_strings":["University of Queensland"],"affiliations":[{"raw_affiliation_string":"University of Queensland","institution_ids":["https://openalex.org/I165143802"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102754146","display_name":"Shuo Shang","orcid":"https://orcid.org/0000-0002-1117-2890"},"institutions":[{"id":"https://openalex.org/I165143802","display_name":"University of Queensland","ror":"https://ror.org/00rqy9422","country_code":"AU","type":"education","lineage":["https://openalex.org/I165143802"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Shuo Shang","raw_affiliation_strings":["University of Queensland"],"affiliations":[{"raw_affiliation_string":"University of Queensland","institution_ids":["https://openalex.org/I165143802"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011384237","display_name":"Xiaofang Zhou","orcid":"https://orcid.org/0000-0001-6343-1455"},"institutions":[{"id":"https://openalex.org/I165143802","display_name":"University of Queensland","ror":"https://ror.org/00rqy9422","country_code":"AU","type":"education","lineage":["https://openalex.org/I165143802"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Xiaofang Zhou","raw_affiliation_strings":["University of Queensland"],"affiliations":[{"raw_affiliation_string":"University of Queensland","institution_ids":["https://openalex.org/I165143802"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101619839","display_name":"Kai Zheng","orcid":"https://orcid.org/0000-0003-1996-1699"},"institutions":[{"id":"https://openalex.org/I165143802","display_name":"University of Queensland","ror":"https://ror.org/00rqy9422","country_code":"AU","type":"education","lineage":["https://openalex.org/I165143802"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Kai Zheng","raw_affiliation_strings":["University of Queensland"],"affiliations":[{"raw_affiliation_string":"University of Queensland","institution_ids":["https://openalex.org/I165143802"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5028885505"],"corresponding_institution_ids":["https://openalex.org/I165143802"],"apc_list":null,"apc_paid":null,"fwci":0.4953,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.67106843,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"37","issue":"4","first_page":"1","last_page":"31"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":1.0,"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":1.0,"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.9955999851226807,"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"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9933000206947327,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.8112623691558838},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.7333956956863403},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6916682124137878},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5385231971740723},{"id":"https://openalex.org/keywords/precomputation","display_name":"Precomputation","score":0.5337518453598022},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.522239089012146},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.4859853684902191},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.4752067029476166},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.44125115871429443},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.4329407215118408},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.43123143911361694},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.37503787875175476},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3729779124259949},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.3595670461654663},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.15259113907814026},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.09773442149162292}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8112623691558838},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.7333956956863403},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6916682124137878},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5385231971740723},{"id":"https://openalex.org/C159379195","wikidata":"https://www.wikidata.org/wiki/Q7239568","display_name":"Precomputation","level":3,"score":0.5337518453598022},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.522239089012146},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.4859853684902191},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.4752067029476166},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.44125115871429443},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.4329407215118408},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.43123143911361694},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37503787875175476},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3729779124259949},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.3595670461654663},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.15259113907814026},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.09773442149162292}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/2389241.2389248","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2389241.2389248","pdf_url":null,"source":{"id":"https://openalex.org/S90119964","display_name":"ACM Transactions on Database Systems","issn_l":"0362-5915","issn":["0362-5915","1557-4644"],"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":"ACM Transactions on Database Systems","raw_type":"journal-article"},{"id":"pmh:oai:alma.61RMIT_INST:11247941730001341","is_oa":false,"landing_page_url":"http://doi.org/10.1145/2389241.2389248","pdf_url":null,"source":{"id":"https://openalex.org/S4306402074","display_name":"RMIT Research Repository (RMIT University Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I82951845","host_organization_name":"RMIT University","host_organization_lineage":["https://openalex.org/I82951845"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"pmh:oai:espace.library.uq.edu.au:UQ:290898","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306402388","display_name":"Queensland's institutional digital repository (The University of Queensland)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I165143802","host_organization_name":"The University of Queensland","host_organization_lineage":["https://openalex.org/I165143802"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference Paper"},{"id":"pmh:oai:repository.ust.hk:1783.1-108349","is_oa":false,"landing_page_url":"http://lbdiscover.ust.hk/uresolver?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rfr_id=info:sid/HKUST:SPI&rft.genre=article&rft.issn=0362-5915&rft.volume=37&rft.issue=(4)&rft.date=2012&rft.spage=&rft.aulast=Xie&rft.aufirst=&rft.atitle=Finding+alternative+shortest+paths+in+spatial+networks&rft.title=ACM+Transactions+on+Database+Systems","pdf_url":null,"source":{"id":"https://openalex.org/S4306401796","display_name":"Rare & Special e-Zone (The Hong Kong University of Science and Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I200769079","host_organization_name":"Hong Kong University of Science and Technology","host_organization_lineage":["https://openalex.org/I200769079"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W56894902","https://openalex.org/W1497953515","https://openalex.org/W1554407673","https://openalex.org/W1577501260","https://openalex.org/W1773616669","https://openalex.org/W1829285201","https://openalex.org/W1982440947","https://openalex.org/W1989169588","https://openalex.org/W1999293689","https://openalex.org/W2014889099","https://openalex.org/W2022980325","https://openalex.org/W2061208844","https://openalex.org/W2075543862","https://openalex.org/W2084224084","https://openalex.org/W2087989168","https://openalex.org/W2102842495","https://openalex.org/W2117909275","https://openalex.org/W2121601357","https://openalex.org/W2127151074","https://openalex.org/W2131237536","https://openalex.org/W2134729426","https://openalex.org/W2134874858","https://openalex.org/W2168872671","https://openalex.org/W2169336598","https://openalex.org/W2169528473","https://openalex.org/W2171330332","https://openalex.org/W2171901130","https://openalex.org/W4249653116","https://openalex.org/W4389615663"],"related_works":["https://openalex.org/W2347245430","https://openalex.org/W651485002","https://openalex.org/W4293054712","https://openalex.org/W2094515718","https://openalex.org/W2163460271","https://openalex.org/W2355917270","https://openalex.org/W1994717376","https://openalex.org/W2198982833","https://openalex.org/W2002764510","https://openalex.org/W2170628445"],"abstract_inverted_index":{"Shortest":[0],"path":[1,21,128,140,239],"query":[2,293],"is":[3,63,151,191,302,312,321,334,359],"one":[4,43],"of":[5,36,44,54,163,182,196,220,272,295,305,315,329,355],"the":[6,34,45,50,71,86,89,100,137,180,183,188,197,205,217,243,258,262,270,273,303,308,313,316,327,330,352,356,363],"most":[7],"fundamental":[8],"queries":[9,22],"in":[10,23,60,307],"spatial":[11,61,317,331],"network":[12,62],"databases.":[13],"There":[14],"exist":[15],"algorithms":[16,364],"that":[17,324,351],"can":[18],"process":[19],"shortest":[20,39,102,127,132,139,158,208,238,253],"real":[24,341,346],"time.":[25],"However,":[26],"many":[27],"complex":[28],"applications":[29],"require":[30],"more":[31],"than":[32],"just":[33],"calculation":[35],"a":[37,55,118,142,145,148,194,230,322],"single":[38,124],"path.":[40],"For":[41],"example,":[42],"common":[46],"ways":[47],"to":[48,64,88,152,192,282,337],"determine":[49],"importance":[51],"(or":[52,74,94,107,169,269],"price)":[53],"vertex":[56,72,168,248],"or":[57],"an":[58],"edge":[59,75],"use":[65],"Vickrey":[66],"pricing,":[67],"which":[68,171,236,333],"intuitively":[69],"values":[70],"v":[73,93,106],"e":[76,95,108],")":[77,109,177,268,287,290],"based":[78,120,365],"on":[79,326,345,366],"how":[80],"much":[81],"harder":[82],"for":[83,122,186,340],"travelling":[84],"from":[85,210,261],"sources":[87],"destinations":[90],"without":[91,104],"using":[92,105,117],").":[96,227],"In":[97,112],"such":[98],"cases,":[99],"alternative":[101,126,138,157,207,252],"paths":[103,133,159,209],"are":[110,368],"required.":[111],"this":[113],"article,":[114],"we":[115],"propose":[116,229],"precomputation":[119],"approach":[121,185,215],"both":[123,362],"pair":[125,162],"and":[129,144,154,202,249,319,361],"all":[130,156],"pairs":[131],"processing.":[134],"To":[135],"compute":[136],"between":[141,160,245],"source":[143],"destination":[146],"efficiently,":[147],"na\u00efive":[149,263],"way":[150],"precompute":[153],"store":[155,204],"every":[161,166],"vertices":[164,198,306],"avoiding":[165,247],"possible":[167],"edge),":[170],"requires":[172],"O":[173,221,264,275,283,296],"(":[174,222,265,276,297],"n":[175,223,226,266,277,280,288],"4":[176,267,278],"space.":[178],"Currently,":[179],"state":[181,271],"art":[184,274],"reducing":[187],"storage":[189,231],"cost":[190,354],"choose":[193],"subset":[195],"as":[199],"center":[200,212],"points,":[201],"only":[203],"single-source":[206],"those":[211],"points.":[213],"Such":[214],"has":[216],"space":[218,259,353],"complexity":[219,260],"2":[224],"log":[225,279],"We":[228,255],"scheme":[232],"termed":[233],"iSPQF":[234,358,367],",":[235],"utilizes":[237],"quadtrees":[240],"by":[241],"observing":[242],"relationships":[244],"each":[246],"its":[250],"corresponding":[251],"paths.":[254],"have":[256,349],"reduced":[257],"))":[281],"(min(":[284],"\u03b3,":[285],"L":[286,311],"1.5":[289],"with":[291],"comparable":[292],"performance":[294],"K":[298,301],"),":[299],"where":[300],"number":[304],"returned":[309],"paths,":[310],"diameter":[314],"network,":[318,332],"\u03b3":[320],"value":[323],"depends":[325],"structure":[328],"empirically":[335],"estimated":[336],"be":[338],"40":[339],"road":[342,347],"networks.":[343],"Experiments":[344],"networks":[348],"shown":[350],"proposed":[357],"scalable,":[360],"efficient.":[369]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}