Linear vs. polynomial constraints in database query languages

  • Foto Afrati
  • Stavros S. Cosmadakis
  • Stéphane Grumbach
  • Gabriel M. Kuper
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 874)


We prove positive and negative results on the expressive power of the relational calculus augmented with linear constraints. We show the non-expressibility of some properties expressed by polynomial constraints. We consider in particular some queries involving the existence of lines. We study mainly constraints over real numbers, but we also present some results in the case of the natural numbers.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BJM93]
    A. Brodsky, J. Jaffar and M.J. Maher. Toward Practical Constraint Databases. Proc. 19th International Conference on Very Large Data Bases, Dublin, Ireland, 1993.Google Scholar
  2. [DG]
    J. Darlington and Y-K. Guo. Constraint Functional Programming. Tech. Report, Dept. of Computing, Imperial College, to appear.Google Scholar
  3. [Eh61]
    A. Ehrenfeucht. An Application of Games to the Completeness Problem for Formalized Theories. Fund. Math., 49:129–141, 1961.Google Scholar
  4. [En72]
    H. B. Enderton. A Mathematical Introduction to Logic. Academic Press 1972.Google Scholar
  5. [Fr54]
    R. Fraïssé. Sur quelques classifications des systémes de relations. Publications Scientifiques de l'Université d'Alger, Séries A, 1:35–182, 1954.Google Scholar
  6. [GS94]
    S. Grumbach and J. Su. Finitely representable databases. In Proc. 13th ACM PODS, 1994.Google Scholar
  7. [HJLL90]
    T. Huynh, L. Joskowicz, C. Lassez and J-L. Lassez. Reasoning About Linear Constraints Using Parametric Queries. Foundations of Software Technology and Theoretical Computer Science. Lecture Notes in Computer Science, Springer-Verlag vol. 472, 1990.Google Scholar
  8. [JL87]
    J. Jaffar and J.L. Lassez. Constraint Logic Programming. Proc. 14th ACM POPL, 111–119, 1987.Google Scholar
  9. [KG94]
    P. C. Kanellakis and D. Q. Goldin. Constraint programming and database query languages. In Proc. 2nd Conference on Theoretical Aspects of Computer Software (TACS), April 1994. (To appear in LNCS Spring-Verlag volume).Google Scholar
  10. [KKR90]
    P. Kanellakis, G. Kuper and P. Revesz. Constraint Query Languages. Proc. 9th ACM PODS, pp. 299–313, 1990. To appear in JCSS.Google Scholar
  11. [Kup93]
    G.M. Kuper. Aggregation in constraint databases. In Proc. First Workshop on Principles and Practice of Constraint Programming, 1993.Google Scholar
  12. [La90]
    J.L. Lassez. Querying Constraints. Proc. 9th ACM PODS, 1990.Google Scholar
  13. [Ma87]
    M. Maher. A Logic Semantics for a class of Committed Choice Languages. Proc. ICLP4, MIT Press 1987.Google Scholar
  14. [NS93]
    D. Niwinski and A. Stolboushkin. y=2x vs. y=3x. In Proc. IEEE Symp. of Logic in Computer Science, pages 172–178, Montreal, June 1993.Google Scholar
  15. [Re90]
    P.Z. Revesz. A Closed Form for Datalog Queries with Integer Order. Proc. 3rd International Conference on Database Theory, 1990. To appear in TCS.Google Scholar
  16. [Sa]
    V. Saraswat. Concurrent Constraint Logic Programming. MIT Press, to appear.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Foto Afrati
    • 1
  • Stavros S. Cosmadakis
    • 2
  • Stéphane Grumbach
    • 3
  • Gabriel M. Kuper
    • 4
  1. 1.Computer Science DivisionNational Technical University of AthensAthensGreece
  2. 2.New York UniversityUSA
  3. 3.I.N.R.I.A.Le ChesnayFrance
  4. 4.ECRCMünchenGermany

Personalised recommendations