{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T10:00:00Z","timestamp":1777024800777,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,2,27]],"date-time":"2021-02-27T00:00:00Z","timestamp":1614384000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,3,2]]},"DOI":"10.1145\/3446804.3446855","type":"proceedings-article","created":{"date-parts":[[2021,2,14]],"date-time":"2021-02-14T10:23:10Z","timestamp":1613298190000},"page":"23-35","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Compiling data-parallel Datalog"],"prefix":"10.1145","author":[{"given":"Thomas","family":"Gilray","sequence":"first","affiliation":[{"name":"University of Alabama at Birmingham, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sidharth","family":"Kumar","sequence":"additional","affiliation":[{"name":"University of Alabama at Birmingham, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kristopher","family":"Micinski","sequence":"additional","affiliation":[{"name":"Syracuse University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,2,27]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Foundations of databases: the logical level","author":"Abiteboul Serge","unstructured":"Serge Abiteboul , Richard Hull , and Victor Vianu . 1995. Foundations of databases: the logical level . Addison-Wesley Longman Publishing Co., Inc. Serge Abiteboul, Richard Hull, and Victor Vianu. 1995. Foundations of databases: the logical level. Addison-Wesley Longman Publishing Co., Inc."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1251535.1251543"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3088515.3088522"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2742796"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2007.08.001"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732219.2732227"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.14778\/3055540.3055545"},{"key":"e_1_3_2_1_8_1","unstructured":"Aaron Bembenek Michael Greenberg and Stephen Chong. 2020. Formulog = Datalog + ML + SMT.  Aaron Bembenek Michael Greenberg and Stephen Chong. 2020. Formulog = Datalog + ML + SMT."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1639949.1640108"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1640089.1640108"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1966445.1966463"},{"key":"e_1_3_2_1_12_1","first-page":"44","volume-title":"Proceedings of the PRISMA Workshop on Parallel Database Systems. Springer-Verlag New York, Inc.","author":"Cacace Filippo","unstructured":"Filippo Cacace , Stefano Ceri , and Maurice A. W. Houstma . 1991. An Overview of Parallel Strategies for Transitive Closure on Algebraic Machines . In Proceedings of the PRISMA Workshop on Parallel Database Systems. Springer-Verlag New York, Inc. , New York, NY, USA , 44 - 62 . Filippo Cacace, Stefano Ceri, and Maurice A. W. Houstma. 1991. An Overview of Parallel Strategies for Transitive Closure on Algebraic Machines. In Proceedings of the PRISMA Workshop on Parallel Database Systems. Springer-Verlag New York, Inc., New York, NY, USA, 44-62."},{"key":"e_1_3_2_1_13_1","first-page":"347","volume-title":"Proceedings of the Sixteenth International Conference on Very Large Databases. Morgan Kaufmann Publishers Inc.","author":"Cheiney Jean-Pierre","year":"1990","unstructured":"Jean-Pierre Cheiney and Christophe de Maindreville . 1990 . A Parallel Strategy for Transitive Closure Using Double Hash-based Clustering . In Proceedings of the Sixteenth International Conference on Very Large Databases. Morgan Kaufmann Publishers Inc. , San Francisco, CA, USA , 347 - 358 . Jean-Pierre Cheiney and Christophe de Maindreville. 1990. A Parallel Strategy for Transitive Closure Using Double Hash-based Clustering. In Proceedings of the Sixteenth International Conference on Very Large Databases. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 347-358."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/512950.512973"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/980972.980992"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2951913.2951936"},{"key":"e_1_3_2_1_17_1","volume-title":"Soufl\u00e9: On Synthesis of Program Analyzers","author":"Jordan Herbert","year":"2016","unstructured":"Herbert Jordan , Bernhard Scholz , and Pavle Suboti?. 2016 . Soufl\u00e9: On Synthesis of Program Analyzers . In Computer Aided Verification, Swarat Chaudhuri and Azadeh Farzan (Eds.). Springer International Publishing , Cham , 422-430. Herbert Jordan, Bernhard Scholz, and Pavle Suboti?. 2016. Soufl\u00e9: On Synthesis of Program Analyzers. In Computer Aided Verification, Swarat Chaudhuri and Azadeh Farzan (Eds.). Springer International Publishing, Cham, 422-430."},{"key":"e_1_3_2_1_18_1","first-page":"327","volume-title":"Proceedings of the 24th Symposium on Principles and Practice of Parallel Programming (PPoPP '19)","author":"Jordan Herbert","unstructured":"Herbert Jordan , Pavle Suboti?, David Zhao , and Bernhard Scholz . [n.d.]. A Specialized B-tree for Concurrent Datalog Evaluation . In Proceedings of the 24th Symposium on Principles and Practice of Parallel Programming (PPoPP '19) . ACM, New York, NY, USA , 327 - 339 . Herbert Jordan, Pavle Suboti?, David Zhao, and Bernhard Scholz. [n.d.]. A Specialized B-tree for Concurrent Datalog Evaluation. In Proceedings of the 24th Symposium on Principles and Practice of Parallel Programming (PPoPP '19). ACM, New York, NY, USA, 327-339."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3303084.3309490"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2499370.2462191"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491956.2462191"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687553.1687564"},{"key":"e_1_3_2_1_23_1","volume-title":"International Conference on High Performance Computing, Data, and Analytics (HiPC). IEEE.","author":"Kumar Sidharth","year":"2019","unstructured":"Sidharth Kumar and Thomas Gilray . 2019 . Distributed Relational Algebra at Scale . In International Conference on High Performance Computing, Data, and Analytics (HiPC). IEEE. Sidharth Kumar and Thomas Gilray. 2019. Distributed Relational Algebra at Scale. In International Conference on High Performance Computing, Data, and Analytics (HiPC). IEEE."},{"key":"e_1_3_2_1_24_1","volume-title":"Load-Balancing Parallel Relational Algebra","author":"Kumar Sidharth","unstructured":"Sidharth Kumar and Thomas Gilray . 2020. Load-Balancing Parallel Relational Algebra . In High Performance Computing, Ponnuswamy Sadayappan, Bradford L. Chamberlain, Guido Juckeland, and Hatem Ltaief (Eds.). Springer International Publishing , Cham , 288-308. Sidharth Kumar and Thomas Gilray. 2020. Load-Balancing Parallel Relational Algebra. In High Performance Computing, Ponnuswamy Sadayappan, Bradford L. Chamberlain, Guido Juckeland, and Hatem Ltaief (Eds.). Springer International Publishing, Cham, 288-308."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Jan Midtgaard. 2012. Control-flow analysis of functional programs. ACM computing surveys (CSUR) 44 3 ( 2012 ) 1-33.  Jan Midtgaard. 2012. Control-flow analysis of functional programs. ACM computing surveys (CSUR) 44 3 ( 2012 ) 1-33.","DOI":"10.1145\/2187671.2187672"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15769-1_25"},{"key":"e_1_3_2_1_27_1","volume-title":"Proceedings of the ACM on Programming Languages 2, POPL ( 2017 ), 51","author":"Ph\u00fac C","year":"2017","unstructured":"Ph\u00fac C Nguy?n, Thomas Gilray , Sam Tobin-Hochstadt , and David Van Horn . 2017 . Soft contract verification for higher-order stateful programs . Proceedings of the ACM on Programming Languages 2, POPL ( 2017 ), 51 . Ph\u00fac C Nguy?n, Thomas Gilray, Sam Tobin-Hochstadt, and David Van Horn. 2017. Soft contract verification for higher-order stateful programs. Proceedings of the ACM on Programming Languages 2, POPL ( 2017 ), 51."},{"key":"e_1_3_2_1_28_1","volume-title":"Proceedings of the 24th ACM SIGSOFT International SPIN Symposium on Model Checking of Software. ACM, 21-30","author":"Oortwijn Wytse","unstructured":"Wytse Oortwijn , Tom van Dijk , and Jaco van de Pol. 2017. Distributed binary decision diagrams for sbolic reachability . In Proceedings of the 24th ACM SIGSOFT International SPIN Symposium on Model Checking of Software. ACM, 21-30 . Wytse Oortwijn, Tom van Dijk, and Jaco van de Pol. 2017. Distributed binary decision diagrams for sbolic reachability. In Proceedings of the 24th ACM SIGSOFT International SPIN Symposium on Model Checking of Software. ACM, 21-30."},{"key":"e_1_3_2_1_29_1","volume-title":"Scalable Symbolic Execution of Distributed Systems. In 2011 31st International Conference on Distributed Computing Systems. 333-342","author":"Sasnauskas R.","unstructured":"R. Sasnauskas , O. S. Dustmann , B. L. Kaminski , K. Wehrle , C. Weise , and S. Kowalewski . 2011 . Scalable Symbolic Execution of Distributed Systems. In 2011 31st International Conference on Distributed Computing Systems. 333-342 . R. Sasnauskas, O. S. Dustmann, B. L. Kaminski, K. Wehrle, C. Weise, and S. Kowalewski. 2011. Scalable Symbolic Execution of Distributed Systems. In 2011 31st International Conference on Distributed Computing Systems. 333-342."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2892208.2892226"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/53990.54007"},{"key":"e_1_3_2_1_33_1","first-page":"1","volume-title":"2010 2nd International Conference on Software Technology and Engineering","volume":"1","author":"Siddiqui J. H.","unstructured":"J. H. Siddiqui and S. Khurshid . 2010. ParSym: Parallel symbolic execution . In 2010 2nd International Conference on Software Technology and Engineering , Vol. 1 . V1-405-V 1 - 409 . J. H. Siddiqui and S. Khurshid. 2010. ParSym: Parallel symbolic execution. In 2010 2nd International Conference on Software Technology and Engineering, Vol. 1. V1-405-V1-409."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24206-9_14"},{"key":"e_1_3_2_1_35_1","first-page":"2","article-title":"Automatic Index Selection for Large-scale Datalog Computation","volume":"12","author":"Pavle","year":"2018","unstructured":"Pavle Suboti?, Herbert Jordan , Lijun Chang , Alan Fekete , and Bernhard Scholz . 2018 . Automatic Index Selection for Large-scale Datalog Computation . Proc. VLDB Endow. 12 , 2 (Oct. 2018 ), 141-153. Pavle Suboti?, Herbert Jordan, Lijun Chang, Alan Fekete, and Bernhard Scholz. 2018. Automatic Index Selection for Large-scale Datalog Computation. Proc. VLDB Endow. 12, 2 (Oct. 2018 ), 141-153.","journal-title":"Proc. VLDB Endow."},{"key":"e_1_3_2_1_36_1","series-title":"SIAM journal on computing 1, 2 ( 1972 ), 146-160","volume-title":"Depth-first search and linear graph algorithms","author":"Tarjan Robert","unstructured":"Robert Tarjan . 1972. Depth-first search and linear graph algorithms . SIAM journal on computing 1, 2 ( 1972 ), 146-160 . Robert Tarjan. 1972. Depth-first search and linear graph algorithms. SIAM journal on computing 1, 2 ( 1972 ), 146-160."},{"key":"e_1_3_2_1_37_1","volume-title":"A benchmarking study to evaluate apache spark on large-scale supercomputers. arXiv preprint arXiv","author":"Thiruvathukal George K","year":"1904","unstructured":"George K Thiruvathukal , Cameron Christensen , Xiaoyong Jin , Fran\u00e7ois Tessier , and Venkatram Vishwanath . 2019. A benchmarking study to evaluate apache spark on large-scale supercomputers. arXiv preprint arXiv : 1904 . 11812 ( 2019 ). George K Thiruvathukal, Cameron Christensen, Xiaoyong Jin, Fran\u00e7ois Tessier, and Venkatram Vishwanath. 2019. A benchmarking study to evaluate apache spark on large-scale supercomputers. arXiv preprint arXiv: 1904. 11812 ( 2019 )."},{"key":"e_1_3_2_1_38_1","first-page":"1","article-title":"Parallel Evaluation of the Transitive Closure of a Database","volume":"17","author":"Valduriez Patrick","year":"1988","unstructured":"Patrick Valduriez and Setrag Khoshafian . 1988 . Parallel Evaluation of the Transitive Closure of a Database Relation. Int. J. Parallel Program. 17 , 1 (Feb. 1988 ), 19-42. Patrick Valduriez and Setrag Khoshafian. 1988. Parallel Evaluation of the Transitive Closure of a Database Relation. Int. J. Parallel Program. 17, 1 (Feb. 1988 ), 19-42.","journal-title":"Relation. Int. J. Parallel Program."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"crossref","unstructured":"David Van Horn and Harry G Mairson. 2008. Deciding k CFA is complete for EXPTIME. ACM Sigplan Notices 43 9 ( 2008 ) 275-282.  David Van Horn and Harry G Mairson. 2008. Deciding k CFA is complete for EXPTIME. ACM Sigplan Notices 43 9 ( 2008 ) 275-282.","DOI":"10.1145\/1411203.1411243"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1863543.1863553"},{"key":"e_1_3_2_1_41_1","volume-title":"Tien Quang Nguyen, and Guoqing Harry Xu","author":"Wang Kai","year":"2018","unstructured":"Kai Wang , Zhiqiang Zuo , John Thorpe , Tien Quang Nguyen, and Guoqing Harry Xu . 2018 . RStream: marrying relational algebra with streaming for eficient graph mining on a single machine. In 13th {USENIX } Symposium on Operating Systems Design and Implementation ( { OSDI } 18). 763-782. Kai Wang, Zhiqiang Zuo, John Thorpe, Tien Quang Nguyen, and Guoqing Harry Xu. 2018. RStream: marrying relational algebra with streaming for eficient graph mining on a single machine. In 13th {USENIX } Symposium on Operating Systems Design and Implementation ( { OSDI } 18). 763-782."},{"key":"e_1_3_2_1_42_1","volume-title":"Lam","author":"Whaley John","year":"2004","unstructured":"John Whaley and Monica S . Lam . 2004 . Cloning-based Contextsensitive Pointer Alias Analysis Using Binary Decision Diagrams. SIGPLAN Not . 39, 6 ( June 2004 ), 131-144. John Whaley and Monica S. Lam. 2004. Cloning-based Contextsensitive Pointer Alias Analysis Using Binary Decision Diagrams. SIGPLAN Not. 39, 6 ( June 2004 ), 131-144."}],"event":{"name":"CC '21: 30th ACM SIGPLAN International Conference on Compiler Construction","location":"Virtual Republic of Korea","acronym":"CC '21","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 30th ACM SIGPLAN International Conference on Compiler Construction"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3446804.3446855","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3446804.3446855","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:47:32Z","timestamp":1750193252000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3446804.3446855"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,27]]},"references-count":41,"alternative-id":["10.1145\/3446804.3446855","10.1145\/3446804"],"URL":"https:\/\/doi.org\/10.1145\/3446804.3446855","relation":{},"subject":[],"published":{"date-parts":[[2021,2,27]]},"assertion":[{"value":"2021-02-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}