Skip to main content
SpringerLink
Log in

Expressive Power of Query Languages

  • Reference work entry
Book cover Encyclopedia of Database Systems

  • 256 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 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. Abiteboul S., Hull R., and Vianu V. Foundations of Databases, Addison-Wesley, Reading, MA, 1995.

    Google Scholar 

  2. Blass A., Gurevich Y., and Kozen D. A zero-one law for logic with a fixed-point operator. Inform. Control, 67:70–90, 1985.

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  5. Fagin R. Probabilities on finite models. J. Symbolic Logic, 41:50–58, 1976.

    Article  MATH  MathSciNet  Google Scholar 

  6. Grädel E., Kolaitis Ph., Libkin L., Marx M., Spencer J., Vardi M.Y., Venema Y., and Weinstein S. Finite Model Theory and its Applications. Springer, Berlin, 2007.

    MATH  Google Scholar 

  7. Grohe M. Fixed-point logics on planar graphs. In Proc. IEEE Symposium on Logic in Computer Science, 1998, pp. 6–15.

    Google Scholar 

  8. Immerman N. Relational queries computable in polynomial time (extended abstract). In Proc. ACM Symposium on Theory of Computing, 1982, pp. 147–152.

    Google Scholar 

  9. Immerman N. Descriptive Complexity. Springer, Berlin, 1998.

    Google Scholar 

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

    Article  MATH  Google Scholar 

  11. Libkin L. Expressive power of SQL. Theor. Comput. Sci., 296:379–404, 2003.

    MATH  MathSciNet  Google Scholar 

  12. Libkin L. Elements of Finite Model Theory. Springer, Berlin, 2004.

    MATH  Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Edinburgh, Edinburgh, UK

    Leonid Libkin

Authors
  1. Leonid Libkin
    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

Libkin, L. (2009). Expressive Power of Query Languages. In: LIU, L., ÖZSU, M.T. (eds) Encyclopedia of Database Systems. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-39940-9_1239

Download citation

Publish with us

Policies and ethics

Search

Navigation