Abstract
We perform a fundamental investigation of the complexity of conjunctive query evaluation from the perspective of parameterized complexity. We classify sets of Boolean conjunctive queries according to the complexity of this problem. Previous work showed that a set of conjunctive queries is fixed-parameter tractable precisely when the set is equivalent to a set of queries having bounded treewidth. We present a fine classification of query sets up to parameterized logarithmic space reduction. We show that, in the bounded treewidth regime, there are three complexity degrees and that the properties that determine the degree of a query set are bounded pathwidth and bounded tree depth. We also engage in a study of the two higher degrees via logarithmic space machine characterizations and complete problems. Our work yields a significantly richer perspective on the complexity of conjunctive queries and, at the same time, suggests new avenues of research in parameterized complexity.
- S. Abiteboul, R. Hull, and V. Vianu. 1995. Foundations of Databases. Addison-Wesley. Google Scholar
Digital Library
- A. Blumensath and B. Courcelle. 2010. On the monadic second-order transduction hierarchy. Logical Methods in Computer Science 6, 2 (2010).Google Scholar
- H. Bodlaender. 1998. A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science 209 (1998), 1--45. Google Scholar
Digital Library
- Ashok K. Chandra and Philip M. Merlin. 1977. Optimal implementation of conjunctive queries in relational data bases. In Proceedings of STOC’77. 77--90. Google Scholar
Digital Library
- Hubie Chen and Martin Grohe. 2010. Constraint satisfaction with succinctly specified relations. Journal of Computing System Science 76, 8 (2010), 847--860. Google Scholar
Digital Library
- Y. Chen, J. Flum, and M. Grohe. 2003. Bounded nondeterminism and alternation in parameterized complexity theory. In Proceedings of the 18th IEEE Conference on Computational Complexity. 13--29.Google Scholar
- Y. Chen and M. Müller. 2014. Bounded variable logic, parameterized logarithmic space and Savitch’s theorem. 39th Mathematical Foundations of Computer Science (2014).Google Scholar
- A. Chiu, G. Davida, and B. Litow. 2001. Division in logspace-uniform NC1. Theoretical Informatics and Applications 35 (2001), 259--275.Google Scholar
- N. Creignou, S. Khanna, and M. Sudan. 2001. Complexity Classification of Boolean Constraint Satisfaction Problems. Society for Industrial and Applied Mathematics. Google Scholar
Digital Library
- Nadia Creignou, Phokion G. Kolaitis, and Heribert Vollmer (Eds.). 2008. Complexity of Constraints - An Overview of Current Research Themes. Lecture Notes in Computer Science, Vol. 5250. Springer. Google Scholar
Digital Library
- V. Dalmau and P. Jonsson. 2004. The complexity of counting homomorphisms seen from the other side. Theoretical Computer Science 329 (2004), 315--323. Google Scholar
Digital Library
- R. G. Downey and M. R. Fellows. 1999. Parameterized Complexity. Springer. Google Scholar
Digital Library
- M. Elberfeld, C. Stockhusen, and T. Tantau. 2012. On the space complexity of parameterized problems. 7th International Symposium of Parameterized and Exact Computation, Springer LNCS 7535 (2012), 206--217. Google Scholar
Digital Library
- T. Feder and M. Y. Vardi. 1999. The computational structure of monotone monadic SNP and constraint satisfaction: A study through datalog and group theory. SIAM Journal on Computing 28, 1 (1999), 57--104. Google Scholar
Digital Library
- J. Flum, M. Frick, and M. Grohe. 2002. Query evaluation via tree-decompositions. Journal of the ACM 49, 6 (2002), 716--752. Google Scholar
Digital Library
- J. Flum and M. Grohe. 2003. Describing parameterized complexity classes. Information and Computation 187 (2003), 291--319. Google Scholar
Digital Library
- J. Flum and M. Grohe. 2006a. The parameterized complexity of counting problems. SIAM Journal on Computing 33 (2006), 892--922. Google Scholar
Digital Library
- J. Flum and M. Grohe. 2006b. Parameterized Complexity Theory. Springer. Google Scholar
Digital Library
- Georg Gottlob, Nicola Leone, and Francesco Scarcello. 2001. The complexity of acyclic conjunctive queries. Journal of the ACM 48, 3 (2001), 431--498. Google Scholar
Digital Library
- Georg Gottlob, Nicola Leone, and Francesco Scarcello. 2002. Hypertree decompositions and tractable queries. Journal of Computer and Systems Science. 64, 3 (2002), 579--627.Google Scholar
Digital Library
- Martin Grohe. 2007. The complexity of homomorphism and constraint satisfaction problems seen from the other side. Journal of the ACM 54, 1 (2007). Google Scholar
Digital Library
- Martin Grohe, Thomas Schwentick, and Luc Segoufin. 2001. When is the evaluation of conjunctive queries tractable? In STOC 2001. Google Scholar
Digital Library
- P. Kolaitis and M. Y. Vardi. 1998. Conjunctive-query containment and constraint satisfaction. In Proceedings of the 17th ACM Symposium on Principles of Database Systems 10 (1998, full version at: http://www.cs.rice.edu/∼vardi/papers), 205--213. Google Scholar
Digital Library
- R. E. Ladner and N. A. Lynch. 1976. Relativization of questions about log space computability. Mathematical Systems Theory 10 (1976), 19--32.Google Scholar
Cross Ref
- Dániel Marx. 2010a. Can you beat treewidth? Theory of Computing 6, 1 (2010), 85--112. DOI:?att hlink="http://dx.doi.org/10.4086/toc.2010.v006a005" ?http://dx.?brk?doi.org/10.4086/toc.2010.v006a005Google Scholar
- Dániel Marx. 2010b. Tractable hypergraph properties for constraint satisfaction and conjunctive queries. In Proceedings of the 42nd ACM Symposium on Theory of Computing. 735--744. Google Scholar
Digital Library
- J. Nešetřil and P. O. de Mendez. 2006. Tree depth, subgraph coloring, and homomorphism bounds. European Journal of Combinatorics 27, 6 (2006), 1022--1041. Google Scholar
Digital Library
- C. Papadimitriou and M. Yannakakis. 1999. On the complexity of database queries. Journal of Computers System Science 58, 3 (1999), 407--427. Google Scholar
Digital Library
- Nicole Schweikardt, Thomas Schwentick, and Luc Segoufin. 2009. Database theory: Query languages. In Algorithms and Theory of Computation Handbook (2nd ed.), Mikhail J. Atallah and Marina Blanton (Eds.). Vol. 2: Special Topics and Techniques. CRC Press, Chapter 19. Google Scholar
Digital Library
Index Terms
The Fine Classification of Conjunctive Queries and Parameterized Logarithmic Space
Recommendations
The fine classification of conjunctive queries and parameterized logarithmic space complexity
PODS '13: Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGAI symposium on Principles of database systemsWe perform a fundamental investigation of the complexity of conjunctive query evaluation from the perspective of parameterized complexity. We classify sets of boolean conjunctive queries according to the complexity of this problem. Previous work showed ...
When is approximate counting for conjunctive queries tractable?
STOC 2021: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of ComputingConjunctive queries are one of the most common class of queries used in database systems, and the best studied in the literature. A seminal result of Grohe, Schwentick, and Segoufin (STOC 2001) demonstrates that for every class G of graphs, the ...
Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations
PODS '22: Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database SystemsWe study the complexity of approximating the number of answers to a small query φ in a large database D. We establish an exhaustive classification into tractable and intractable cases if φ is a conjunctive query possibly including disequalities and ...






Comments