Skip to main content

Expressive Power of Query Languages

  • 88 Accesses

Definition

The study of expressive power concentrates on comparing classes of queries that can be expressed in different languages, and on proving expressibility - or inexpressibility - of certain queries in a query language.

Historical Background

Ever since Codd proposed relational calculus (first-order predicate logic) as a basic relational query language, it has been common for database query languages to have limited expressiveness. If a language cannot express everything computable, then it is natural to ask:

  1. 1.

    What queries cannot be expressed in a language

  2. 2.

    Which methods are available for proving such results?

Furthermore, if there are two query languages 1 and 2, one may want to compare their expressiveness: for example, 1 ⊈  2 means that all queries expressible in 1 are also expressible in 2, but there are queries expressible in 2 that are not expressible in 1.

In 1975, Fagin [4] showed that queries such as the transitive closure of a graph and connectivity...

Keywords

  • Query Language
  • Transitive Closure
  • Aggregate Function
  • Parity Query
  • Datalog Program

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

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:70–90.

    MathSciNet  CrossRef  MATH  Google Scholar 

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

    CrossRef  MATH  Google Scholar 

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

    MathSciNet  CrossRef  MATH  Google Scholar 

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

    MathSciNet  CrossRef  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 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 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:699–717.

    CrossRef  MATH  Google Scholar 

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

    MathSciNet  CrossRef  MATH  Google Scholar 

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

    CrossRef  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: Proceeding of the 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:495–505.

    MathSciNet  CrossRef  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Leonid Libkin .

Editor information

Editors and Affiliations

Section Editor information

Rights and permissions

Reprints and Permissions

Copyright information

© 2016 Springer Science+Business Media LLC

About this entry

Cite this entry

Libkin, L. (2016). Expressive Power of Query Languages. In: Liu, L., Özsu, M. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4899-7993-3_1239-2

Download citation

  • DOI: https://doi.org/10.1007/978-1-4899-7993-3_1239-2

  • Received:

  • Accepted:

  • Published:

  • Publisher Name: Springer, New York, NY

  • Online ISBN: 978-1-4899-7993-3

  • eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering