{"id":"https://openalex.org/W2023062809","doi":"https://doi.org/10.1145/2247596.2247613","title":"Transitive closure and recursive Datalog implemented on clusters","display_name":"Transitive closure and recursive Datalog implemented on clusters","publication_year":2012,"publication_date":"2012-03-27","ids":{"openalex":"https://openalex.org/W2023062809","doi":"https://doi.org/10.1145/2247596.2247613","mag":"2023062809"},"language":"en","primary_location":{"id":"doi:10.1145/2247596.2247613","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2247596.2247613","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 15th International Conference on Extending Database Technology","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://doi.org/10.1145/2247596.2247613","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5088568415","display_name":"Foto Afrati","orcid":null},"institutions":[{"id":"https://openalex.org/I174458059","display_name":"National Technical University of Athens","ror":"https://ror.org/03cx6bg69","country_code":"GR","type":"education","lineage":["https://openalex.org/I174458059"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Foto N. Afrati","raw_affiliation_strings":["National Technical University of Athens, Greece",", National Technical University of Athens, Greece"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Technical University of Athens, Greece","institution_ids":["https://openalex.org/I174458059"]},{"raw_affiliation_string":", National Technical University of Athens, Greece","institution_ids":["https://openalex.org/I174458059"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089065417","display_name":"Jeffrey D. Ullman","orcid":"https://orcid.org/0000-0002-1847-3426"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jeffrey D. Ullman","raw_affiliation_strings":["Stanford University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.9622,"has_fulltext":false,"cited_by_count":34,"citation_normalized_percentile":{"value":0.96366116,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"132","last_page":"143"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9991999864578247,"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"}},"topics":[{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9991999864578247,"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.9988999962806702,"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/transitive-closure","display_name":"Transitive closure","score":0.7877429127693176},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.7812641263008118},{"id":"https://openalex.org/keywords/datalog","display_name":"Datalog","score":0.6690179109573364},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6416699886322021},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5559059381484985},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.545285701751709},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.5234488844871521},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47065845131874084},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4210396111011505},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3320218622684479},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.32885897159576416},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.322591632604599},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30991148948669434}],"concepts":[{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.7877429127693176},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.7812641263008118},{"id":"https://openalex.org/C148230440","wikidata":"https://www.wikidata.org/wiki/Q1172264","display_name":"Datalog","level":2,"score":0.6690179109573364},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6416699886322021},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5559059381484985},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.545285701751709},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.5234488844871521},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47065845131874084},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4210396111011505},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3320218622684479},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.32885897159576416},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.322591632604599},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30991148948669434},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","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},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2247596.2247613","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2247596.2247613","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 15th International Conference on Extending Database Technology","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.366.2437","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.366.2437","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/2012-Berlin/papers/edbt/a20-afrati.pdf","raw_type":"text"},{"id":"pmh:oai:dspace.lib.ntua.gr:123456789/36564","is_oa":true,"landing_page_url":"http://doi.org/10.1145/2247596.2247613","pdf_url":null,"source":{"id":"https://openalex.org/S4377196837","display_name":"DSpace - NTUA (National Technical University of Athens)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I174458059","host_organization_name":"National Technical University of Athens","host_organization_lineage":["https://openalex.org/I174458059"],"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":"ACM International Conference Proceeding Series","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"pmh:oai:dspace.lib.ntua.gr:123456789/36564","is_oa":true,"landing_page_url":"http://doi.org/10.1145/2247596.2247613","pdf_url":null,"source":{"id":"https://openalex.org/S4377196837","display_name":"DSpace - NTUA (National Technical University of Athens)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I174458059","host_organization_name":"National Technical University of Athens","host_organization_lineage":["https://openalex.org/I174458059"],"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":"ACM International Conference Proceeding Series","raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W144096106","https://openalex.org/W147240463","https://openalex.org/W1493893823","https://openalex.org/W1502577746","https://openalex.org/W1567632848","https://openalex.org/W1736726159","https://openalex.org/W1968401677","https://openalex.org/W1971421925","https://openalex.org/W1980086331","https://openalex.org/W1984280364","https://openalex.org/W1992810975","https://openalex.org/W1993800075","https://openalex.org/W1994924587","https://openalex.org/W1996513497","https://openalex.org/W1999123717","https://openalex.org/W2004982027","https://openalex.org/W2013344760","https://openalex.org/W2013951929","https://openalex.org/W2025868887","https://openalex.org/W2033258621","https://openalex.org/W2048541310","https://openalex.org/W2060280513","https://openalex.org/W2078331965","https://openalex.org/W2083541728","https://openalex.org/W2100830825","https://openalex.org/W2102563702","https://openalex.org/W2119565742","https://openalex.org/W2131314981","https://openalex.org/W2154713079","https://openalex.org/W2162621793","https://openalex.org/W2170616854","https://openalex.org/W2171668176","https://openalex.org/W2173213060","https://openalex.org/W2175110005","https://openalex.org/W4238584892","https://openalex.org/W6637359826"],"related_works":["https://openalex.org/W2955734379","https://openalex.org/W2049216635","https://openalex.org/W3121709727","https://openalex.org/W1537382653","https://openalex.org/W2517279098","https://openalex.org/W2309621853","https://openalex.org/W2964256304","https://openalex.org/W4297895951","https://openalex.org/W4301141272","https://openalex.org/W2142826315"],"abstract_inverted_index":{"Implementing":[0],"recursive":[1],"algorithms":[2,71,84,121,144,172],"on":[3,161],"computing":[4],"clusters":[5],"presents":[6],"a":[7,22,74,202,231,291,319],"number":[8,53,79,195,207,233,242,262,269,297],"of":[9,21,29,54,56,80,104,111,156,196,201,208,226,234,243,259,263,270,298,321],"new":[10],"challenges.":[11],"In":[12,213],"particular,":[13],"we":[14,147,216],"consider":[15,119],"the":[16,42,52,57,91,98,102,105,109,124,128,170,194,199,206,241,247,256,261,267,280,296,308],"endgame":[17,43],"problem:":[18],"later":[19],"rounds":[20,55,197,235,264,288,316],"recursion":[23,310],"often":[24],"transfer":[25],"only":[26,137],"small":[27,112],"amounts":[28],"data,":[30],"causing":[31],"high":[32],"overhead":[33,106],"for":[34,254],"interprocessor":[35],"communication.":[36],"One":[37],"way":[38],"to":[39,46,108,118,179,182,192,221,301],"deal":[40],"with":[41,230],"problem":[44,282],"is":[45,189,219],"use":[47,73],"an":[48,61],"algorithm":[49],"that":[50,72,132,141,149,154,210,279,307],"reduces":[51],"recursion.":[58],"Especially,":[59],"in":[60,153,167,173,205,240,286,314],"application":[62],"like":[63,123],"transitive":[64],"closure":[65],"(\"TC\")":[66],"there":[67,250],"are":[68,115,135,151,211,251],"several":[69],"recursive-doubling":[70,83,177],"logarithmic,":[75],"rather":[76],"than":[77,90,169],"linear,":[78],"rounds.":[81],"Unfortunately,":[82],"can":[85],"deduce":[86],"many":[87,142],"more":[88],"facts":[89,209,244,272,300],"linear":[92,125,171,252],"TC":[93,120,180],"algorithms,":[94,126],"which":[95,255],"could":[96,158],"negate":[97],"cost":[99,168],"savings":[100],"from":[101],"elimination":[103],"due":[107],"proliferation":[110],"files.":[113],"We":[114,139,277,304],"thus":[116,294],"led":[117],"that,":[122],"have":[127],"unique":[129],"decomposition":[130],"property":[131],"assures":[133],"paths":[134],"discovered":[136],"once.":[138],"find":[140],"such":[143],"exist,":[145],"and":[146,236,265],"show":[148,278,306],"they":[150],"incomparable,":[152],"any":[155,223],"them":[157],"prove":[159,217],"best":[160],"some":[162,174],"data":[163],"---":[164],"even":[165],"lower":[166],"cases.":[175],"The":[176],"approach":[178],"extends":[181],"other":[183,248],"recursions":[184,253],"as":[185],"well.":[186],"However,":[187],"it":[188,218],"not":[190],"acceptable":[191],"reduce":[193],"at":[198],"expense":[200],"major":[203],"increase":[204,239],"deduced.":[212,245,303],"this":[214],"paper,":[215],"possible":[220],"implement":[222],"Datalog":[224],"program":[225],"right-linear":[227],"chain":[228],"rules":[229],"logarithmic":[232,287,315],"no":[237],"order-of-magnitude":[238],"On":[246],"hand,":[249],"two":[257],"goals":[258],"reducing":[260],"maintaining":[266],"total":[268],"deduced":[271],"cannot":[273,283,311],"be":[274,284,302,312],"met":[275],"simultaneously.":[276],"reachability":[281],"solved":[285,313],"without":[289,317],"using":[290,318],"binary":[292],"predicate,":[293],"squaring":[295],"potential":[299],"also":[305],"samegeneration":[309],"predicate":[320],"arity":[322],"three.":[323]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}