{"id":"https://openalex.org/W2430930981","doi":"https://doi.org/10.1145/2882903.2915226","title":"Distributed Set Reachability","display_name":"Distributed Set Reachability","publication_year":2016,"publication_date":"2016-06-14","ids":{"openalex":"https://openalex.org/W2430930981","doi":"https://doi.org/10.1145/2882903.2915226","mag":"2430930981"},"language":"en","primary_location":{"id":"doi:10.1145/2882903.2915226","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2882903.2915226","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2016 International Conference on Management of Data","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://orbilu.uni.lu/bitstream/10993/34050/1/main.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5005866714","display_name":"Sairam Gurajada","orcid":null},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Sairam Gurajada","raw_affiliation_strings":["Max Planck Institute for Informatics, Saarbr\u00fccken, Germany"],"affiliations":[{"raw_affiliation_string":"Max Planck Institute for Informatics, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060837952","display_name":"Martin Theobald","orcid":"https://orcid.org/0000-0003-4067-7609"},"institutions":[{"id":"https://openalex.org/I196349391","display_name":"Universit\u00e4t Ulm","ror":"https://ror.org/032000t02","country_code":"DE","type":"education","lineage":["https://openalex.org/I196349391"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Martin Theobald","raw_affiliation_strings":["University of Ulm, Ulm, Germany"],"affiliations":[{"raw_affiliation_string":"University of Ulm, Ulm, Germany","institution_ids":["https://openalex.org/I196349391"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5005866714"],"corresponding_institution_ids":["https://openalex.org/I4210109712"],"apc_list":null,"apc_paid":null,"fwci":1.6895,"has_fulltext":true,"cited_by_count":19,"citation_normalized_percentile":{"value":0.89290718,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1247","last_page":"1261"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998000264167786,"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.9998000264167786,"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.9966999888420105,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9312896728515625},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7596971988677979},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5743190050125122},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5151830911636353},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4622488021850586},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4148141145706177},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.1701415777206421}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9312896728515625},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7596971988677979},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5743190050125122},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5151830911636353},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4622488021850586},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4148141145706177},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.1701415777206421}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/2882903.2915226","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2882903.2915226","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2016 International Conference on Management of Data","raw_type":"proceedings-article"},{"id":"pmh:oai:orbilu.uni.lu:10993/34050","is_oa":true,"landing_page_url":"https://orbilu.uni.lu/handle/10993/34050","pdf_url":"https://orbilu.uni.lu/bitstream/10993/34050/1/main.pdf","source":{"id":"https://openalex.org/S4306401815","display_name":"Open Repository and Bibliography (University of Luxembourg)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I186903577","host_organization_name":"University of Luxembourg","host_organization_lineage":["https://openalex.org/I186903577"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the 2016 International Conference on Management of Data, SIGMOD Conference 2016, San Francisco, CA, USA, June 26 - July 01, 2016, 1247-1261 (2016); SIGMOD Conference 2016, from 26-06-2016 to 01-07-2016","raw_type":"peer reviewed"},{"id":"pmh:oai:escidoc.org:escidoc:2375697","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-002C-220F-5","pdf_url":null,"source":{"id":"https://openalex.org/S7407052962","display_name":"Max Planck Digital Library","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:pure.mpg.de:item_2375697","is_oa":false,"landing_page_url":"https://hdl.handle.net/11858/00-001M-0000-002C-220F-5","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIGMOD'16","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"pmh:oai:orbilu.uni.lu:10993/34050","is_oa":true,"landing_page_url":"https://orbilu.uni.lu/handle/10993/34050","pdf_url":"https://orbilu.uni.lu/bitstream/10993/34050/1/main.pdf","source":{"id":"https://openalex.org/S4306401815","display_name":"Open Repository and Bibliography (University of Luxembourg)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I186903577","host_organization_name":"University of Luxembourg","host_organization_lineage":["https://openalex.org/I186903577"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the 2016 International Conference on Management of Data, SIGMOD Conference 2016, San Francisco, CA, USA, June 26 - July 01, 2016, 1247-1261 (2016); SIGMOD Conference 2016, from 26-06-2016 to 01-07-2016","raw_type":"peer reviewed"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2430930981.pdf","grobid_xml":"https://content.openalex.org/works/W2430930981.grobid-xml"},"referenced_works_count":43,"referenced_works":["https://openalex.org/W78077100","https://openalex.org/W93447152","https://openalex.org/W134816542","https://openalex.org/W217817341","https://openalex.org/W1507039213","https://openalex.org/W1515993376","https://openalex.org/W1565336402","https://openalex.org/W1593868476","https://openalex.org/W1788180225","https://openalex.org/W1965948320","https://openalex.org/W1968401677","https://openalex.org/W1968748479","https://openalex.org/W1982003698","https://openalex.org/W2035767178","https://openalex.org/W2054100908","https://openalex.org/W2070232376","https://openalex.org/W2076109400","https://openalex.org/W2078331965","https://openalex.org/W2081385143","https://openalex.org/W2096544401","https://openalex.org/W2097111141","https://openalex.org/W2119764373","https://openalex.org/W2121859659","https://openalex.org/W2131681506","https://openalex.org/W2132716097","https://openalex.org/W2150481406","https://openalex.org/W2151030781","https://openalex.org/W2160459668","https://openalex.org/W2170616854","https://openalex.org/W2189465200","https://openalex.org/W2394534308","https://openalex.org/W2396862935","https://openalex.org/W2951113132","https://openalex.org/W3021188837","https://openalex.org/W3099768174","https://openalex.org/W3139415452","https://openalex.org/W4246219036","https://openalex.org/W6630706044","https://openalex.org/W6638233953","https://openalex.org/W6639805184","https://openalex.org/W6649045865","https://openalex.org/W6976708705","https://openalex.org/W7029321148"],"related_works":["https://openalex.org/W2127267268","https://openalex.org/W2156446763","https://openalex.org/W2136512912","https://openalex.org/W2067910792","https://openalex.org/W2150194458","https://openalex.org/W2143461633","https://openalex.org/W2889071233","https://openalex.org/W2772294324","https://openalex.org/W4253760428","https://openalex.org/W2047831585"],"abstract_inverted_index":{"In":[0,87],"this":[1],"paper,":[2],"we":[3,33,110],"focus":[4],"on":[5],"the":[6,50,89,113,149,161,182,190],"efficient":[7],"and":[8,38,42,63,72,97,137,177,184,204,252,274],"scalable":[9,140],"processing":[10,125,227],"of":[11,27,40,54,61,164,186,199,220,230,250,262,278],"set-reachability":[12,56,115,128,166,235],"queries":[13,233],"over":[14,130,275],"a":[15,24,28,55,108,126,131,139,165,197,218,228,276],"distributed,":[16],"directed":[17],"data":[18,90,133],"graph.":[19],"A":[20],"\"set-reachability":[21],"query\"":[22],"is":[23,78,92,142],"generalized":[25,231],"form":[26,229],"reachability":[29,195,245],"query,":[30],"in":[31,107,124,138,175,201,265],"which":[32,224],"consider":[34],"two":[35],"sets":[36,249],"S":[37,71,84,168],"T":[39,170],"source":[41,62,251],"target":[43,64,253],"vertices,":[44],"respectively,":[45],"to":[46,80,112,144,158,179,226,267,283],"be":[47],"given":[48],"as":[49,83,117,153,155,272],"query.":[51],"The":[52,121,208],"result":[53],"query":[57,129,167,206],"are":[58],"all":[59,172],"pairs":[60],"vertices":[65],"(s,":[66],"t),":[67],"with":[68,234,281],"s":[69,77],"--":[70],"t":[73,81],"#8712;":[74],"T,":[75],"where":[76],"reachable":[79],"(denoted":[82],"\u219d":[85,169],"T).":[86],"case":[88],"graph":[91,134,202,269,279],"partitioned":[93,132],"into":[94],"multiple,":[95],"edge-":[96],"vertex-disjoint":[98],"subgraphs":[99],"(e.g.,":[100],"when":[101],"distributed":[102,127],"across":[103],"multiple":[104],"compute":[105,151,173,191],"nodes":[106,152,174],"cluster),":[109],"refer":[111],"resulting":[114],"problem":[116],"\"distributed":[118],"set":[119,194],"reachability\".":[120],"key":[122],"goal":[123],"both":[135,181],"efficiently":[136],"manner":[141],"(1)":[143],"avoid":[145],"redundant":[146],"computations":[147],"within":[148],"local":[150,162],"much":[154],"possible,":[156],"(2)":[157],"partially":[159],"evaluate":[160],"components":[163],"among":[171,189,240],"parallel,":[176],"(3)":[178],"minimize":[180],"size":[183],"number":[185],"messages":[187],"exchanged":[188],"nodes.":[192],"Distributed":[193],"has":[196],"plethora":[198],"applications":[200],"analytics":[203],"for":[205,212,215],"processing.":[207],"current":[209],"W3C":[210],"recommendation":[211],"SPARQL":[213],"1.1,":[214],"example,":[216],"introduces":[217],"notion":[219],"\"labeled":[221],"property":[222],"paths\"":[223],"resolves":[225],"graph-pattern":[232],"predicates.":[236],"Moreover,":[237],"analyzing":[238],"dependencies":[239],"\"social-network":[241],"communities\"":[242],"inherently":[243],"involves":[244],"checks":[246],"between":[247],"large":[248],"vertices.":[254],"Our":[255],"experiments":[256],"confirm":[257],"very":[258],"significant":[259],"performance":[260],"gains":[261],"our":[263],"approach":[264],"comparison":[266],"state-of-the-art":[268],"engines":[270],"such":[271],"Giraph++,":[273],"variety":[277],"collections":[280],"up":[282],"1.4":[284],"billion":[285],"edges.":[286]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}