84 search results - page 3 / 17 » Decidable Containment of Recursive Queries |
SEBD
2007
13 years 7 months ago
2007
We consider the problem of query containment over an object data model derived from F-logic. F-logic has generated considerable interest commercially, in the academia, and within ...
ICDT
2009
ACM
14 years 6 months ago
2009
ACM
We study containment and equivalence of (unions of) conjunctive queries on relations annotated with elements of a commutative semiring. Such relations and the semantics of positiv...
ICDT
1995
ACM
13 years 9 months ago
1995
ACM
Following results are sketched in this extended abstract: (1) Datalog recursive programs where each rule has at most one subgoal called unit recursions are shown to be bounded, wit...
PODS
2006
ACM
14 years 6 months ago
2006
ACM
Query containment is a fundamental algorithmic problem in database query processing and optimization. Under set semantics, the query-containment problem for conjunctive queries ha...
ICALP
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. We prove that observational equivalence of IA3 + Y0 (3rdorder Idealized Algol with 0th-order recursion) is equivalent to the DPDA Equivalence Problem, and hence decidable...