{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,28]],"date-time":"2025-08-28T12:26:03Z","timestamp":1756383963982,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,12]],"date-time":"2022-06-12T00:00:00Z","timestamp":1654992000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"HKRGC","award":["16201318,16201819,16205420"],"award-info":[{"award-number":["16201318,16201819,16205420"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,6,12]]},"DOI":"10.1145\/3517804.3524142","type":"proceedings-article","created":{"date-parts":[[2022,6,13]],"date-time":"2022-06-13T13:29:54Z","timestamp":1655126994000},"page":"67-78","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Query Evaluation by Circuits"],"prefix":"10.1145","author":[{"given":"Yilei","family":"Wang","sequence":"first","affiliation":[{"name":"The Hong Kong University of Science and Technology, Hong Kong, Hong Kong"}]},{"given":"Ke","family":"Yi","sequence":"additional","affiliation":[{"name":"The Hong Kong University of Science and Technology, Hong Kong, Hong Kong"}]}],"member":"320","published-online":{"date-parts":[[2022,6,13]]},"reference":[{"volume-title":"Foundations of Databases","author":"Abiteboul Serge","unstructured":"Serge Abiteboul , Richard Hull , and Victor Vianu . 1995. Foundations of Databases . Addison-Wesley . http:\/\/webdam.inria.fr\/Alice\/ Serge Abiteboul, Richard Hull, and Victor Vianu. 1995. Foundations of Databases .Addison-Wesley. http:\/\/webdam.inria.fr\/Alice\/","key":"e_1_3_2_2_1_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_2_1","DOI":"10.1145\/2902251.2902280"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_3_1","DOI":"10.1145\/3034786.3056105"},{"volume-title":"Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing (STOC '83)","author":"Ajtai M.","unstructured":"M. Ajtai , J. Koml\u00f3s , and E. Szemer\u00e9di . 1983. An O(n log n) Sorting Network . In Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing (STOC '83) . Association for Computing Machinery, New York, NY, USA, 1--9. https:\/\/doi.org\/10.1145\/800061.808726 10.1145\/800061.808726 M. Ajtai, J. Koml\u00f3s, and E. Szemer\u00e9di. 1983. An O(n log n) Sorting Network. In Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing (STOC '83). Association for Computing Machinery, New York, NY, USA, 1--9. https:\/\/doi.org\/10.1145\/800061.808726","key":"e_1_3_2_2_4_1"},{"key":"e_1_3_2_2_5_1","volume-title":"Proc. 17th International Conference on Database Theory (ICDT)","author":"Arasu Arvind","year":"2014","unstructured":"Arvind Arasu and Raghav Kaushik . 2014 . Oblivious Query Processing . In Proc. 17th International Conference on Database Theory (ICDT) , Athens, Greece, March 24--28 , 2014, Nicole Schweikardt, Vassilis Christophides, and Vincent Leroy (Eds.). OpenProceedings.org, 26--37. https:\/\/doi.org\/10.5441\/002\/icdt.2014.07 10.5441\/002 Arvind Arasu and Raghav Kaushik. 2014. Oblivious Query Processing. In Proc. 17th International Conference on Database Theory (ICDT), Athens, Greece, March 24--28, 2014, Nicole Schweikardt, Vassilis Christophides, and Vincent Leroy (Eds.). OpenProceedings.org, 26--37. https:\/\/doi.org\/10.5441\/002\/icdt.2014.07"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_6_1","DOI":"10.1007\/978-3-030-45724-2_14"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_7_1","DOI":"10.1109\/FOCS.2008.43"},{"volume-title":"On Acyclic Conjunctive Queries and Constant Delay Enumeration","author":"Bagan Guillaume","unstructured":"Guillaume Bagan , Arnaud Durand , and Etienne Grandjean . 2007. On Acyclic Conjunctive Queries and Constant Delay Enumeration . In Computer Science Logic, Jacques Duparc and Thomas A. Henzinger (Eds.). Springer Berlin Heidelberg , Berlin, Heidelberg , 208--222. Guillaume Bagan, Arnaud Durand, and Etienne Grandjean. 2007. On Acyclic Conjunctive Queries and Constant Delay Enumeration. In Computer Science Logic, Jacques Duparc and Thomas A. Henzinger (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 208--222.","key":"e_1_3_2_2_8_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_9_1","DOI":"10.1145\/1468075.1468121"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_10_1","DOI":"10.14778\/3055330.3055334"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_11_1","DOI":"10.1145\/62212.62213"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_12_1","DOI":"10.1145\/321812.321815"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_13_1","DOI":"10.14778\/3364324.3364331"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_14_1","DOI":"10.1561\/9781680835090"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_15_1","DOI":"10.1145\/1536414.1536440"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_16_1","DOI":"10.5555\/2008684.2008697"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_17_1","DOI":"10.1145\/28395.28420"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_18_1","DOI":"10.1145\/233551.233553"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_19_1","DOI":"10.1145\/2220357.2220363"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_20_1","DOI":"10.1006\/jcss.2001.1809"},{"key":"e_1_3_2_2_21_1","first-page":"12","article-title":"Data Parallel","volume":"29","author":"Daniel Hillis W.","year":"1986","unstructured":"W. Daniel Hillis and Guy L. Steele . 1986 . Data Parallel Algorithms. Commun. ACM , Vol. 29 , 12 (Dec. 1986), 1170--1183. https:\/\/doi.org\/10.1145\/7902.7903 10.1145\/7902.7903 W. Daniel Hillis and Guy L. Steele. 1986. Data Parallel Algorithms. Commun. ACM, Vol. 29, 12 (Dec. 1986), 1170--1183. https:\/\/doi.org\/10.1145\/7902.7903","journal-title":"Algorithms. Commun. ACM"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_22_1","DOI":"10.1145\/3452021.3458319"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_23_1","DOI":"10.1145\/2902251.2902293"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_24_1","DOI":"10.1145\/3034786.3034788"},{"key":"e_1_3_2_2_25_1","volume-title":"What do Shannon-type inequalities, submodular width, and disjunctive datalog have to do with one another? CoRR","author":"Khamis Mahmoud Abo","year":"2016","unstructured":"Mahmoud Abo Khamis , Hung Q. Ngo , and Dan Suciu . 2016. What do Shannon-type inequalities, submodular width, and disjunctive datalog have to do with one another? CoRR , Vol. abs\/ 1612 .02503 ( 2016 ). arxiv: 1612.02503 http:\/\/arxiv.org\/abs\/1612.02503 Mahmoud Abo Khamis, Hung Q. Ngo, and Dan Suciu. 2016. What do Shannon-type inequalities, submodular width, and disjunctive datalog have to do with one another? CoRR, Vol. abs\/1612.02503 (2016). arxiv: 1612.02503 http:\/\/arxiv.org\/abs\/1612.02503"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_26_1","DOI":"10.1145\/1989284.1989310"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_27_1","DOI":"10.1145\/2535926"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_28_1","DOI":"10.1145\/3180143"},{"volume-title":"Computational Complexity","author":"Papadimitriou Christos H.","unstructured":"Christos H. Papadimitriou . 1994. Computational Complexity . Addison-Wesley . Christos H. Papadimitriou. 1994. Computational Complexity .Addison-Wesley.","key":"e_1_3_2_2_29_1"},{"key":"e_1_3_2_2_30_1","volume-title":"23rd International Conference on Database Theory (ICDT 2020) (Leibniz International Proceedings in Informatics (LIPIcs)","volume":"18","author":"Tao Yufei","year":"2020","unstructured":"Yufei Tao . 2020 . A Simple Parallel Algorithm for Natural Joins on Binary Relations . In 23rd International Conference on Database Theory (ICDT 2020) (Leibniz International Proceedings in Informatics (LIPIcs) , Vol. 155), Carsten Lutz and Jean Christoph Jung (Eds.). Schloss Dagstuhl--Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany, 25:1--25: 18 . https:\/\/doi.org\/10.4230\/LIPIcs.ICDT.2020.25 10.4230\/LIPIcs.ICDT.2020.25 Yufei Tao. 2020. A Simple Parallel Algorithm for Natural Joins on Binary Relations. In 23rd International Conference on Database Theory (ICDT 2020) (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 155), Carsten Lutz and Jean Christoph Jung (Eds.). Schloss Dagstuhl--Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany, 25:1--25:18. https:\/\/doi.org\/10.4230\/LIPIcs.ICDT.2020.25"},{"key":"e_1_3_2_2_31_1","volume-title":"Proc. 17th International Conference on Database Theory (ICDT)","author":"Veldhuizen Todd L.","year":"2014","unstructured":"Todd L. Veldhuizen . 2014 . Triejoin: A Simple, Worst-Case Optimal Join Algorithm . In Proc. 17th International Conference on Database Theory (ICDT) , Athens, Greece, March 24--28 , 2014, Nicole Schweikardt, Vassilis Christophides, and Vincent Leroy (Eds.). OpenProceedings.org, 96--106. https:\/\/doi.org\/10.5441\/002\/icdt.2014.13 10.5441\/002 Todd L. Veldhuizen. 2014. Triejoin: A Simple, Worst-Case Optimal Join Algorithm. In Proc. 17th International Conference on Database Theory (ICDT), Athens, Greece, March 24--28, 2014, Nicole Schweikardt, Vassilis Christophides, and Vincent Leroy (Eds.). OpenProceedings.org, 96--106. https:\/\/doi.org\/10.5441\/002\/icdt.2014.13"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_32_1","DOI":"10.1145\/3448016.3452808"},{"key":"e_1_3_2_2_33_1","volume-title":"Senate: A Maliciously-Secure MPC Platform for Collaborative Analytics. In 30th USENIX Security Symposium (USENIX Security 21)","author":"Sukrit Kalra Avishay Yanai Rishabh Poddar","year":"2021","unstructured":"Rishabh Poddar Sukrit Kalra Avishay Yanai , Ryan Deng , and Raluca Ada Popa Joseph M Hellerstein . 2021 . Senate: A Maliciously-Secure MPC Platform for Collaborative Analytics. In 30th USENIX Security Symposium (USENIX Security 21) . USENIX Association, Vancouver, B.C. https:\/\/www.usenix.org\/conference\/usenixsecurity21\/presentation\/poddar Rishabh Poddar Sukrit Kalra Avishay Yanai, Ryan Deng, and Raluca Ada Popa Joseph M Hellerstein. 2021. Senate: A Maliciously-Secure MPC Platform for Collaborative Analytics. In 30th USENIX Security Symposium (USENIX Security 21). USENIX Association, Vancouver, B.C. https:\/\/www.usenix.org\/conference\/usenixsecurity21\/presentation\/poddar"},{"key":"e_1_3_2_2_34_1","volume-title":"Proceedings of the Seventh International Conference on Very Large Data Bases -","volume":"7","author":"Yannakakis Mihalis","year":"1981","unstructured":"Mihalis Yannakakis . 1981 . Algorithms for Acyclic Database Schemes . In Proceedings of the Seventh International Conference on Very Large Data Bases - Volume 7 (Cannes, France) (VLDB '81). VLDB Endowment, 82--94. Mihalis Yannakakis. 1981. Algorithms for Acyclic Database Schemes. In Proceedings of the Seventh International Conference on Very Large Data Bases - Volume 7 (Cannes, France) (VLDB '81). VLDB Endowment, 82--94."},{"key":"e_1_3_2_2_35_1","volume-title":"Proceedings of the 27th Annual Symposium on Foundations of Computer Science (SFCS '86)","author":"Chi-Chih Yao Andrew","year":"1986","unstructured":"Andrew Chi-Chih Yao . 1986 . How to Generate and Exchange Secrets . In Proceedings of the 27th Annual Symposium on Foundations of Computer Science (SFCS '86) . IEEE Computer Society, USA, 162--167. https:\/\/doi.org\/10.1109\/SFCS. 1986.25 10.1109\/SFCS.1986.25 Andrew Chi-Chih Yao. 1986. How to Generate and Exchange Secrets. In Proceedings of the 27th Annual Symposium on Foundations of Computer Science (SFCS '86). IEEE Computer Society, USA, 162--167. https:\/\/doi.org\/10.1109\/SFCS.1986.25"}],"event":{"sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"acronym":"SIGMOD\/PODS '22","name":"SIGMOD\/PODS '22: International Conference on Management of Data","location":"Philadelphia PA USA"},"container-title":["Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3517804.3524142","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3517804.3524142","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:49:04Z","timestamp":1750182544000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3517804.3524142"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,12]]},"references-count":35,"alternative-id":["10.1145\/3517804.3524142","10.1145\/3517804"],"URL":"https:\/\/doi.org\/10.1145\/3517804.3524142","relation":{},"subject":[],"published":{"date-parts":[[2022,6,12]]},"assertion":[{"value":"2022-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}