{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:12:32Z","timestamp":1750219952222,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":34,"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":"DFG","award":["LU 1417\/3-1"],"award-info":[{"award-number":["LU 1417\/3-1"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,6,12]]},"DOI":"10.1145\/3517804.3524166","type":"proceedings-article","created":{"date-parts":[[2022,6,13]],"date-time":"2022-06-13T13:29:54Z","timestamp":1655126994000},"page":"277-289","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficiently Enumerating Answers to Ontology-Mediated Queries"],"prefix":"10.1145","author":[{"given":"Carsten","family":"Lutz","sequence":"first","affiliation":[{"name":"University of Leipzig, Leipzig, Germany"}]},{"given":"Marcin","family":"Przybylko","sequence":"additional","affiliation":[{"name":"University of Leipzig, Leipzig, Germany"}]}],"member":"320","published-online":{"date-parts":[[2022,6,13]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.53"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/551350"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1017\/9781139025355"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74915-8_18"},{"key":"e_1_3_2_2_5_1","first-page":"712","volume-title":"Proceedings of IJCAI 2011","author":"Baget Jean-Francc","year":"2011","unstructured":"Jean-Francc ois Baget , Marie-Laure Mugnier , Sebastian Rudolph , and Micha\u00eb l Thomazo . Walking the complexity lines for generalized guarded existential rules . In Proceedings of IJCAI 2011 , pages 712 -- 717 . IJCAI\/AAAI, 2011 . https:\/\/doi.org\/10.5591\/978--1--57735--516--8\/IJCAI11--126 pathdoi:10.5591\/978--1--57735--516--8\/IJCAI11--126. 10.5591\/978--1--57735--516--8 Jean-Francc ois Baget, Marie-Laure Mugnier, Sebastian Rudolph, and Micha\u00eb l Thomazo. Walking the complexity lines for generalized guarded existential rules. In Proceedings of IJCAI 2011, pages 712--717. IJCAI\/AAAI, 2011. https:\/\/doi.org\/10.5591\/978--1--57735--516--8\/IJCAI11--126 pathdoi:10.5591\/978--1--57735--516--8\/IJCAI11--126."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3375395.3387653"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2019.8785823"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3424908"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2745754.2745767"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3385634.3385636"},{"key":"e_1_3_2_2_11_1","first-page":"1","volume-title":"Proceedings of MFCS 2019","author":"Berkholz Christoph","year":"2019","unstructured":"Christoph Berkholz and Nicole Schweikardt . Constant delay enumeration with fpt-preprocessing for conjunctive queries of bounded submodular width . In Proceedings of MFCS 2019 , pages 58: 1 -- 58 :15, 2019 . https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2019.58 pathdoi:10.4230\/LIPIcs.MFCS.2019.58. 10.4230\/LIPIcs.MFCS.2019.58 Christoph Berkholz and Nicole Schweikardt. Constant delay enumeration with fpt-preprocessing for conjunctive queries of bounded submodular width. In Proceedings of MFCS 2019, pages 58:1--58:15, 2019. https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2019.58 pathdoi:10.4230\/LIPIcs.MFCS.2019.58."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21768-0_9"},{"key":"e_1_3_2_2_13_1","first-page":"768","volume-title":"Proceedings of IJCAI 2013","author":"Bienvenu Meghyn","year":"2013","unstructured":"Meghyn Bienvenu , Magdalena Ortiz , Mantas Simkus , and Guohui Xiao . Tractable queries for lightweight description logics . In Proceedings of IJCAI 2013 , pages 768 -- 774 . IJCAI\/AAAI, 2013 . URL: http:\/\/www.aaai.org\/ocs\/index.php\/IJCAI\/IJCAI13\/paper\/view\/6908. Meghyn Bienvenu, Magdalena Ortiz, Mantas Simkus, and Guohui Xiao. Tractable queries for lightweight description logics. In Proceedings of IJCAI 2013, pages 768--774. IJCAI\/AAAI, 2013. URL: http:\/\/www.aaai.org\/ocs\/index.php\/IJCAI\/IJCAI13\/paper\/view\/6908."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2661643"},{"issue":"5","key":"e_1_3_2_2_15_1","first-page":"89","article-title":"Enumeration in data management (Dagstuhl seminar 19211)","volume":"9","author":"Boros Endre","year":"2019","unstructured":"Endre Boros , Benny Kimelfeld , Reinhard Pichler , and Nicole Schweikardt . Enumeration in data management (Dagstuhl seminar 19211) . Dagstuhl Reports , 9 ( 5 ): 89 -- 109 , 2019 . https:\/\/doi.org\/10.4230\/DagRep.9.5.89 pathdoi:10.4230\/DagRep.9.5.89. 10.4230\/DagRep.9.5.89 Endre Boros, Benny Kimelfeld, Reinhard Pichler, and Nicole Schweikardt. Enumeration in data management (Dagstuhl seminar 19211). Dagstuhl Reports, 9(5):89--109, 2019. https:\/\/doi.org\/10.4230\/DagRep.9.5.89 pathdoi:10.4230\/DagRep.9.5.89.","journal-title":"Dagstuhl Reports"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.3873"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.websem.2012.03.001"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2012.08.002"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-019-09937-9"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3450263"},{"key":"e_1_3_2_2_22_1","first-page":"393","volume-title":"Proceedings of PODS 2020","author":"Carmeli Nofar","year":"2020","unstructured":"Nofar Carmeli , Shai Zeevi , Christoph Berkholz , Benny Kimelfeld , and Nicole Schweikardt . Answering (unions of) conjunctive queries using random access and random-order enumeration . In Proceedings of PODS 2020 , pages 393 -- 409 , 2020 . https:\/\/doi.org\/10.1145\/3375395.3387662 pathdoi:10.1145\/3375395.3387662. 10.1145\/3375395.3387662 Nofar Carmeli, Shai Zeevi, Christoph Berkholz, Benny Kimelfeld, and Nicole Schweikardt. Answering (unions of) conjunctive queries using random access and random-order enumeration. In Proceedings of PODS 2020, pages 393--409, 2020. https:\/\/doi.org\/10.1145\/3375395.3387662 pathdoi:10.1145\/3375395.3387662."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(73)80029-7"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46135-3_21"},{"key":"e_1_3_2_2_25_1","first-page":"1","volume-title":"Proceedings of ICDT 2021","author":"Deep Shaleen","year":"2021","unstructured":"Shaleen Deep , Xiao Hu , and Paraschos Koutris . Enumeration algorithms for conjunctive queries with projection . In Proceedings of ICDT 2021 , pages 14: 1 -- 14 :17, 2021 . https:\/\/doi.org\/10.4230\/LIPIcs.ICDT.2021.14 pathdoi:10.4230\/LIPIcs.ICDT.2021.14. 10.4230\/LIPIcs.ICDT.2021.14 Shaleen Deep, Xiao Hu, and Paraschos Koutris. Enumeration algorithms for conjunctive queries with projection. In Proceedings of ICDT 2021, pages 14:1--14:17, 2021. https:\/\/doi.org\/10.4230\/LIPIcs.ICDT.2021.14 pathdoi:10.4230\/LIPIcs.ICDT.2021.14."},{"key":"e_1_3_2_2_26_1","first-page":"1","volume-title":"Proceedings of ICDT 2021","author":"Deep Shaleen","year":"2021","unstructured":"Shaleen Deep and Paraschos Koutris . Ranked enumeration of conjunctive query results . In Proceedings of ICDT 2021 , pages 5: 1 -- 5 :19, 2021 . https:\/\/doi.org\/10.4230\/LIPIcs.ICDT.2021.5 pathdoi:10.4230\/LIPIcs.ICDT.2021.5. 10.4230\/LIPIcs.ICDT.2021.5 Shaleen Deep and Paraschos Koutris. Ranked enumeration of conjunctive query results. In Proceedings of ICDT 2021, pages 5:1--5:19, 2021. https:\/\/doi.org\/10.4230\/LIPIcs.ICDT.2021.5 pathdoi:10.4230\/LIPIcs.ICDT.2021.5."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(84)90014-1"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.10.033"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02127798"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(84)90081-3"},{"key":"e_1_3_2_2_32_1","first-page":"1","volume-title":"Proceedings of ICDT 2016","author":"Markus Kr\u00f6","year":"2016","unstructured":"Markus Kr\u00f6 ll, Reinhard Pichler , and Sebastian Skritek . On the complexity of enumerating the answers to well-designed pattern trees . In Proceedings of ICDT 2016 , pages 22: 1 -- 22 :18, 2016 . https:\/\/doi.org\/10.4230\/LIPIcs.ICDT.2016.22 pathdoi:10.4230\/LIPIcs.ICDT.2016.22. 10.4230\/LIPIcs.ICDT.2016.22 Markus Kr\u00f6 ll, Reinhard Pichler, and Sebastian Skritek. On the complexity of enumerating the answers to well-designed pattern trees. In Proceedings of ICDT 2016, pages 22:1--22:18, 2016. https:\/\/doi.org\/10.4230\/LIPIcs.ICDT.2016.22 pathdoi:10.4230\/LIPIcs.ICDT.2016.22."},{"key":"e_1_3_2_2_33_1","volume-title":"Efficiently enumerating answers to ontology-mediated queries. CoRR, abs\/2203.09288","author":"Lutz Carsten","year":"2022","unstructured":"Carsten Lutz and Marcin Przyby\u0142ko . Efficiently enumerating answers to ontology-mediated queries. CoRR, abs\/2203.09288 , 2022 . https:\/\/doi.org\/10.48550\/arXiv.2203.09288 pathdoi:10.48550\/arXiv.2203.09288. 10.48550\/arXiv.2203.09288 Carsten Lutz and Marcin Przyby\u0142ko. Efficiently enumerating answers to ontology-mediated queries. CoRR, abs\/2203.09288, 2022. https:\/\/doi.org\/10.48550\/arXiv.2203.09288 pathdoi:10.48550\/arXiv.2203.09288."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/320107.320115"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783888.2783894"},{"key":"e_1_3_2_2_36_1","first-page":"82","volume-title":"Proceedings of the Seventh International Conference on Very Large Data Bases -","volume":"7","author":"Yannakakis Mihalis","year":"1981","unstructured":"Mihalis Yannakakis . Algorithms for acyclic database schemes . In Proceedings of the Seventh International Conference on Very Large Data Bases - Volume 7 , pages 82 -- 94 , 1981 . Mihalis Yannakakis. Algorithms for acyclic database schemes. In Proceedings of the Seventh International Conference on Very Large Data Bases - Volume 7, pages 82--94, 1981."}],"event":{"name":"SIGMOD\/PODS '22: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Philadelphia PA USA","acronym":"SIGMOD\/PODS '22"},"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.3524166","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3517804.3524166","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.3524166"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,12]]},"references-count":34,"alternative-id":["10.1145\/3517804.3524166","10.1145\/3517804"],"URL":"https:\/\/doi.org\/10.1145\/3517804.3524166","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"}}]}}