{"id":"https://openalex.org/W2043655327","doi":"https://doi.org/10.1145/1376616.1376677","title":"Efficiently answering reachability queries on very large directed graphs","display_name":"Efficiently answering reachability queries on very large directed graphs","publication_year":2008,"publication_date":"2008-06-09","ids":{"openalex":"https://openalex.org/W2043655327","doi":"https://doi.org/10.1145/1376616.1376677","mag":"2043655327"},"language":"en","primary_location":{"id":"doi:10.1145/1376616.1376677","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1376616.1376677","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2008 ACM SIGMOD international conference on Management of data","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/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":true,"raw_author_name":"Ruoming Jin","raw_affiliation_strings":["Kent State University, Kent, OH, USA"],"affiliations":[{"raw_affiliation_string":"Kent State University, Kent, OH, USA","institution_ids":["https://openalex.org/I149910238"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100666554","display_name":"Yang Xiang","orcid":"https://orcid.org/0000-0001-5252-0831"},"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":"Yang Xiang","raw_affiliation_strings":["Kent State University, Kent, OH, USA"],"affiliations":[{"raw_affiliation_string":"Kent State University, Kent, OH, USA","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, Kent, OH, USA"],"affiliations":[{"raw_affiliation_string":"Kent State University, Kent, OH, USA","institution_ids":["https://openalex.org/I149910238"]}]},{"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/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Haixun Wang","raw_affiliation_strings":["IBM T.J. Watson Research, Hawthorne, NY, USA"],"affiliations":[{"raw_affiliation_string":"IBM T.J. Watson Research, Hawthorne, NY, USA","institution_ids":["https://openalex.org/I1341412227"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5103270436"],"corresponding_institution_ids":["https://openalex.org/I149910238"],"apc_list":null,"apc_paid":null,"fwci":17.4724,"has_fulltext":false,"cited_by_count":162,"citation_normalized_percentile":{"value":0.99439739,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"595","last_page":"608"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"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.9998999834060669,"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.9998000264167786,"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"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9991000294685364,"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/reachability","display_name":"Reachability","score":0.9109677076339722},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7282325625419617},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5421150922775269},{"id":"https://openalex.org/keywords/graph-database","display_name":"Graph database","score":0.46246403455734253},{"id":"https://openalex.org/keywords/modular-decomposition","display_name":"Modular decomposition","score":0.4232070744037628},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4211021363735199},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41882967948913574},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.3349573016166687},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.20577552914619446}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9109677076339722},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7282325625419617},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5421150922775269},{"id":"https://openalex.org/C176225458","wikidata":"https://www.wikidata.org/wiki/Q595971","display_name":"Graph database","level":3,"score":0.46246403455734253},{"id":"https://openalex.org/C187407849","wikidata":"https://www.wikidata.org/wiki/Q6889712","display_name":"Modular decomposition","level":5,"score":0.4232070744037628},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4211021363735199},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41882967948913574},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.3349573016166687},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.20577552914619446}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/1376616.1376677","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1376616.1376677","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2008 ACM SIGMOD international conference on Management of data","raw_type":"proceedings-article"},{"id":"pmh:vital:7494","is_oa":false,"landing_page_url":"http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/76130","pdf_url":null,"source":{"id":"https://openalex.org/S4306400234","display_name":"FedUni ResearchOnline (Federation University Australia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210158496","host_organization_name":"Australian Federation of University Women \u2013 South Australia","host_organization_lineage":["https://openalex.org/I4210158496"],"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:CiteSeerX.psu:10.1.1.141.7773","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.141.7773","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://magna.cs.ucla.edu/~hxwang/publications/sigmod08.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.142.3975","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.142.3975","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.kent.edu/~jin/Papers/SIGMOD08.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"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/W1982512167","https://openalex.org/W2017139167","https://openalex.org/W2031251427","https://openalex.org/W2054100908","https://openalex.org/W2076109400","https://openalex.org/W2092251403","https://openalex.org/W2102563702","https://openalex.org/W2149906774","https://openalex.org/W2752885492","https://openalex.org/W4235794864","https://openalex.org/W4242246215","https://openalex.org/W4246185962","https://openalex.org/W6649045865"],"related_works":["https://openalex.org/W2970143390","https://openalex.org/W2031276298","https://openalex.org/W4299811717","https://openalex.org/W2952233599","https://openalex.org/W1566820354","https://openalex.org/W577041502","https://openalex.org/W2093949146","https://openalex.org/W1892973443","https://openalex.org/W2256054477","https://openalex.org/W3130332934"],"abstract_inverted_index":{"Efficiently":[0],"processing":[1],"queries":[2,46,72],"against":[3],"very":[4,184],"large":[5,132,185],"graphs":[6,74,140,142],"is":[7,75,89,190],"an":[8],"important":[9],"research":[10,42],"topic":[11],"largely":[12],"driven":[13],"by":[14,105],"emerging":[15],"real":[16,138],"world":[17,139],"applications,":[18],"as":[19,21,44,58,179],"diverse":[20],"XML":[22],"databases,":[23,53],"GIS,":[24],"web":[25],"mining,":[26],"social":[27],"network":[28],"analysis,":[29],"ontologies,":[30],"and":[31,125,152,204],"bioinformatics.":[32],"In":[33,168],"particular,":[34],"graph":[35,52,64,88,175],"reachability":[36,45,71,81,97,116],"has":[37],"attracted":[38],"a":[39,173,191,197],"lot":[40],"of":[41,134,147,155,194,208],"attention":[43],"are":[47,120],"not":[48],"only":[49],"common":[50],"on":[51,80],"but":[54],"they":[55],"also":[56],"serve":[57],"fundamental":[59],"operations":[60],"for":[61,113],"many":[62,137],"other":[63],"queries.":[65],"The":[66,187],"main":[67],"idea":[68],"behind":[69],"answering":[70],"in":[73,86,136,196],"to":[76,130,165,178,181],"build":[77],"indices":[78],"based":[79],"labels.":[82,107],"Essentially,":[83],"each":[84],"vertex":[85],"the":[87,96,131,149,156,206],"assigned":[90],"with":[91],"certain":[92],"labels":[93,157],"such":[94],"that":[95],"between":[98],"any":[99],"two":[100],"vertices":[101,135],"can":[102,143],"be":[103,166],"determined":[104],"their":[106],"Several":[108],"approaches":[109],"have":[110],"been":[111],"proposed":[112],"building":[114],"these":[115],"labels;":[117],"among":[118],"them":[119],"interval":[121],"labeling":[122,183],"(tree":[123],"cover)":[124],"2-hop":[126],"labeling.":[127],"However,":[128],"due":[129],"number":[133],"(some":[141],"easily":[144],"contain":[145],"millions":[146],"vertices),":[148],"computational":[150],"cost":[151],"(index)":[153],"size":[154],"using":[158],"existing":[159],"methods":[160],"would":[161],"prove":[162],"too":[163],"expensive":[164],"practical.":[167],"this":[169],"paper,":[170],"we":[171],"introduce":[172],"novel":[174],"structure,":[176],"referred":[177],"path-tree,":[180],"help":[182],"graphs.":[186],"path-tree":[188],"cover":[189],"spanning":[192],"subgraph":[193],"G":[195],"tree":[198],"shape.":[199],"We":[200],"demonstrate":[201],"both":[202],"analytically":[203],"empirically":[205],"effectiveness":[207],"our":[209],"new":[210],"approaches.":[211]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":11},{"year":2013,"cited_by_count":13},{"year":2012,"cited_by_count":17}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}