Nofar Carmeli
Skip Abstract Section
Abstract
We study the enumeration complexity of Unions of Conjunctive Queries (UCQs). We aim to identify the UCQs that are tractable in the sense that the answer tuples can be enumerated with a linear preprocessing phase and a constant delay between every successive tuples. It has been established that, in the absence of self-joins and under conventional complexity assumptions, the CQs that admit such an evaluation are precisely the free-connex ones. A union of tractable CQs is always tractable. We generalize the notion of free-connexity from CQs to UCQs, thus showing that some unions containing intractable CQs are, in fact, tractable. Interestingly, some unions consisting of only intractable CQs are tractable too. We show how to use the techniques presented in this article also in settings where the database contains cardinality dependencies (including functional dependencies and key constraints) or when the UCQs contain disequalities. The question of finding a full characterization of the tractability of UCQs remains open. Nevertheless, we prove that, for several classes of queries, free-connexity fully captures the tractable UCQs.
- Mahmoud Abo Khamis, Hung Q. Ngo, and Dan Suciu. 2017. What do Shannon-type inequalities, submodular width, and disjunctive datalog have to do with one another? In Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems. 429–444.Google Scholar
Digital Library
- J. Alman and V. V. Williams. 2018. Limits on all known (and some unknown) approaches to matrix multiplication. In Proceedings of the 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS). 580–591.Google Scholar
- N. Alon, R. Yuster, and U. Zwick. 1997. Finding and counting given length cycles. Algorithmica 17, 3 (1997), 209–223. DOI:https://doi.org/10.1007/BF02523189Google ScholarCross Ref
- Guillaume Bagan, Arnaud Durand, and Etienne Grandjean. 2007. On acyclic conjunctive queries and constant delay enumeration. In Proceedings of the International Workshop on Computer Science Logic. Springer, 208–222.Google ScholarCross Ref
- Catriel Beeri, Ronald Fagin, David Maier, and Mihalis Yannakakis. 1983. On the desirability of acyclic database schemes. Journal of the ACM (JACM) 30, 3 (1983), 479–513.Google ScholarDigital Library
- Christoph Berkholz, Fabian Gerhardt, and Nicole Schweikardt. 2020. Constant delay enumeration for conjunctive queries: A tutorial. ACM SIGLOG News 7, 1 (2020), 4–33.Google ScholarDigital Library
- Christoph Berkholz, Jens Keppeler, and Nicole Schweikardt. 2017. Answering conjunctive queries under updates. In Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS 2017), (Chicago, IL, May 14-19, 2017). 303–318.Google ScholarDigital Library
- Christoph Berkholz, Jens Keppeler, and Nicole Schweikardt. 2018. Answering UCQs under updates and in the presence of integrity constraints. In Proceedings of the 21st International Conference on Database Theory (ICDT 2018), (March 26-29, 2018, Vienna, Austria). 8:1–8:19.Google Scholar
- Johann Brault-Baron. 2013. De la pertinence de lâ énumération: Complexité en logiques propositionnelle et du premier ordre. Ph.D. Dissertation. Université de Caen.Google Scholar
- Florent Capelli and Yann Strozecki. 2018. Incremental delay enumeration: Space and time. Discrete Applied Mathematics (2018). DOI:https://doi.org/10.1016/j.dam.2018.06.038Google Scholar
- Nofar Carmeli and Markus Kröll. 2019. Enumeration complexity of conjunctive queries with functional dependencies. Theory of Computing Systems (2019). DOI:https://doi.org/10.1007/s00224-019-09937-9Google Scholar
- Nofar Carmeli and Markus Kröll. 2019. On the enumeration complexity of unions of conjunctive queries. In Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS 2019), Amsterdam, The Netherlands, June 30 - July 5, 2019, Dan Suciu, Sebastian Skritek, and Christoph Koch (Eds.). ACM, 134–148. DOI:https://doi.org/10.1145/3294052.3319700Google ScholarDigital Library
- Ashok K. Chandra and Philip M. Merlin. 1977. Optimal implementation of conjunctive queries in relational data bases. In Proceedings of the 9th Annual ACM Symposium on Theory of Computing (STOC’77). Association for Computing Machinery, New York, 77-90. DOI:https://doi.org/10.1145/800105.803397Google Scholar
- Arnaud Durand and Etienne Grandjean. 2007. First-order queries on structures of bounded degree are computable with constant delay. ACM Trans. Comput. Logic 8, 4, Article 21 (Aug. 2007). DOI:https://doi.org/10.1145/1276920.1276923Google ScholarDigital Library
- Friedrich Eisenbrand and Fabrizio Grandoni. 2004. On the complexity of fixed parameter clique and dominating set. Theoretical Computer Science 326, 1–3 (2004), 57–67.Google ScholarDigital Library
- Fernando Florenzano, Cristian Riveros, Martín Ugarte, Stijn Vansummeren, and Domagoj Vrgoc. 2018. Constant delay algorithms for regular document spanners. In Proceedings of PODS. ACM, 165–177.Google ScholarDigital Library
- Jörg Flum, Markus Frick, and Martin Grohe. 2002. Query evaluation via tree-decompositions. J. ACM 49, 6 (2002), 716–752.Google ScholarDigital Library
- Etienne Grandjean. 1996. Sorting, linear time and the satisfiability problem. Ann. Math. Artif. Intell. 16 (1996), 183–236. DOI:https://doi.org/10.1007/BF02127798Google ScholarCross Ref
- Muhammad Idris, Martin Ugarte, and Stijn Vansummeren. 2017. The dynamic Yannakakis algorithm: Compact and efficient query processing under updates. In Proceedings of the 2017 ACM International Conference on Management of Data (SIGMOD’17). ACM, New York,, 1259–1274. DOI:https://doi.org/10.1145/3035918.3064027.Google ScholarDigital Library
- Wojciech Kazana. 2013. Query evaluation with constant delay. Theses. École normale supérieure de Cachan - ENS Cachan. https://tel.archives-ouvertes.fr/tel-00919786Google Scholar
- François Le Gall. 2014. Powers of tensors and fast matrix multiplication. In Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation (ISSAC’14). ACM, New York,, 296–303. DOI:https://doi.org/10.1145/2608628.2608664Google ScholarDigital Library
- Andrea Lincoln, Virginia Vassilevska Williams, and R. Ryan Williams. 2018. Tight hardness for shortest cycles and paths in sparse graphs. In Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2018). 1236–1252.Google Scholar
- Bernard M. E. Moret and Henry D. Shapiro. 1991. Algorithms from P to NP: Volume 1: Design & Efficiency. Benjamin-Cummings.Google Scholar
- Matthias Niewerth and Luc Segoufin. 2018. Enumeration of MSO queries on strings with constant delay and logarithmic updates. In Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (Houston, TX, , June 10-15, 2018), Jan Van den Bussche and Marcelo Arenas (Eds.). ACM, 179–191. DOI:https://doi.org/10.1145/3196959.3196961Google ScholarDigital Library
- Nicole Schweikardt, Luc Segoufin, and Alexandre Vigny. 2018. Enumeration for FO queries over nowhere dense graphs. In Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (Houston, TX, , June 10-15, 2018), Jan Van den Bussche and Marcelo Arenas (Eds.). ACM, 151–163. DOI:https://doi.org/10.1145/3196959.3196971Google ScholarDigital Library
- Luc Segoufin. 2015. Constant delay enumeration for conjunctive queries. SIGMOD Rec. 44, 1 (May 2015), 10–17. DOI:https://doi.org/10.1145/2783888.2783894Google ScholarDigital Library
- 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.Google Scholar
- Yann Strozecki. 2010. Enumeration complexity and matroid decomposition. Ph.D. Dissertation. Université Paris Diderot - Paris 7.Google Scholar
- Mihalis Yannakakis. 1981. Algorithms for acyclic database schemes. In Proceedings of the 7th International Conference on Very Large Data Bases - Volume 7 (VLDB’81). VLDB Endowment, 82–94. http://dl.acm.org/citation.cfm?id=1286831.1286840.Google ScholarDigital Library
Index Terms
- On the Enumeration Complexity of Unions of Conjunctive Queries
Recommendations
On the Enumeration Complexity of Unions of Conjunctive Queries
PODS '19: Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database SystemsWe study the enumeration complexity of Unions of Conjunctive Queries (UCQs). We aim to identify the UCQs that are tractable in the sense that the answer tuples can be enumerated with a linear preprocessing phase and a constant delay between every ...
Conjunctive Queries With Self-Joins, Towards a Fine-Grained Enumeration Complexity Analysis
PODS '23: Proceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database SystemsEven though query evaluation is a fundamental task in databases, known classifications of conjunctive queries by their fine-grained complexity only apply to queries without self-joins. We study how self-joins affect enumeration complexity, with the aim ...
Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration
PODS'20: Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database SystemsAs data analytics becomes more crucial to digital systems, so grows the importance of characterizing the database queries that admit a more efficient evaluation. We consider the tractability yardstick of answer enumeration with a polylogarithmic delay ...
Comments