{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T20:25:06Z","timestamp":1779913506534,"version":"3.53.1"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,25]],"date-time":"2019-06-25T00:00:00Z","timestamp":1561420800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Irwin and Joan Jacobs Fellowship"},{"name":"Austrian Science Fund (FWF)","award":["P30930-N35 W1255-N23"],"award-info":[{"award-number":["P30930-N35 W1255-N23"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,25]]},"DOI":"10.1145\/3294052.3319700","type":"proceedings-article","created":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T12:56:45Z","timestamp":1560776205000},"page":"134-148","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["On the Enumeration Complexity of Unions of Conjunctive Queries"],"prefix":"10.1145","author":[{"given":"Nofar","family":"Carmeli","sequence":"first","affiliation":[{"name":"Technion, Haifa, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Markus","family":"Kr\u00f6ll","sequence":"additional","affiliation":[{"name":"TU Wien, Vienna, Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2019,6,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.53"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/2392389.2392412"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3034786.3034789"},{"key":"e_1_3_2_1_4_1","volume-title":"21st International Conference on Database Theory, ICDT 2018","author":"Berkholz Christoph","year":"2018","unstructured":"Christoph Berkholz , Jens Keppeler , and Nicole Schweikardt . 2018 . Answering UCQs under Updates and in the Presence of Integrity Constraints . In 21st International Conference on Database Theory, ICDT 2018 , March 26 --29 , 2018, Vienna, Austria. 8:1--8:19. Christoph Berkholz, Jens Keppeler, and Nicole Schweikardt. 2018. Answering UCQs under Updates and in the Presence of Integrity Constraints. In 21st International Conference on Database Theory, ICDT 2018, March 26--29, 2018, Vienna, Austria. 8:1--8:19."},{"key":"e_1_3_2_1_6_1","volume-title":"Enumeration Complexity of Conjunctive Queries with Functional Dependencies. In ICDT 2018","author":"Carmeli Nofar","year":"2018","unstructured":"Nofar Carmeli and Markus Kr\u00f6 ll. 2018 . Enumeration Complexity of Conjunctive Queries with Functional Dependencies. In ICDT 2018 , March 26 --29 , 2018, Vienna, Austria (LIPIcs), Benny Kimelfeld and Yael Amsterdamer (Eds.), Vol. 98. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 11:1--11:17. Nofar Carmeli and Markus Kr\u00f6 ll. 2018. Enumeration Complexity of Conjunctive Queries with Functional Dependencies. In ICDT 2018, March 26--29, 2018, Vienna, Austria (LIPIcs), Benny Kimelfeld and Yael Amsterdamer (Eds.), Vol. 98. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 11:1--11:17."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1276920.1276923"},{"key":"e_1_3_2_1_8_1","volume-title":"Stijn Vansummeren, and Domagoj Vrgoc.","author":"Florenzano Fernando","year":"2018","unstructured":"Fernando Florenzano , Cristian Riveros , Mart'i n Ugarte , Stijn Vansummeren, and Domagoj Vrgoc. 2018 . Constant Delay Algorithms for Regular Document Spanners. In PODS. ACM , 165--177. Fernando Florenzano, Cristian Riveros, Mart'i n Ugarte, Stijn Vansummeren, and Domagoj Vrgoc. 2018. Constant Delay Algorithms for Regular Document Spanners. In PODS. ACM, 165--177."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/602220.602222"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02127798"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064027"},{"key":"e_1_3_2_1_12_1","unstructured":"Wojciech Kazana. 2013. Query evaluation with constant delay. Theses. \u00c9cole normale sup\u00e9rieure de Cachan - ENS Cachan . https:\/\/tel.archives-ouvertes.fr\/tel-00919786  Wojciech Kazana. 2013. Query evaluation with constant delay. Theses. \u00c9cole normale sup\u00e9rieure de Cachan - ENS Cachan . https:\/\/tel.archives-ouvertes.fr\/tel-00919786"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2608628.2608664"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/3174304.3175350"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3196959.3196961"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3196959.3196971"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783888.2783894"},{"key":"e_1_3_2_1_18_1","volume-title":"ICDT 2017 (Leibniz International Proceedings in Informatics (LIPIcs)), Michael Benedikt and Giorgio Orsi (Eds.)","volume":"68","author":"Segoufin Luc","year":"2017","unstructured":"Luc Segoufin and Alexandre Vigny . 2017 . Constant Delay Enumeration for FO Queries over Databases with Local Bounded Expansion . In ICDT 2017 (Leibniz International Proceedings in Informatics (LIPIcs)), Michael Benedikt and Giorgio Orsi (Eds.) , Vol. 68 . Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 20:1--20:16. Luc Segoufin and Alexandre Vigny. 2017. Constant Delay Enumeration for FO Queries over Databases with Local Bounded Expansion. In ICDT 2017 (Leibniz International Proceedings in Informatics (LIPIcs)), Michael Benedikt and Giorgio Orsi (Eds.), Vol. 68. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 20:1--20:16."},{"key":"e_1_3_2_1_20_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 (VLDB '81). VLDB Endowment, 82--94. http:\/\/dl.acm.org\/citation.cfm?id=1286831.1286840 Mihalis Yannakakis. 1981. Algorithms for Acyclic Database Schemes. In Proceedings of the Seventh International Conference on Very Large Data Bases - Volume 7 (VLDB '81). VLDB Endowment, 82--94. http:\/\/dl.acm.org\/citation.cfm?id=1286831.1286840"}],"event":{"name":"SIGMOD\/PODS '19: International Conference on Management of Data","location":"Amsterdam Netherlands","acronym":"SIGMOD\/PODS '19","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3294052.3319700","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3294052.3319700","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:53:28Z","timestamp":1750204408000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3294052.3319700"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,25]]},"references-count":18,"alternative-id":["10.1145\/3294052.3319700","10.1145\/3294052"],"URL":"https:\/\/doi.org\/10.1145\/3294052.3319700","relation":{},"subject":[],"published":{"date-parts":[[2019,6,25]]},"assertion":[{"value":"2019-06-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}