On the expressive power of the relational calculus with arithmetic constraints

  • Gabriel M. Kuper
Constraint Logic Programming
Part of the Lecture Notes in Computer Science book series (LNCS, volume 470)

Abstract

We investigate the expressive power of the relational calculus with arithmetic constraints. We show that any generic query in this language is equivalent to some query in the standard relational calculus. As a result, transitive closure and parity cannot be expressed even with arithmetic constraints.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AU79]
    A. V. Aho and J. D. Ullman. Universality of Data Retrieval Languages.Google Scholar
  2. [I86]
    N. Immerman. Relational Queries Computable in Polynomial Time. Information and Control, 68:86–104, 1986.CrossRefGoogle Scholar
  3. [KKR90]
    P. Kanellakis, G. Kuper and P. Revesz. Constraint Query Languages. Proc. 90 PODS, pp. 299–313, 1990.Google Scholar
  4. [V82]
    M.Y. Vardi. The Complexity of Relational Query Languages. Proc. 14th ACM STOC, 137–146, 1982.Google Scholar

Copyright information

© Springer-Verlag 1990

Authors and Affiliations

  • Gabriel M. Kuper
    • 1
  1. 1.IBM T.J. Watson Research CenterYorktown Heights

Personalised recommendations