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. Foundations of Databases. Addison-Wesley, 1995. Google Scholar
Digital Library
- A. Blumensath and B. Courcelle. On the monadic second-order transduction hierarchy. Logical Methods in Computer Science, 6(2), 2010.Google Scholar
- H. Bodlaender. A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science, 209:1--45, 1998. Google Scholar
Digital Library
- A. K. Chandra and P. M. Merlin. Optimal implementation of conjunctive queries in relational data bases. In Proceddings of STOC'77, pages 77--90, 1977. Google Scholar
Digital Library
- H. Chen and M. Grohe. Constraint satisfaction with succinctly specified relations. Journal of Computer and System Sciences, 76(8):847--860, 2010. Google Scholar
Digital Library
- Y. Chen, J. Flum, and M. Grohe. Bounded nondeterminism and alternation in parameterized complexity theory. 18th IEEE Conference on Computational Complexity, pages 13--29, 2003.Google Scholar
Cross Ref
- N. Creignou, S. Khanna, and M. Sudan. Complexity Classification of Boolean Constraint Satisfaction Problems. SIAM Monographs on Discrete Mathematics and Applications. Society for Industrial and Applied Mathematics, 2001. Google Scholar
Digital Library
- N. Creignou, P. G. Kolaitis, and H. Vollmer, editors. Complexity of Constraints - An Overview of Current Research Themes, volume 5250 of Lecture Notes in Computer Science. Springer, 2008. Google Scholar
Digital Library
- V. Dalmau and P. Jonsson. The complexity of counting homomorphisms seen from the other side. Theoretical Computer Science, 329:315--323, 2004. Google Scholar
Digital Library
- R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer, 1999. Google Scholar
Digital Library
- M. Elberfeld, C. Stockhusen, and T. Tantau. On the space complexity of parameterized problems. 7th International Symposium of Parameterized and Exact Computation, Springer LNCS, 7535:206--217, 2012. Google Scholar
Digital Library
- T. Feder and M. Y. Vardi. The computational structure of monotone monadic snp and constraint satisfaction: A study through datalog and group theory. SIAM Journal on Computing, 28(1):57--104, 1999. Google Scholar
Digital Library
- J. Flum, M. Frick, and Grohe. Query evaluation via tree-decompositions. Journal of the ACM, 49(6):716--752, 2002. Google Scholar
Digital Library
- J. Flum and M. Grohe. Describing parameterized complexity classes. Information and Computation, 187:291--319, 2003. Google Scholar
Digital Library
- J. Flum and M. Grohe. The parameterized complexity of counting problems. SIAM Journal on Computing, 33:892--922, 2006. Google Scholar
Digital Library
- J. Flum and M. Grohe. Parameterized Complexity Theory. Springer, 2006. Google Scholar
Digital Library
- G. Gottlob, N. Leone, and F. Scarcello. The complexity of acyclic conjunctive queries. Journal of the ACM, 48(3):431--498, 2001. Google Scholar
Digital Library
- G. Gottlob, N. Leone, and F. Scarcello. Hypertree decompositions and tractable queries. J. Comput. Syst. Sci., 64(3):579--627, 2002.Google Scholar
Digital Library
- M. Grohe. The complexity of homomorphism and constraint satisfaction problems seen from the other side. Journal of the ACM, 54(1), 2007. Google Scholar
Digital Library
- M. Grohe, T. Schwentick, and L. Segoufin. When is the evaluation of conjunctive queries tractable? In STOC 2001, 2001. Google Scholar
Digital Library
- P. Kolaitis and M. Y. Vardi. Conjunctive-query containment and constraint satisfaction. 17th ACM Symposium on Principles of Database Systems, 10:205--213, 1998, full version at: http://www.cs.rice.edu/~vardi/papers. Google Scholar
Digital Library
- R. E. Ladner and N. A. Lynch. Relativization of questions about log space computability. Mathematical Systems Theory, 10:19--32, 1976.Google Scholar
Cross Ref
- D. Marx. Tractable hypergraph properties for constraint satisfaction and conjunctive queries. In Proceedings of the 42nd ACM Symposium on Theory of Computing, pages 735--744, 2010. Google Scholar
Digital Library
- J. Nešetřil and P. O. de Mendez. Tree depth, subgraph coloring, and homomorphism bounds. European Journal of Combinatorics, 27(6):1022--1041, 2006. Google Scholar
Digital Library
- C. Papadimitriou and M. Yannakakis. On the Complexity of Database Queries. Journal of Computer and System Sciences, 58(3):407--427, 1999. Google Scholar
Digital Library
- N. Schweikardt, T. Schwentick, and L. Segoufin. Database theory: Query languages. In M. J. Atallah and M. Blanton, editors, Algorithms and Theory of Computation Handbook}, volume 2: Special Topics and Techniques, chapter 19. CRC Press, second edition, Nov 2009. Google Scholar
Digital Library
Index Terms
The fine classification of conjunctive queries and parameterized logarithmic space complexity
Recommendations
The Fine Classification of Conjunctive Queries and Parameterized Logarithmic Space
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 ...
Parameterized complexity dichotomy for Steiner Multicut
We consider the Steiner Multicut problem, which asks, given an undirected graph G, a collection T = { T 1 , ź , T t } , T i ź V ( G ) , of terminal sets of size at most p, and an integer k, whether there is a set S of at most k edges or nodes such that ...
On the space complexity of parameterized problems
IPEC'12: Proceedings of the 7th international conference on Parameterized and Exact ComputationParameterized complexity theory measures the complexity of computational problems predominantly in terms of their parameterized time complexity. The purpose of the present paper is to demonstrate that the study of parameterized space complexity can give ...






Comments