710 search results - page 1 / 142 » Relational Expressive Power of Constraint Query Languages |
JACM
1998
13 years 5 months ago
1998
LCC
1994
13 years 9 months ago
1994
We give an AC0 upper bound on the complexity of rst-oder queries over (in nite) databases de ned by restricted linear constraints. This result enables us to deduce the non-expressi...
CP
2010
Springer
13 years 4 months ago
2010
Springer
We study the expressibility problem: given a finite constraint language Γ on a finite domain and another relation R, can Γ express R? We prove, by an explicit family of example...
PODS
1997
ACM
13 years 9 months ago
1997
ACM
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...
DEDUCTIVE
1994
13 years 6 months ago
1994
Non-deterministic operators are needed in First-Order relational languages and Datalog to extend the expressive power of such languages and support efficient formulations of lowco...