Reasoning About Pattern-Based XML Queries - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

Reasoning About Pattern-Based XML Queries


We survey results about static analysis of pattern-based queries over XML documents. These queries are analogs of conjunctive queries, their unions and Boolean combinations, in which tree patterns play the role of atomic formulae. As in the relational case, they can be viewed as both queries and incomplete documents, and thus static analysis problems can also be viewed as finding certain answers of queries over such documents. We look at satisfiability of patterns under schemas, containment of queries for various features of XML used in queries, finding certain answers, and applications of pattern-based queries in reasoning about schema mappings for data exchange.
Fichier principal
Vignette du fichier
rr.pdf (129.56 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00908414 , version 1 (22-11-2013)


  • HAL Id : hal-00908414 , version 1


Amélie Gheerbrant, Leonid Libkin, Cristina Sirangelo. Reasoning About Pattern-Based XML Queries. RR - 7th International Conference on Web Reasoning and Rule Systems, 2013, Jul 2013, Mannheim, Germany. ⟨hal-00908414⟩
145 View
91 Download


Gmail Facebook X LinkedIn More