Optimizing Conjunctive Queries over Trees Using Schema Information

  • Authors:

  • Henrik Björklund;Wim Martens;Thomas Schwentick

  • Affiliations:

  • Technical University of Dortmund,;Technical University of Dortmund,;Technical University of Dortmund,

  • Venue:
  • MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

We study the containment, satisfiability, and validity problems for conjunctive queries over trees with respect to a schema. We show that conjunctive query containment and validity are 2EXPTIME-complete w.r.t. a schema (DTD or Relax NG). Furthermore, we show that satisfiability for conjunctive queries w.r.t. a schema can be decided in NP. The problem is NP-hard already for queries using only one kind of axis. Finally, we consider conjunctive queries that can test for equalities and inequalities of data values. Here, satisfiability and validity are decidable, but containment is undecidable, even without schema information. On the other hand, containment w.r.t. a schema becomes decidable again if the "larger" query is not allowed to use both equalities and inequalities.