Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. Brodsky, J. Jaffar and M.J. Maher. Toward Practical Constraint Databases. Proc. 19th International Conference on Very Large Data Bases, Dublin, Ireland, 1993.
J. Darlington and Y-K. Guo. Constraint Functional Programming. Tech. Report, Dept. of Computing, Imperial College, to appear.
A. Ehrenfeucht. An Application of Games to the Completeness Problem for Formalized Theories. Fund. Math., 49:129–141, 1961.
H. B. Enderton. A Mathematical Introduction to Logic. Academic Press 1972.
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.
S. Grumbach and J. Su. Finitely representable databases. In Proc. 13th ACM PODS, 1994.
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.
J. Jaffar and J.L. Lassez. Constraint Logic Programming. Proc. 14th ACM POPL, 111–119, 1987.
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).
P. Kanellakis, G. Kuper and P. Revesz. Constraint Query Languages. Proc. 9th ACM PODS, pp. 299–313, 1990. To appear in JCSS.
G.M. Kuper. Aggregation in constraint databases. In Proc. First Workshop on Principles and Practice of Constraint Programming, 1993.
J.L. Lassez. Querying Constraints. Proc. 9th ACM PODS, 1990.
M. Maher. A Logic Semantics for a class of Committed Choice Languages. Proc. ICLP4, MIT Press 1987.
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.
P.Z. Revesz. A Closed Form for Datalog Queries with Integer Order. Proc. 3rd International Conference on Database Theory, 1990. To appear in TCS.
V. Saraswat. Concurrent Constraint Logic Programming. MIT Press, to appear.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Afrati, F., Cosmadakis, S.S., Grumbach, S., Kuper, G.M. (1994). Linear vs. polynomial constraints in database query languages. In: Borning, A. (eds) Principles and Practice of Constraint Programming. PPCP 1994. Lecture Notes in Computer Science, vol 874. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58601-6_100
Download citation
DOI: https://doi.org/10.1007/3-540-58601-6_100
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58601-2
Online ISBN: 978-3-540-49032-6
eBook Packages: Springer Book Archive