Skip to main content
SpringerLink
Log in

Computationally Complete Relational Query Languages

  • Reference work entry
Encyclopedia of Database Systems

Synonyms

Complete query languages; Chandra and Harel complete query languages

Definition

A relational query language (or query language) is a set of expressions (or programs). The semantics of a query language defines for each of these expressions a corresponding query which is a generic, computable function from finite relation instances to finite relation instances over fixed schemas. A query language is computationally complete (or complete) if it defines all queries.

The genericity condition is a consistency criterion requiring that a query commute with isomorphisms of the database domain. Thus, when applied to isomorphic input relation instances, a query returns isomorphic output relation instances. The concept of genericity is based on the well-accepted idea that the result of a query should be independent of the representation of data in a database, and should treat the elements of the database as uninterpreted objects [4]. The computability condition requires that the query...

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.

    MATH  Google Scholar 

  2. Abiteboul S. and Kanellakis P.C. Object identity as a query language primitive. J. ACM, 45(5):798–842, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  3. Abiteboul S. and Vianu V. Procedural languages for database queries and updates. J. Comput. Syst. Sci., 41(2):181–229, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  4. Aho A.V. and Ullman J.D. Universality of data retrieval languages. In Proc. 6th ACM SIGACT-SIGPLAN Symp. on Principles of Programming Languages, 1979, pp. 110–120.

    Google Scholar 

  5. Bancilhon F. On the completeness of query languages for relational data bases. In Proc. 7th Symp. on the Mathematical Foundations of Computer Science, 1978, pp. 112–123.

    Google Scholar 

  6. Chandra A. Programming primitives for database languages. In Proc. 8th ACM SIGACT-SIGPLAN Symp. on Principles of Programming Languages, 1981, pp. 50–62.

    Google Scholar 

  7. Chandra A. and Harel D. Computable queries for relational data bases. J. Comput. Syst. Sci., 21(2):156–178, 1980.

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  9. Codd E. A relational model for large shared databanks. Commun. ACM, 13(6):377–387, 1970.

    Article  MATH  Google Scholar 

  10. Codd E. Relational completeness of data base sublanguages. In Data Base Systems, R. Rustin (ed.). Prentice-Hall, Englewood, Cliffs, NJ, 1972, pp. 65–98.

    Google Scholar 

  11. Fagin R. Monadic generalized spectra. Zeitschrift für Math. Logik Grundlagen d. Math, 2189–96, 1975.

    MATH  MathSciNet  Google Scholar 

  12. Gyssens M., Van den Bussche J., and Van Gucht D. Complete geometric query languages. J. Comput. Syst. Sci., 58(3):483–511, 1999.

    Article  MATH  Google Scholar 

  13. Paredaens J. On the expressive power of the relational algebra. Inf. Process. Lett., 7(2):107–111, 1978.

    Article  MATH  MathSciNet  Google Scholar 

  14. Paredaens J. Spatial databases, a new frontier. In Proc. 5th Int. Conf. on Database Theory. 1995, pp. 14–32.

    Google Scholar 

  15. Tarski A. What are logical notions? History Phil. Logic, 7:154, 1986. J. Corcoran (ed.).

    MathSciNet  Google Scholar 

  16. Van den Bussche J., Van Gucht D., Andries M., and Gyssens M. On the completeness of object-creating database transformation languages. J. ACM, 44(2):272–319, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  17. 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 

Download references

Author information

Authors and Affiliations

  1. University of California-San Diego, La Jolla, CA, USA

    Victor Vianu

  2. Indiana University, Bloomington, IN, USA

    Dirk Van Gucht

Authors
  1. Victor Vianu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dirk Van Gucht
    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

Vianu, V., Gucht, D.V. (2009). Computationally Complete Relational 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_1243

Download citation

Publish with us

Policies and ethics

Search

Navigation