F. Afrati, T. Andronikos and T. Kavalieros. On the expressiveness of first-order query languages. To appear in Proceedings of Conference on Constraint Programming, 1995. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Relational Expressive Power of Constraint Query Languages - Benedikt, Dong, Libkin, Wong (1996) (54 citations) (Correct)
....linear constraints are added to the relational calculus. In [2] it is shown that testing whether a constraint database is contained in a line is not definable with linear constraints. Testing whether a constraint database represents a line is not definable in first order with the order relation [3]. Parity and connectivity tests are examples of generic queries. That is, their answer does not change when a bijective map on the domain is applied to a database. It is therefore natural to pose the more general question below. The answer to this question can be applied to queries whose inputs ....
F. Afrati, T. Andronikos and T. Kavalieros. On the expressiveness of first-order query languages. To appear in Proceedings of Conference on Constraint Programming, 1995.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC