{"id":"https://openalex.org/W1968401677","doi":"https://doi.org/10.1145/1929934.1929941","title":"Path-tree","display_name":"Path-tree","publication_year":2011,"publication_date":"2011-03-01","ids":{"openalex":"https://openalex.org/W1968401677","doi":"https://doi.org/10.1145/1929934.1929941","mag":"1968401677"},"language":"en","primary_location":{"id":"doi:10.1145/1929934.1929941","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1929934.1929941","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/A5103270436","display_name":"Ruoming Jin","orcid":"https://orcid.org/0000-0003-1895-4243"},"institutions":[{"id":"https://openalex.org/I149910238","display_name":"Kent State University","ror":"https://ror.org/049pfb863","country_code":"US","type":"education","lineage":["https://openalex.org/I149910238"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ruoming Jin","raw_affiliation_strings":["Kent State University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Kent State University","institution_ids":["https://openalex.org/I149910238"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063179211","display_name":"Ning Ruan","orcid":"https://orcid.org/0000-0001-8285-9430"},"institutions":[{"id":"https://openalex.org/I149910238","display_name":"Kent State University","ror":"https://ror.org/049pfb863","country_code":"US","type":"education","lineage":["https://openalex.org/I149910238"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ning Ruan","raw_affiliation_strings":["Kent State University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Kent State University","institution_ids":["https://openalex.org/I149910238"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101632572","display_name":"Yang Xiang","orcid":"https://orcid.org/0000-0003-1395-6805"},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yang Xiang","raw_affiliation_strings":["The Ohio State University","the Ohio State University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Ohio State University","institution_ids":["https://openalex.org/I52357470"]},{"raw_affiliation_string":"the Ohio State University","institution_ids":["https://openalex.org/I52357470"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063351917","display_name":"Haixun Wang","orcid":"https://orcid.org/0009-0007-0773-7004"},"institutions":[{"id":"https://openalex.org/I4210113369","display_name":"Microsoft Research Asia (China)","ror":"https://ror.org/0300m5276","country_code":"CN","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210113369"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Haixun Wang","raw_affiliation_strings":["Microsoft Research Asia","Microsoft Research Asia,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research Asia","institution_ids":["https://openalex.org/I4210113369"]},{"raw_affiliation_string":"Microsoft Research Asia,","institution_ids":["https://openalex.org/I4210113369"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.0672,"has_fulltext":false,"cited_by_count":74,"citation_normalized_percentile":{"value":0.96723194,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"36","issue":"1","first_page":"1","last_page":"44"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"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.9998999834060669,"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.9998000264167786,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9995999932289124,"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/reachability","display_name":"Reachability","score":0.8930097818374634},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7957614660263062},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5814539194107056},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5409541726112366},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48384442925453186},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.45788538455963135},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.41539299488067627},{"id":"https://openalex.org/keywords/segment-tree","display_name":"Segment tree","score":0.41011151671409607},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.40697455406188965},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.29952144622802734},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.27703940868377686},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19246569275856018},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.06930223107337952}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8930097818374634},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7957614660263062},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5814539194107056},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5409541726112366},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48384442925453186},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45788538455963135},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.41539299488067627},{"id":"https://openalex.org/C94557470","wikidata":"https://www.wikidata.org/wiki/Q2377385","display_name":"Segment tree","level":5,"score":0.41011151671409607},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.40697455406188965},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29952144622802734},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.27703940868377686},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19246569275856018},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.06930223107337952},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1929934.1929941","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1929934.1929941","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G167417317","display_name":null,"funder_award_id":"IIS-0953950#1019343","funder_id":"https://openalex.org/F4320337389","funder_display_name":"Division of Information and Intelligent Systems"}],"funders":[{"id":"https://openalex.org/F4320337389","display_name":"Division of Information and Intelligent Systems","ror":"https://ror.org/053a2cp42"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1502577746","https://openalex.org/W1552561242","https://openalex.org/W1553945535","https://openalex.org/W1690273063","https://openalex.org/W1965109038","https://openalex.org/W1968895412","https://openalex.org/W1982512167","https://openalex.org/W1994246862","https://openalex.org/W1994924587","https://openalex.org/W2017139167","https://openalex.org/W2031251427","https://openalex.org/W2043655327","https://openalex.org/W2044935944","https://openalex.org/W2059355721","https://openalex.org/W2076109400","https://openalex.org/W2078331965","https://openalex.org/W2092251403","https://openalex.org/W2102563702","https://openalex.org/W2105848461","https://openalex.org/W2108781142","https://openalex.org/W2149906774","https://openalex.org/W2154713079","https://openalex.org/W2168924255","https://openalex.org/W3145128584","https://openalex.org/W4235794864","https://openalex.org/W4246185962","https://openalex.org/W4254807835","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2227684440","https://openalex.org/W2156833871","https://openalex.org/W1521720839","https://openalex.org/W2160311168","https://openalex.org/W2083751087","https://openalex.org/W3205563779","https://openalex.org/W2779092424","https://openalex.org/W2150988524","https://openalex.org/W2107390755","https://openalex.org/W2565099770"],"abstract_inverted_index":{"Reachability":[0],"query":[1,79],"is":[2,18,109],"one":[3],"of":[4,62,113,136,186],"the":[5,27,37,71,75,78,83,158,182],"fundamental":[6],"queries":[7,17],"in":[8,64,115],"graph":[9,93],"database.":[10],"The":[11,106],"main":[12],"idea":[13],"behind":[14],"answering":[15,80],"reachability":[16,28,49],"to":[19,57,69,96,100,125,155],"assign":[20],"vertices":[21,32,63,150],"with":[22,151],"certain":[23],"labels":[24,153],"such":[25],"that":[26],"between":[29],"any":[30],"two":[31],"can":[33,122,129],"be":[34,123],"determined":[35],"by":[36],"labeling":[38,76,102,132,159],"information.":[39],"Though":[40],"several":[41],"approaches":[42],"have":[43],"been":[44],"proposed":[45],"for":[46,171],"building":[47],"these":[48],"labels,":[50],"it":[51],"remains":[52],"open":[53],"issues":[54],"on":[55],"how":[56,68],"handle":[58],"increasingly":[59],"large":[60,104],"number":[61],"real-world":[65],"graphs,":[66],"and":[67,82,138,180,184],"find":[70],"best":[72],"tradeoff":[73],"among":[74],"size,":[77],"time,":[81],"construction":[84],"time.":[85],"In":[86,161],"this":[87],"article,":[88],"we":[89,141,163,176],"introduce":[90,143],"a":[91,110,116,144],"novel":[92],"structure,":[94],"referred":[95],"as":[97],"path-tree":[98,107,121,137],",":[99],"help":[101],"very":[103],"graphs.":[105],"cover":[108],"spanning":[111],"subgraph":[112],"G":[114],"tree":[117],"shape.":[118],"We":[119],"show":[120],"generalized":[124],"chain-tree":[126,139],"which":[127,148],"theoretically":[128],"has":[130],"smaller":[131],"cost.":[133],"On":[134],"top":[135],"index,":[140],"also":[142,164],"new":[145,188],"compression":[146],"scheme":[147],"groups":[149],"similar":[152],"together":[154],"further":[156],"reduce":[157],"size.":[160],"addition,":[162],"propose":[165],"an":[166],"efficient":[167],"incremental":[168],"update":[169],"algorithm":[170],"dynamic":[172],"index":[173],"maintenance.":[174],"Finally,":[175],"demonstrate":[177],"both":[178],"analytically":[179],"empirically":[181],"effectiveness":[183],"efficiency":[185],"our":[187],"approaches.":[189]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":12},{"year":2012,"cited_by_count":3}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2016-06-24T00:00:00"}