Parameterized Complexity of Queries
Parameterized complexity theory is the study of the interaction between the fixing of parameters of input problems and their computational complexity. A central parameterized complexity concept is that of a fixed-parameter tractable (FPT) problem, which captures a strong notion of well-behavedness of a problem under the assumption that parameter values do not grow with input sizes. There is also a solid theory of fixed-parameter intractability, which gives strong evidence that for certain parameterizations of problems, no FPT algorithms can be found.
Fixed-parameter complexity theory is strongly associated with R. Downey and M. Fellows, who did much seminal work in the area (cf. [3, 5]). The first fixed-parameter complexity result in the context of database query evaluation was the linear-time query processing algorithm for acyclic conjunctive queries by Yannakakis in 1981 , which preceded the development of parameterized complexity theory (cf....
- 4.Downey RG, Fellows MR, Taylor U. The parameterized complexity of relational database queries and an improved characterization of W. In: Proceedings of the First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science Combinatorics, Complexity, and Logic; 1996. p. 194–213.Google Scholar
- 6.Frick M, Grohe M. The complexity of first-order and monadic second-order logic revisited. In: Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science; 2002. p. 215–24.Google Scholar
- 9.Papadimitriou CH, Yannakakis M. On the complexity of database queries. In: Proceedings of the 16th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems; 1997.Google Scholar
- 11.Vardi MY. The complexity of relational query languages. In: Proceedings of the 14th Annual ACM Symposium on Theory of Computing; 1982. p. 137–46.Google Scholar
- 12.Yannakakis M. Algorithms for acyclic database schemes. In: Proceedings of the 7th International Conference on Very Data Bases; 1981. p. 82–94.Google Scholar
- 13.Yannakakis M. Perspectives on database theory. In: Proceedings of the 36th IEEE Symposium on Foundations of Computer Science; 1995. p. 224–46.Google Scholar