{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T21:13:15Z","timestamp":1757452395382,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":33,"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":[{"DOI":"10.13039\/501100001742","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1295\/15"],"award-info":[{"award-number":["1295\/15"]}],"id":[{"id":"10.13039\/501100001742","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["P30930-N35, W1255-N23"],"award-info":[{"award-number":["P30930-N35, W1255-N23"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,25]]},"DOI":"10.1145\/3294052.3319699","type":"proceedings-article","created":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T12:56:45Z","timestamp":1560776205000},"page":"320-334","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Complexity Bounds for Relational Algebra over Document Spanners"],"prefix":"10.1145","author":[{"given":"Liat","family":"Peterfreund","sequence":"first","affiliation":[{"name":"Technion, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dominik D.","family":"Freydenberger","sequence":"additional","affiliation":[{"name":"Loughborough University, Loughborough, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benny","family":"Kimelfeld","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus","family":"Kr\u00f6ll","sequence":"additional","affiliation":[{"name":"Vienna University of Technology, Vienna, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,6,25]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Constant-delay enumeration for nondeterministic document spanners. CoRR, abs\/1807.09320","author":"Amarilli Antoine","year":"2018","unstructured":"Antoine Amarilli , Pierre Bourhis , Stefan Mengel , and Matthias Niewerth . Constant-delay enumeration for nondeterministic document spanners. CoRR, abs\/1807.09320 , 2018 . Antoine Amarilli, Pierre Bourhis, Stefan Mengel, and Matthias Niewerth. Constant-delay enumeration for nondeterministic document spanners. CoRR, abs\/1807.09320, 2018."},{"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","series-title":"LIPIcs","first-page":"1","volume-title":"ICDT","author":"Carmeli Nofar","year":"2018","unstructured":"Nofar Carmeli and Markus Kr\u00f6 ll. Enumeration complexity of conjunctive queries with functional dependencies . In ICDT , volume 98 of LIPIcs , pages 11: 1 -- 11 :17. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik , 2018 . Nofar Carmeli and Markus Kr\u00f6 ll. Enumeration complexity of conjunctive queries with functional dependencies. In ICDT, volume 98 of LIPIcs, pages 11:1--11:17. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/2588240"},{"key":"e_1_3_2_1_5_1","first-page":"76","volume-title":"NAACL-HTL (3)","author":"Chiticariu Laura","year":"2018","unstructured":"Laura Chiticariu , Marina Danilevsky , Yunyao Li , Frederick Reiss , and Huaiyu Zhu . Systemt: Declarative text understanding for enterprise . In NAACL-HTL (3) , pages 76 -- 83 . Association for Computational Linguistics , 2018 . Laura Chiticariu, Marina Danilevsky, Yunyao Li, Frederick Reiss, and Huaiyu Zhu. Systemt: Declarative text understanding for enterprise. In NAACL-HTL (3), pages 76--83. Association for Computational Linguistics, 2018."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/2464827"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1375928.1375930"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2699442"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2877202"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3196959.3196987"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-018-9874-1"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-017-9770-0"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3196959.3196967"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/553977"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/574848"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.04.011"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90065-8"},{"key":"e_1_3_2_1_18_1","first-page":"109","volume-title":"ACL","author":"Li Yunyao","year":"2011","unstructured":"Yunyao Li , Frederick Reiss , and Laura Chiticariu . SystemT : A declarative information extraction system . In ACL , pages 109 -- 114 . ACL, 2011 . Yunyao Li, Frederick Reiss, and Laura Chiticariu. SystemT: A declarative information extraction system. In ACL, pages 109--114. ACL, 2011."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3196959.3196968"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3196959.3196961"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0893-6080(95)00086-0"},{"key":"e_1_3_2_1_22_1","volume-title":"Rational recurrences. CoRR, abs\/1808.09357","author":"Peng Hao","year":"2018","unstructured":"Hao Peng , Roy Schwartz , Sam Thomson , and Noah A. Smith . Rational recurrences. CoRR, abs\/1808.09357 , 2018 . Hao Peng, Roy Schwartz, Sam Thomson, and Noah A. Smith. Rational recurrences. CoRR, abs\/1808.09357, 2018."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1567274.1567278"},{"key":"e_1_3_2_1_24_1","volume-title":"Complexity bounds for relational algebra over document spanners. CoRR, abs\/1901.04182","author":"Peterfreund Liat","year":"2019","unstructured":"Liat Peterfreund , Dominik D. Freydenberger , Benny Kimelfeld , and Markus Kr\u00f6 ll. Complexity bounds for relational algebra over document spanners. CoRR, abs\/1901.04182 , 2019 . Liat Peterfreund, Dominik D. Freydenberger, Benny Kimelfeld, and Markus Kr\u00f6 ll. Complexity bounds for relational algebra over document spanners. CoRR, abs\/1901.04182, 2019."},{"key":"e_1_3_2_1_25_1","volume-title":"ICDT","author":"Peterfreund Liat","year":"2019","unstructured":"Liat Peterfreund , Balder ten Cate , Ronald Fagin , and Benny Kimelfeld . Recursive programs for document spanners . In ICDT , 2019 . Liat Peterfreund, Balder ten Cate, Ronald Fagin, and Benny Kimelfeld. Recursive programs for document spanners. In ICDT, 2019."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2949741.2949756"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1561\/1900000003"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2448496.2448498"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/1325851.1325968"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/361020.361025"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(84)90081-7"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/800070.802186"},{"key":"e_1_3_2_1_33_1","series-title":"JMLR Workshop and Conference Proceedings","first-page":"5244","volume-title":"ICML","author":"Weiss Gail","year":"2018","unstructured":"Gail Weiss , Yoav Goldberg , and Eran Yahav . Extracting automata from recurrent neural networks using queries and counterexamples . In ICML , volume 80 of JMLR Workshop and Conference Proceedings , pages 5244 -- 5253 . JMLR. org, 2018 . Gail Weiss, Yoav Goldberg, and Eran Yahav. Extracting automata from recurrent neural networks using queries and counterexamples. In ICML, volume 80 of JMLR Workshop and Conference Proceedings, pages 5244--5253. JMLR.org, 2018."}],"event":{"name":"SIGMOD\/PODS '19: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Amsterdam Netherlands","acronym":"SIGMOD\/PODS '19"},"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.3319699","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3294052.3319699","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:01:48Z","timestamp":1750208508000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3294052.3319699"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,25]]},"references-count":33,"alternative-id":["10.1145\/3294052.3319699","10.1145\/3294052"],"URL":"https:\/\/doi.org\/10.1145\/3294052.3319699","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"}}]}}