Reasoning about pattern-based XML queries

  • Authors:
  • Amélie Gheerbrant;Leonid Libkin;Cristina Sirangelo

  • Affiliations:
  • School of Informatics, University of Edinburgh, UK;School of Informatics, University of Edinburgh, UK;LSV, ENS-Cachan INRIA & CNRS, France

  • Venue:
  • RR'13 Proceedings of the 7th international conference on Web Reasoning and Rule Systems
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

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.