Skip to main content
SpringerLink
Log in

Parameterized Complexity of Queries

  • Reference work entry
Encyclopedia of Database Systems

  • 105 Accesses

Definition

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.

Historical Background

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 [12], which preceded the development of parameterized complexity theory (cf. also...

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Benedikt M. and Koch C. XPath Leashed. ACM Comput. Surv., 4(1), 2008.

    Google Scholar 

  2. Courcelle B. Graph rewriting: an algebraic and logic approach. In Handbook of Theoretical Computer Science, J. van Leeuwen (ed.). vol. 2, chap. 5, Elsevier B.V., Amsterdam, The Netherlands, 1990, pp. 193–242.

    Google Scholar 

  3. Downey R.G. and Fellows M.R. Parameterized Complexity. Springer, Berlin, 1999.

    Google Scholar 

  4. Downey R.G., Fellows M.R., and Taylor U. The parameterized complexity of relational database queries and an improved characterization of W[1]. In Proc. DMTCS ’96. Combinatorics, Complexity, and Logic, 1996, pp. 194–213.

    Google Scholar 

  5. Flum J. and Grohe M. Parameterized Complexity Theory. Springer, Berlin, 2006.

    Google Scholar 

  6. Frick M. and Grohe M. The complexity of first-order and monadic second-order logic revisited. In Proc. 17th Annual IEEE Symp. on Logic in Computer Science, 2002, pp. 215–224.

    Google Scholar 

  7. Gottlob G., Leone N., and Scarcello F. Hypertree decompositions and tractable queries. J. Comput. Syst. Sci., 64(3):579–627, 2002.

    MATH  MathSciNet  Google Scholar 

  8. Grohe M. Parameterized complexity for the database theorist. ACM SIGMOD Rec., 31(4), 2002.

    Google Scholar 

  9. Papadimitriou C.H. and Yannakakis M. On the complexity of database queries. In Proc. 16th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, 1997.

    Google Scholar 

  10. Thatcher J. and Wright J. Generalized finite automata theory with an application to a decision problem of second-order logic. Math. Syst. Theory, 2(1):57–81, 1968.

    MathSciNet  Google Scholar 

  11. Vardi M.Y. The complexity of relational query languages. In Proc. 14th Annual ACM Symp. on Theory of Computing, 1982, pp. 137–146.

    Google Scholar 

  12. Yannakakis M. Algorithms for acyclic database schemes. In Proc. of the Seventh Int. Conf. on Very Large Data Bases, 1981, pp. 82–94.

    Google Scholar 

  13. Yannakakis M. Perspectives on database theory. In Proc. of the 36th IEEE Symp. on Foundations of Computer Science, 1995, pp. 224–246.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Cornell University, Ithaca, NY, USA

    Christoph Koch

Authors
  1. Christoph Koch
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. College of Computing, Georgia Institute of Technology, 266 Ferst Drive, 30332-0765, Atlanta, GA, USA

    LING LIU (Professor) (Professor)

  2. Database Research Group David R. Cheriton School of Computer Science, University of Waterloo, 200 University Avenue West, N2L 3G1, Waterloo, ON, Canada

    M. TAMER ÖZSU (Professor and Director, University Research Chair) (Professor and Director, University Research Chair)

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer Science+Business Media, LLC

About this entry

Cite this entry

Koch, C. (2009). Parameterized Complexity of Queries. In: LIU, L., ÖZSU, M.T. (eds) Encyclopedia of Database Systems. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-39940-9_1244

Download citation

Publish with us

Policies and ethics

Search

Navigation