On the expressive power of the relational calculus with arithmetic constraints
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.
Unable to display preview. Download preview PDF.
- [AU79]A. V. Aho and J. D. Ullman. Universality of Data Retrieval Languages.Google Scholar
- [KKR90]P. Kanellakis, G. Kuper and P. Revesz. Constraint Query Languages. Proc. 90 PODS, pp. 299–313, 1990.Google Scholar
- [V82]M.Y. Vardi. The Complexity of Relational Query Languages. Proc. 14th ACM STOC, 137–146, 1982.Google Scholar