Abstract / Description of output
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 language | English |
|---|---|
| Title of host publication | Web Reasoning and Rule Systems |
| Subtitle of host publication | 7th International Conference, RR 2013, Mannheim, Germany, July 27-29, 2013. Proceedings |
| Publisher | Springer |
| Pages | 4-18 |
| Number of pages | 15 |
| Volume | 7994 |
| ISBN (Electronic) | 978-3-642-39666-3 |
| ISBN (Print) | 978-3-642-39665-6 |
| DOIs | |
| Publication status | Published - 2013 |