Type inference for queries on semistructured data
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Query rewriting for semistructured data
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Minimization of tree pattern queries
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Answering queries using views: A survey
The VLDB Journal — The International Journal on Very Large Data Bases
Query containment and rewriting using views for regular path queries under constraints
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Answering Regular Path Queries Using Views
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
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
Algorithms for acyclic database schemes
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
Efficient mining of XML query patterns for caching
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
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
On the minimization of XPath queries
Journal of the ACM (JACM)
XPath Rewriting Using Multiple Views
DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
Database Systems: The Complete Book
Database Systems: The Complete Book
On rewriting XPath queries using views
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Containment between Unions of XPath Queries
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
Multiple Materialized View Selection for XPath Query Rewriting
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Efficient rewriting of XPath queries using Query Set Specifications
Proceedings of the VLDB Endowment
Bag equivalence of XPath queries
Proceedings of the 13th International Conference on Database Theory
XPath Query Relaxation through Rewriting Rules
IEEE Transactions on Knowledge and Data Engineering
Revisiting answering tree pattern queries using views
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.00 |
In this paper, we study the problem of finding an equivalent rewriting of an XPath query using multiple views, and we show that the union operator may be required in order to find such a rewriting. In particular, focusing on the fragment of XPath containing both descendant edges and wildcard labels, we propose an algorithm that outputs a union of single-view rewritings (if there exists any) which equivalently rewrites a given query. For the same fragment of XPath, we give necessary and sufficient conditions for query containment and equivalence of unions of queries.