Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Benedikt M, Koch C. XPath Leashed. ACM Comput Surv. 2008;4(1):1.
Courcelle B. Graph rewriting: an algebraic and logic approach. In: van Leeuwen J, editor. Handbook of theoretical computer science, vol. 2. Amsterdam: Elsevier B.V.; 1990. p. 193–242 .chap. 5
Downey RG, Fellows MR. Parameterized complexity. Berlin: Springer; 1999.
Downey RG, Fellows MR, Taylor U. The parameterized complexity of relational database queries and an improved characterization of W[1]. In: Proceedings of the First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science Combinatorics, Complexity, and Logic; 1996. p. 194–213.
Flum J, Grohe M. Parameterized complexity theory. Berlin: Springer; 2006.
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.
Gottlob G, Leone N, Scarcello F. Hypertree decompositions and tractable queries. J Comput Syst Sci. 2002;64(3):579–627.
Grohe M. Parameterized complexity for the database theorist. ACM SIGMOD Rec. 2002;31(4):86.
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.
Thatcher J, Wright J. Generalized finite automata theory with an application to a decision problem of second-order logic. Math Syst Theory. 1968;2(1):57–81.
Vardi MY. The complexity of relational query languages. In: Proceedings of the 14th Annual ACM Symposium on Theory of Computing; 1982. p. 137–46.
Yannakakis M. Algorithms for acyclic database schemes. In: Proceedings of the 7th International Conference on Very Data Bases; 1981. p. 82–94.
Yannakakis M. Perspectives on database theory. In: Proceedings of the 36th IEEE Symposium on Foundations of Computer Science; 1995. p. 224–46.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Section Editor information
Rights and permissions
Copyright information
© 2018 Springer Science+Business Media, LLC, part of Springer Nature
About this entry
Cite this entry
Koch, C. (2018). Parameterized Complexity of Queries. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_1244
Download citation
DOI: https://doi.org/10.1007/978-1-4614-8265-9_1244
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-8266-6
Online ISBN: 978-1-4614-8265-9
eBook Packages: Computer ScienceReference Module Computer Science and Engineering