Reasoning About Pattern-Based XML Queries

Abstract : 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.
Complete list of metadatas

Cited literature [29 references]  Display  Hide  Download

https://hal.inria.fr/hal-00908414
Contributor : Cristina Sirangelo <>
Submitted on : Friday, November 22, 2013 - 6:25:19 PM
Last modification on : Wednesday, December 4, 2019 - 1:28:01 PM
Long-term archiving on : Sunday, February 23, 2014 - 4:31:55 AM

File

rr.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00908414, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

451

Files downloads

166