Relational expressive power of constraint query languages.
The expressive power of first-order query languages with several classes of equality and inequality constraints is studied in this paper. We settle the conjecture that recursive queries such as parity test and transitive closure cannot be expressed in the relational calculus augmented with polynomia...
| izdano v: | Journal of the ACM 45, 1 (1998). |
|---|---|
| Glavni avtor: | |
| Format: | Article |
| Jezik: | angleščina |
| Teme: |