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.
Extended abstract
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. V. Aho and J. D. Ullman. Universality of Data Retrieval Languages.
N. Immerman. Relational Queries Computable in Polynomial Time. Information and Control, 68:86–104, 1986.
P. Kanellakis, G. Kuper and P. Revesz. Constraint Query Languages. Proc. 90 PODS, pp. 299–313, 1990.
M.Y. Vardi. The Complexity of Relational Query Languages. Proc. 14th ACM STOC, 137–146, 1982.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kuper, G.M. (1990). On the expressive power of the relational calculus with arithmetic constraints. In: Abiteboul, S., Kanellakis, P.C. (eds) ICDT '90. ICDT 1990. Lecture Notes in Computer Science, vol 470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53507-1_78
Download citation
DOI: https://doi.org/10.1007/3-540-53507-1_78
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53507-2
Online ISBN: 978-3-540-46682-6
eBook Packages: Springer Book Archive