{"id":"https://openalex.org/W1989894867","doi":"https://doi.org/10.1145/1516360.1516417","title":"On-line exact shortest distance query processing","display_name":"On-line exact shortest distance query processing","publication_year":2009,"publication_date":"2009-03-24","ids":{"openalex":"https://openalex.org/W1989894867","doi":"https://doi.org/10.1145/1516360.1516417","mag":"1989894867"},"language":"en","primary_location":{"id":"doi:10.1145/1516360.1516417","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1516360.1516417","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology","raw_type":"proceedings-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/A5103340525","display_name":"Jiefeng Cheng","orcid":null},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Jiefeng Cheng","raw_affiliation_strings":["The Chinese University of Hong Kong, China","The Chinese University of Hong Kong, China#TAB#"],"affiliations":[{"raw_affiliation_string":"The Chinese University of Hong Kong, China","institution_ids":["https://openalex.org/I177725633"]},{"raw_affiliation_string":"The Chinese University of Hong Kong, China#TAB#","institution_ids":["https://openalex.org/I177725633"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075642293","display_name":"Jeffrey Xu Yu","orcid":"https://orcid.org/0000-0002-9738-827X"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jeffrey Xu Yu","raw_affiliation_strings":["The Chinese University of Hong Kong, China","The Chinese University of Hong Kong, China#TAB#"],"affiliations":[{"raw_affiliation_string":"The Chinese University of Hong Kong, China","institution_ids":["https://openalex.org/I177725633"]},{"raw_affiliation_string":"The Chinese University of Hong Kong, China#TAB#","institution_ids":["https://openalex.org/I177725633"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5103340525"],"corresponding_institution_ids":["https://openalex.org/I177725633"],"apc_list":null,"apc_paid":null,"fwci":8.5704,"has_fulltext":false,"cited_by_count":68,"citation_normalized_percentile":{"value":0.98229443,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"481","last_page":"492"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9997000098228455,"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.9997000098228455,"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.9991999864578247,"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.9988999962806702,"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/computer-science","display_name":"Computer science","score":0.7385801672935486},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6649851202964783},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.5541634559631348},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5286241769790649},{"id":"https://openalex.org/keywords/encode","display_name":"ENCODE","score":0.5127342939376831},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.4270576238632202},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.368776798248291}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7385801672935486},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6649851202964783},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.5541634559631348},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5286241769790649},{"id":"https://openalex.org/C66746571","wikidata":"https://www.wikidata.org/wiki/Q1134833","display_name":"ENCODE","level":3,"score":0.5127342939376831},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4270576238632202},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.368776798248291},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1516360.1516417","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1516360.1516417","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.517.8958","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.517.8958","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.edbt.org/Proceedings/2009-StPetersburg/edbt/papers/p0481-Jiefeng.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1697273966","display_name":null,"funder_award_id":"418206","funder_id":"https://openalex.org/F4320321592","funder_display_name":"Research Grants Council, University Grants Committee"}],"funders":[{"id":"https://openalex.org/F4320321592","display_name":"Research Grants Council, University Grants Committee","ror":"https://ror.org/00djwmt25"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W950821216","https://openalex.org/W1502577746","https://openalex.org/W1553945535","https://openalex.org/W1690273063","https://openalex.org/W1810931192","https://openalex.org/W1965109038","https://openalex.org/W1967140769","https://openalex.org/W1971788485","https://openalex.org/W1981585544","https://openalex.org/W2003454341","https://openalex.org/W2007572995","https://openalex.org/W2034501275","https://openalex.org/W2035494495","https://openalex.org/W2043655327","https://openalex.org/W2049500052","https://openalex.org/W2054100908","https://openalex.org/W2061820396","https://openalex.org/W2076109400","https://openalex.org/W2078007422","https://openalex.org/W2083342911","https://openalex.org/W2086729610","https://openalex.org/W2092251403","https://openalex.org/W2093455937","https://openalex.org/W2101282805","https://openalex.org/W2102563702","https://openalex.org/W2108078368","https://openalex.org/W2111667217","https://openalex.org/W2114734373","https://openalex.org/W2131237536","https://openalex.org/W2136442765","https://openalex.org/W2151400766","https://openalex.org/W2152776677","https://openalex.org/W2153319198","https://openalex.org/W2154356512","https://openalex.org/W2158700338","https://openalex.org/W2160495255","https://openalex.org/W2169528473","https://openalex.org/W2227557434","https://openalex.org/W2230830246","https://openalex.org/W2281218127","https://openalex.org/W2432978112","https://openalex.org/W3145128584","https://openalex.org/W4235794864","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2018146256","https://openalex.org/W4293054712","https://openalex.org/W2347245430","https://openalex.org/W3149063625","https://openalex.org/W3032870653","https://openalex.org/W2198982833","https://openalex.org/W2375775343","https://openalex.org/W2094515718","https://openalex.org/W2052950624","https://openalex.org/W2237480599"],"abstract_inverted_index":{"Shortest-path":[0],"query":[1,43,88,101],"processing":[2],"not":[3],"only":[4],"serves":[5],"as":[6],"a":[7,34,161],"long":[8],"established":[9],"routine":[10],"for":[11],"numerous":[12],"applications":[13,27],"in":[14,28,72,129,163,185],"the":[15,39,77,91,127,156,183,222],"past":[16],"but":[17],"also":[18],"is":[19,38],"of":[20,94,160,224],"increasing":[21],"popularity":[22],"to":[23,42,49,75,83,85,110,113,131,142,176],"support":[24,86,114],"novel":[25],"graph":[26,73,128,162,174],"very":[29],"large":[30,35,213],"databases":[31],"nowadays.":[32],"For":[33],"graph,":[36],"there":[37],"new":[40,227],"scenario":[41],"intensively":[44],"against":[45],"arbitrary":[46],"nodes,":[47],"asking":[48],"quickly":[50],"return":[51],"node":[52,134,188],"distance":[53,111,135,189],"or":[54],"even":[55],"shortest":[56,64,117,158,195,206],"paths.":[57],"And":[58],"traditional":[59],"main":[60],"memory":[61],"algorithms":[62],"and":[63,80,173,191,220],"paths":[65,159,196],"materialization":[66],"become":[67],"inadequate.":[68],"We":[69,145,215],"are":[70],"interested":[71],"labelings":[74,112,122],"encode":[76,155],"underlying":[78],"graphs":[79],"assign":[81],"labels":[82],"nodes":[84],"efficient":[87],"processing.":[89],"Surprisingly,":[90],"existing":[92,140],"work":[93],"this":[95],"category":[96],"mainly":[97],"emphasizes":[98],"on":[99,126,147],"reachability":[100],"processing,":[102],"while":[103,179],"no":[104],"sufficient":[105],"effort":[106],"has":[107],"been":[108],"given":[109],"querying":[115],"exact":[116],"distances":[118],"between":[119],"nodes.":[120],"Distance":[121],"must":[123],"be":[124,143,210],"developed":[125],"whole":[130],"correctly":[132,186],"retain":[133],"information.":[136],"It":[137],"makes":[138],"many":[139],"methods":[141],"inapplicable.":[144],"focus":[146],"fast":[148],"computing":[149],"distance-aware":[150],"2-hop":[151],"covers,":[152],"which":[153,208],"can":[154,181,209],"all-pairs":[157,194,205],"O(|V|\u00b7|E|1/2)":[164],"space.":[165],"Our":[166],"approach":[167,202],"exploits":[168],"strongly":[169],"connected":[170],"components":[171],"collapsing":[172],"partitioning":[175],"gain":[177],"speed,":[178],"it":[180],"overcome":[182],"challenges":[184],"retaining":[187],"information":[190],"appropriately":[192],"encoding":[193],"with":[197],"small":[198],"overhead.":[199],"Furthermore,":[200],"our":[201,225],"avoids":[203],"pre-computing":[204],"paths,":[207],"prohibitive":[211],"over":[212],"graphs.":[214],"conducted":[216],"extensive":[217],"performance":[218],"studies,":[219],"confirm":[221],"efficiency":[223],"proposed":[226],"approaches.":[228]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":11},{"year":2012,"cited_by_count":11}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}