{"id":"https://openalex.org/W2963191769","doi":"https://doi.org/10.1017/s1471068419000358","title":"A Case for Stale Synchronous Distributed Model for Declarative Recursive Computation","display_name":"A Case for Stale Synchronous Distributed Model for Declarative Recursive Computation","publication_year":2019,"publication_date":"2019-09-01","ids":{"openalex":"https://openalex.org/W2963191769","doi":"https://doi.org/10.1017/s1471068419000358","mag":"2963191769"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068419000358","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068419000358","pdf_url":null,"source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1907.10278","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5103245820","display_name":"Ariyam Das","orcid":"https://orcid.org/0000-0003-0950-606X"},"institutions":[{"id":"https://openalex.org/I161318765","display_name":"University of California, Los Angeles","ror":"https://ror.org/046rm7j60","country_code":"US","type":"education","lineage":["https://openalex.org/I161318765"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"ARIYAM DAS","raw_affiliation_strings":["Department of Computer Science, University of California, Los Angeles, USA (e-mails:","University of California-Los Angeles"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California, Los Angeles, USA (e-mails:","institution_ids":["https://openalex.org/I161318765"]},{"raw_affiliation_string":"University of California-Los Angeles","institution_ids":["https://openalex.org/I161318765"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113467760","display_name":"Carlo Zaniolo","orcid":null},"institutions":[{"id":"https://openalex.org/I161318765","display_name":"University of California, Los Angeles","ror":"https://ror.org/046rm7j60","country_code":"US","type":"education","lineage":["https://openalex.org/I161318765"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"CARLO ZANIOLO","raw_affiliation_strings":["Department of Computer Science, University of California, Los Angeles, USA (e-mails:","University of California-Los Angeles"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California, Los Angeles, USA (e-mails:","institution_ids":["https://openalex.org/I161318765"]},{"raw_affiliation_string":"University of California-Los Angeles","institution_ids":["https://openalex.org/I161318765"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5103245820"],"corresponding_institution_ids":["https://openalex.org/I161318765"],"apc_list":null,"apc_paid":null,"fwci":0.4087,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.65106612,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"19","issue":"5-6","first_page":"1056","last_page":"1072"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9995999932289124,"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.9995999932289124,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9973999857902527,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.9922000169754028,"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/computer-science","display_name":"Computer science","score":0.8535498976707458},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.7630019187927246},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.6470556259155273},{"id":"https://openalex.org/keywords/datalog","display_name":"Datalog","score":0.5914262533187866},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.554031491279602},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5512637495994568},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.47055745124816895},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4635125398635864},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.45819008350372314}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8535498976707458},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.7630019187927246},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.6470556259155273},{"id":"https://openalex.org/C148230440","wikidata":"https://www.wikidata.org/wiki/Q1172264","display_name":"Datalog","level":2,"score":0.5914262533187866},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.554031491279602},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5512637495994568},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.47055745124816895},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4635125398635864},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.45819008350372314},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1017/s1471068419000358","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068419000358","pdf_url":null,"source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1907.10278","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1907.10278","pdf_url":"https://arxiv.org/pdf/1907.10278","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":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":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"mag:2963191769","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1907.10278","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_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.1907.10278","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1907.10278","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_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1907.10278","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1907.10278","pdf_url":"https://arxiv.org/pdf/1907.10278","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":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":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2963191769.pdf","grobid_xml":"https://content.openalex.org/works/W2963191769.grobid-xml"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W21111227","https://openalex.org/W1501254937","https://openalex.org/W1652793671","https://openalex.org/W1833917188","https://openalex.org/W1986870156","https://openalex.org/W2008865455","https://openalex.org/W2053299919","https://openalex.org/W2073074467","https://openalex.org/W2091090133","https://openalex.org/W2096544401","https://openalex.org/W2096650850","https://openalex.org/W2110104287","https://openalex.org/W2113547287","https://openalex.org/W2132737349","https://openalex.org/W2170616854","https://openalex.org/W2170902912","https://openalex.org/W2215524946","https://openalex.org/W2294676922","https://openalex.org/W2433992225","https://openalex.org/W2557780633","https://openalex.org/W2571995155","https://openalex.org/W2658699200","https://openalex.org/W2750884547","https://openalex.org/W2805517282","https://openalex.org/W2897611396","https://openalex.org/W2948906765","https://openalex.org/W2962820040","https://openalex.org/W2963191769","https://openalex.org/W2964250337","https://openalex.org/W6600882560","https://openalex.org/W6636806777","https://openalex.org/W6742394702","https://openalex.org/W6753393510"],"related_works":["https://openalex.org/W1528666136","https://openalex.org/W3104564121","https://openalex.org/W905878330","https://openalex.org/W25853383","https://openalex.org/W1506695825","https://openalex.org/W2913516146","https://openalex.org/W1603163314","https://openalex.org/W256729557","https://openalex.org/W2162648685","https://openalex.org/W2122698067","https://openalex.org/W2247889754","https://openalex.org/W2528326022","https://openalex.org/W2155749118","https://openalex.org/W2154057349","https://openalex.org/W3098546239","https://openalex.org/W2952585167","https://openalex.org/W2963576997","https://openalex.org/W2087046173","https://openalex.org/W2181860606","https://openalex.org/W2213823636"],"abstract_inverted_index":{"Abstract":[0],"A":[1],"large":[2],"class":[3],"of":[4,41,86,94,142,147,205],"traditional":[5],"graph":[6],"and":[7,17,103,116],"data":[8],"mining":[9],"algorithms":[10],"can":[11,100,134,167],"be":[12,135,168],"concisely":[13],"expressed":[14],"in":[15,25,44,65],"Datalog,":[16],"other":[18],"Logic-based":[19],"languages,":[20],"once":[21],"aggregates":[22,43,64],"are":[23,46],"allowed":[24],"recursion.":[26],"In":[27,73,159],"fact,":[28],"for":[29,60,187],"most":[30],"BigData":[31],"algorithms,":[32],"the":[33,39,82,90,122,126,138,188],"difficult":[34],"semantic":[35],"issues":[36],"raised":[37],"by":[38,48,79],"use":[40],"non-monotonic":[42],"recursion":[45,66],"solved":[47],"Pre-Mappability":[49],"(":[50],"${\\cal":[51],"P}$":[52],"reM":[53,99,113,133,195],"),":[54],"a":[55,61,171,183],"property":[56],"that":[57,59,110,163],"assures":[58],"program":[62],"with":[63,89,192],"there":[67],"is":[68],"an":[69],"equivalent":[70],"aggregate-stratified":[71],"program.":[72],"this":[74,197],"paper":[75],"we":[76,161,201],"show":[77,162],"that,":[78],"bringing":[80],"together":[81],"formal":[83,184],"abstract":[84],"semantics":[85],"stratified":[87],"programs":[88],"efficient":[91],"operational":[92],"one":[93],"unstratified":[95],"programs,":[96],"$\\[{\\cal":[97,111,131,193],"P}\\]$":[98,112,132,194],"also":[101],"facilitate":[102],"improve":[104],"their":[105],"parallel":[106,118,153,175],"execution.":[107],"We":[108],"prove":[109],"-optimized":[114],"lock-free":[115],"decomposable":[117],"semi-naive":[119],"evaluations":[120],"produce":[121],"same":[123],"results":[124],"as":[125],"single":[127],"executor":[128],"programs.":[129],"Therefore,":[130],"assimilated":[136],"into":[137],"data-parallel":[139],"computation":[140],"plans":[141],"different":[143],"distributed":[144,179],"systems,":[145],"irrespective":[146],"whether":[148],"these":[149],"follow":[150],"bulk":[151],"synchronous":[152,174],"(BSP)":[154],"or":[155],"asynchronous":[156],"computing":[157],"models.":[158],"addition,":[160],"non-linear":[164],"recursive":[165,189],"queries":[166],"evaluated":[169],"using":[170],"hybrid":[172],"stale":[173],"(SSP)":[176],"model":[177],"on":[178],"environments.":[180],"After":[181],"providing":[182],"correctness":[185],"proof":[186],"query":[190],"evaluation":[191],"under":[196],"relaxed":[198],"synchronization":[199],"model,":[200],"present":[202],"experimental":[203],"evidence":[204],"its":[206],"benefits.":[207]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":3}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}