Minimization of tree pattern queries
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Answering queries using views: A survey
The VLDB Journal — The International Journal on Very Large Data Bases
Containment and equivalence for a fragment of XPath
Journal of the ACM (JACM)
Rewriting XPath queries using materialized views
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Query caching and view selection for XML databases
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Answering tree pattern queries using views
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
On testing satisfiability of tree pattern queries
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Structured materialized views for XML queries
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Containment between Unions of XPath Queries
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
On maximal contained rewriting of tree pattern queries using views
WISE'10 Proceedings of the 11th international conference on Web information systems engineering
Revisiting answering tree pattern queries using views
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.00 |
We revisit the problem of finding maximal contained rewritings of tree pattern queries using views, and extend previous work to the case where both the query and the view involve *, with the restriction that no *-node is incident on any //-edge, and there are no leaf *-nodes. When there is no dtd, we show how to modify the approach of useful embedding in a previous work to find the maximal contained rewriting. When there is a dtdthat is represented as an acyclic schema graph G, we show how to efficiently transform the view Vto an equivalent DAG-pattern V茂戮驴, and reduce the problem of finding the maximal contained rewriting of query Qusing Vunder Gto that of finding the maximal contained rewriting of Qusing V茂戮驴 without dtds.