skip to main content
research-article

The Fine Classification of Conjunctive Queries and Parameterized Logarithmic Space

Authors Info & Claims
Published:11 May 2015Publication History
Skip Abstract Section

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.

References

  1. S. Abiteboul, R. Hull, and V. Vianu. 1995. Foundations of Databases. Addison-Wesley. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. A. Blumensath and B. Courcelle. 2010. On the monadic second-order transduction hierarchy. Logical Methods in Computer Science 6, 2 (2010).Google ScholarGoogle Scholar
  3. H. Bodlaender. 1998. A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science 209 (1998), 1--45. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  5. Hubie Chen and Martin Grohe. 2010. Constraint satisfaction with succinctly specified relations. Journal of Computing System Science 76, 8 (2010), 847--860. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 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 ScholarGoogle Scholar
  7. 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 ScholarGoogle Scholar
  8. A. Chiu, G. Davida, and B. Litow. 2001. Division in logspace-uniform NC1. Theoretical Informatics and Applications 35 (2001), 259--275.Google ScholarGoogle Scholar
  9. N. Creignou, S. Khanna, and M. Sudan. 2001. Complexity Classification of Boolean Constraint Satisfaction Problems. Society for Industrial and Applied Mathematics. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  11. V. Dalmau and P. Jonsson. 2004. The complexity of counting homomorphisms seen from the other side. Theoretical Computer Science 329 (2004), 315--323. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. R. G. Downey and M. R. Fellows. 1999. Parameterized Complexity. Springer. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  14. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  15. J. Flum, M. Frick, and M. Grohe. 2002. Query evaluation via tree-decompositions. Journal of the ACM 49, 6 (2002), 716--752. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. J. Flum and M. Grohe. 2003. Describing parameterized complexity classes. Information and Computation 187 (2003), 291--319. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. J. Flum and M. Grohe. 2006a. The parameterized complexity of counting problems. SIAM Journal on Computing 33 (2006), 892--922. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. J. Flum and M. Grohe. 2006b. Parameterized Complexity Theory. Springer. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Georg Gottlob, Nicola Leone, and Francesco Scarcello. 2001. The complexity of acyclic conjunctive queries. Journal of the ACM 48, 3 (2001), 431--498. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  21. Martin Grohe. 2007. The complexity of homomorphism and constraint satisfaction problems seen from the other side. Journal of the ACM 54, 1 (2007). Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Martin Grohe, Thomas Schwentick, and Luc Segoufin. 2001. When is the evaluation of conjunctive queries tractable? In STOC 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  24. R. E. Ladner and N. A. Lynch. 1976. Relativization of questions about log space computability. Mathematical Systems Theory 10 (1976), 19--32.Google ScholarGoogle ScholarCross RefCross Ref
  25. 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 ScholarGoogle Scholar
  26. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  27. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  28. C. Papadimitriou and M. Yannakakis. 1999. On the complexity of database queries. Journal of Computers System Science 58, 3 (1999), 407--427. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. 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 ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. The Fine Classification of Conjunctive Queries and Parameterized Logarithmic Space

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!