Reasoning About Pattern-Based XML Queries [chapter]

Amélie Gheerbrant, Leonid Libkin, Cristina Sirangelo
2013 Lecture Notes in Computer Science  
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
more » ... ueries 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.
doi:10.1007/978-3-642-39666-3_2 fatcat:oqgntk34j5aibdx6ceuw7gsv3e