Sciweavers

Share
PODS
2004
ACM

On the Decidability of Containment of Recursive Datalog Queries - Preliminary report

12 years 6 months ago
On the Decidability of Containment of Recursive Datalog Queries - Preliminary report
The problem of deciding query containment has important applications in classical query optimization and heterogeneous database systems. Query containment is undecidable for unrestricted recursive queries, and decidable for recursive monadic queries and conjunctive queries over regular path expressions. In this paper, we identify a new class of recursive queries with decidable containment. Our framework extends the aforementioned query classes by supporting recursive predicates with more than two arguments and nonlinear recursion.
Piero A. Bonatti
Added 08 Dec 2009
Updated 08 Dec 2009
Type Conference
Year 2004
Where PODS
Authors Piero A. Bonatti
Comments (0)
books