On the expressive power of the relational calculus with arithmetic constraints (extended abstract)

Authors:
Gabriel M. Kuper
Affiliations:
-
Venue:
ICDT '90 Proceedings of the third international conference on database theory on Database theory
Year:
1990

Citing 0
Cited 4

Finitely representable databases (extended abstract)

PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Relational expressive power of constraint query languages

PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the decidability of semi-linearity for semi-algebraic sets and its implications for spatial databases (extended abstract)

PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Relational expressive power of constraint query languages

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

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.