Query Reasoning on Trees with Types, Interleaving, and Counting - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2011

Query Reasoning on Trees with Types, Interleaving, and Counting


A major challenge of query language design is the combination of expressivity with effective static analyses such as query containment. In the setting of XML, documents are seen as finite trees, whose structure may additionally be constrained by type constraints such as those described by an XML schema. We consider the problem of query containment in the presence of type constraints for a class of regular path queries extended with counting and interleaving operators. The counting operator restricts the number of occurrences of children nodes satisfying a given logical property. The interleaving operator provides a succinct notation for describing the absence of order between nodes satisfying a logical property. We provide a logic-based framework supporting these operators, which can be used to solve common query reasoning problems such as satisfiability and containment of queries in exponential time.
Fichier principal
Vignette du fichier
IJCAI2011.pdf (115.51 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00609556 , version 1 (19-07-2011)


  • HAL Id : inria-00609556 , version 1


Everardo Barcenas-Patino, Pierre Genevès, Nabil Layaïda, Alan Schmitt. Query Reasoning on Trees with Types, Interleaving, and Counting. 22nd International Joint Conference on Artificial Intelligence IJCAI'2011, Jul 2011, Barcelone, Spain. ⟨inria-00609556⟩
541 View
120 Download


Gmail Facebook Twitter LinkedIn More