Skip to main content
SpringerLink
Log in

Expressive Power of Query Languages

  • Reference work entry
  • First Online:
Encyclopedia of Database Systems

  • 26 Accesses

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 4,499.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 6,499.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Abiteboul S, Hull R, Vianu V. Foundations of databases. Reading: Addison-Wesley; 1995.

    MATH  Google Scholar 

  2. Blass A, Gurevich Y, Kozen D. A zero-one law for logic with a fixed-point operator. Inf Control. 1985;67(1–3):70–90.

    Article  MathSciNet  MATH  Google Scholar 

  3. Chandra A, Harel D. Structure and complexity of relational queries. J Comput Syst Sci. 1982;25(1):99–128.

    Article  MATH  Google Scholar 

  4. Fagin R. Monadic generalized spectra. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik. 1975;21(1):89–96.

    Article  MathSciNet  MATH  Google Scholar 

  5. Fagin R. Probabilities on finite models. J Symb Log. 1976;41(1):50–8.

    Article  MathSciNet  MATH  Google Scholar 

  6. Grädel E, Kolaitis PH, Libkin L, Marx M, Spencer J, Vardi MY, Venema Y, Weinstein S. Finite model theory and its applications. Berlin: Springer; 2007.

    MATH  Google Scholar 

  7. Grohe M. Fixed-point logics on planar graphs. In: Proceedings of the IEEE Symposium on Logic in Computer Science; 1998. p. 6–15.

    Google Scholar 

  8. Immerman N. Relational queries computable in polynomial time (extended abstract). In: Proceedings of the 14th Annual ACM Symposium on Theory of Computing; 1982. p. 147–52.

    Google Scholar 

  9. Immerman N. Descriptive complexity. Berlin: Springer; 1998.

    MATH  Google Scholar 

  10. Klug A. Equivalence of relational algebra and relational calculus query languages having aggregate functions. J ACM. 1982;29(3):699–717.

    Article  MathSciNet  MATH  Google Scholar 

  11. Libkin L. Expressive power of SQL. Theor Comput Sci. 2003;296(3):379–404.

    Article  MathSciNet  MATH  Google Scholar 

  12. Libkin L. Elements of finite model theory. Berlin: Springer; 2004.

    Book  MATH  Google Scholar 

  13. Libkin L. Logics for unranked trees: an overview. Logic Methods Comput Sci. 2006;2(3):1–31.

    MathSciNet  MATH  Google Scholar 

  14. Vardi MY. The complexity of relational query languages. In: Proceedings of the 14th Annual ACM Symposium on Theory of Computing; 1982. p. 137–146.

    Google Scholar 

  15. Wong L. Normal forms and conservative extension properties for query languages over collection types. J Comput Syst Sci. 1996;52(3):495–505.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Informatics, University of Edinburgh, Edinburgh, Scotland, UK

    Leonid Libkin

Authors
  1. Leonid Libkin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Leonid Libkin .

Editor information

Editors and Affiliations

  1. Georgia Institute of Technology College of Computing, Atlanta, GA, USA

    Ling Liu

  2. University of Waterloo School of Computer Science, Waterloo, ON, Canada

    M. Tamer Özsu

Section Editor information

  1. School of Informatics, University of Edinburgh, Edinburgh, Scotland, UK

    Leonid Libkin

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Science+Business Media, LLC, part of Springer Nature

About this entry

Check for updates. Verify currency and authenticity via CrossMark

Cite this entry

Libkin, L. (2018). Expressive Power of Query Languages. 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_1239

Download citation

Publish with us

Policies and ethics

Search

Navigation