Holistic twig joins: optimal XML pattern matching
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
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
Rewriting nested XML queries using nested views
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Answering tree pattern queries using views
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Answering xpath queries over networks by sending minimal views
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
A framework for using materialized XPath views in XML query processing
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
Contained Rewritings of XPath Queries Using Views Revisited
WISE '08 Proceedings of the 9th international conference on Web Information Systems Engineering
XPath Rewriting Using Multiple Views
DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
Fast Matching of Twig Patterns
DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
On rewriting XPath queries using views
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Efficient maintenance techniques for views over active documents
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Finding Irredundant Contained Rewritings of Tree Pattern Queries Using Views
APWeb/WAIM '09 Proceedings of the Joint International Conferences on Advances in Data and Web Management
Multiple Materialized View Selection for XPath Query Rewriting
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Answering XML queries using materialized views revisited
Proceedings of the 18th ACM conference on Information and knowledge management
Efficient rewriting of XPath queries using Query Set Specifications
Proceedings of the VLDB Endowment
Query rewritings using views for XPath queries, framework, and methodologies
Information Systems
Proceedings of the VLDB Endowment
Answering tree pattern queries using views: a revisit
Proceedings of the 14th International Conference on Extending Database Technology
Algebraic incremental maintenance of XML views
Proceedings of the 14th International Conference on Extending Database Technology
On maximal contained rewriting of tree pattern queries using views
WISE'10 Proceedings of the 11th international conference on Web information systems engineering
Evaluating contained rewritings for XPath queries on materialized views
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
Efficient XQuery rewriting using multiple views
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
On equivalence and rewriting of XPath queries using views under DTD constraints
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part II
Union rewritings for XPath fragments
Proceedings of the 15th Symposium on International Database Engineering & Applications
| Hi-index | 0.00 |
We revisit the problem of answering tree pattern queries using views. We first show that, for queries and views that do not have nodes labeled with the wildcard *, there is an approach which does not require us to find any rewritings explicitly, yet which produces the same answers as the maximal contained rewriting. Then, using the new approach, we give simple conditions and a corresponding algorithm for identifying redundant view answers, which are view answers that can be ignored when evaluating the maximal contained rewriting. We also consider redundant view answers in the case where there are multiple views, the relationship between redundant views and redundant view answers, and discuss how to combine the removal of redundant view answers and redundant rewritings. We show that the aforesaid results can be extended to a number of other special cases. Finally, for arbitrary queries and views in P{/,//,.,[]}, we provide a method to find the maximal contained rewriting and show how to answer the query using views without explicitly finding the rewritings.