{"id":"https://openalex.org/W4387635394","doi":"https://doi.org/10.48550/arxiv.2310.08213","title":"A Universal Scheme for Partitioned Dynamic Shortest Path Index","display_name":"A Universal Scheme for Partitioned Dynamic Shortest Path Index","publication_year":2023,"publication_date":"2023-01-01","ids":{"openalex":"https://openalex.org/W4387635394","doi":"https://doi.org/10.48550/arxiv.2310.08213"},"language":"en","primary_location":{"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2310.08213","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_indexed_in_scopus":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":["Cornell University"],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false},"type":"preprint","type_crossref":"posted-content","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/abs/2310.08213","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5020737490","display_name":"Mengxuan Zhang","orcid":"https://orcid.org/0000-0001-8155-4942"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhang, Mengxuan","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101501383","display_name":"Xinjie Zhou","orcid":"https://orcid.org/0000-0002-0306-737X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhou, Xinjie","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5104342696","display_name":"Lei Li","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li, Lei","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100383205","display_name":"Ziyi Liu","orcid":"https://orcid.org/0000-0002-2468-3104"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Liu, Ziyi","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086447943","display_name":"Goce Trajcevski","orcid":"https://orcid.org/0000-0002-8839-6278"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Trajcevski, Goce","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053838315","display_name":"Yan Huang","orcid":"https://orcid.org/0000-0001-9136-195X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Huang, Yan","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5011384237","display_name":"Xiaofang Zhou","orcid":"https://orcid.org/0000-0001-6343-1455"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhou, Xiaofang","raw_affiliation_strings":[],"affiliations":[]}],"institution_assertions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.77057,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":67,"max":78},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9989,"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.9989,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9897,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.9839,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.5950785}],"concepts":[{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.7190524},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6525135},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.64761364},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.6402746},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.5950785},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5404104},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.49970984},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.492426},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.43667436},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.41152078},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39055258},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38485754},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31139332},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1284354},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2310.08213","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_indexed_in_scopus":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":["Cornell University"],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false},{"is_oa":true,"landing_page_url":"http://arxiv.org/abs/2310.08213","pdf_url":"http://arxiv.org/pdf/2310.08213","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_indexed_in_scopus":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":["Cornell University"],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false},{"is_oa":false,"landing_page_url":"https://api.datacite.org/dois/10.48550/arxiv.2310.08213","pdf_url":null,"source":{"id":"https://openalex.org/S4393179698","display_name":"DataCite API","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_indexed_in_scopus":false,"is_core":false,"host_organization":"https://openalex.org/I4210145204","host_organization_name":"DataCite","host_organization_lineage":["https://openalex.org/I4210145204"],"host_organization_lineage_names":["DataCite"],"type":"metadata"},"license":null,"license_id":null,"version":null}],"best_oa_location":{"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2310.08213","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_indexed_in_scopus":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":["Cornell University"],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false},"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W78690942","https://openalex.org/W4285687848","https://openalex.org/W4221129498","https://openalex.org/W3216780016","https://openalex.org/W2982088850","https://openalex.org/W2887026015","https://openalex.org/W2886722595","https://openalex.org/W2394042577","https://openalex.org/W2361442013","https://openalex.org/W223921116"],"abstract_inverted_index":{"Graph":[0],"partitioning":[1,127],"is":[2,17,42],"a":[3,27,32,72,89,124],"common":[4],"solution":[5],"to":[6,92,109,152],"scale":[7],"up":[8],"the":[9,22,45,52,60,76,84,139,165,175],"graph":[10,126],"algorithms,":[11],"and":[12,36,48,87,106,149],"shortest":[13],"path":[14,34,49,147],"(SP)":[15],"computation":[16],"one":[18,107],"of":[19,63,118,177],"them.":[20],"However,":[21],"existing":[23,85],"solutions":[24],"typically":[25],"have":[26,58],"fixed":[28,33,37],"partition":[29,38,46,132,150],"method":[30,47,133],"with":[31,184],"index":[35,50,61,104,111,116,145],"structure,":[39],"so":[40],"it":[41],"unclear":[43],"how":[44],"influence":[51],"pathfinding":[53],"performance.":[54],"Moreover,":[55],"few":[56],"studies":[57],"explored":[59],"maintenance":[62,117],"partitioned":[64,103,156],"SP":[65,157],"(PSP)":[66],"on":[67,83,169],"dynamic":[68,77],"graphs.":[69],"To":[70],"provide":[71],"deeper":[73],"insight":[74],"into":[75],"PSP":[78,119,186],"indexes,":[79],"we":[80,98,122,137,173],"systematically":[81],"deliberate":[82],"works":[86],"propose":[88,100,123,153],"universal":[90],"scheme":[91,143],"analyze":[93],"this":[94],"problem":[95],"theoretically.":[96],"Specifically,":[97],"first":[99],"two":[101],"novel":[102],"strategies":[105],"optimization":[108],"improve":[110],"construction,":[112],"query":[113,166],"answering,":[114],"or":[115,167],"index.":[120],"Then":[121],"path-oriented":[125],"classification":[128],"criteria":[129],"for":[130],"easier":[131],"selection.":[134],"After":[135],"that,":[136],"re-couple":[138],"dimensions":[140],"in":[141,164],"our":[142,178],"(partitioned":[144],"strategy,":[146],"index,":[148],"structure)":[151],"five":[154],"new":[155,179],"indexes":[158,180,187],"that":[159],"are":[160],"more":[161],"efficient":[162],"either":[163],"update":[168],"different":[170],"networks.":[171],"Finally,":[172],"demonstrate":[174],"effectiveness":[176],"by":[181],"comparing":[182],"them":[183],"state-of-the-art":[185],"through":[188],"comprehensive":[189],"evaluations.":[190]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W4387635394","counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-01-19T02:12:56.944891","created_date":"2023-10-14"}