Reasoning About Pattern-Based XML Queries

Amélie Gheerbrant, Leonid Libkin, Cristina Sirangelo

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.
Original languageEnglish
Title of host publicationWeb Reasoning and Rule Systems
Subtitle of host publication 7th International Conference, RR 2013, Mannheim, Germany, July 27-29, 2013. Proceedings
PublisherSpringer-Verlag Berlin Heidelberg
Pages4-18
Number of pages15
Volume7994
ISBN (Electronic)978-3-642-39666-3
ISBN (Print)978-3-642-39665-6
DOIs
Publication statusPublished - 2013

Fingerprint

Dive into the research topics of 'Reasoning About Pattern-Based XML Queries'. Together they form a unique fingerprint.

Cite this