Decidable containment of recursive queries

  • Authors:

  • Diego Calvanese;Giuseppe De Giacomo;Moshe Y. Vardi

  • Affiliations:

  • Faculty of Computer Science, Free University of Bolzano/Bozen, Piazza Domenicani 3, 1-39100 Bolzano, Italy;Dipartimento di Informatica e Sistemistica, Università di Roma "La Sapienza", Via Salaria 113, 00198 Roma, Italy;Department of Computer Science, Rice University, P.O. Box 1892, Houston, TX

  • Venue:
  • Theoretical Computer Science - Database theory
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

One of the most important reasoning tasks on queries is checking containment, i.e., verifying whether one query yields necessarily a subset of the result of another one. Query containment is crucial in several contexts, such as query optimization, query reformulation, knowledge-base verification, information integration, integrity checking, and cooperative answering. Containment is undecidable in general for Datalog, the fundamental language for expressing recursive queries. On the other hand, it is known that containment between monadic Datalog queries and between Datalog queries and unions of conjunctive queries are decidable. It is also known that containment between unions of conjunctive two-way regular path queries, which are queries used in the context of semistructured data models containing a limited form of recursion in the form of transitive closure, is decidable. In this paper, we combine the automata-theoretic techniques at the base of these two decidability results to show that containment of Datalog in union of conjunctive two-way regular path queries is decidable in 2EXPTIME. By sharpening a known lower bound result for containment of Datalog in union of conjunctive queries we show also a matching lower bound.