Answering queries using views (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Rewriting aggregate queries using views
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
Information integration using logical views
Theoretical Computer Science - Special issue on the 6th International Conference on Database Theory—ICDT '97
Reformulation of XML Queries and Constraints
ICDT '03 Proceedings of the 9th International Conference on Database Theory
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
Rewriting queries using views in the presence of arithmetic comparisons
Theoretical Computer Science
Using views to generate efficient evaluation plans for queries
Journal of Computer and System Sciences
Efficient mining of XML query patterns for caching
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
On the minimization of Xpath queries
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
Revisiting redundancy and minimization in an XPath fragment
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Certain answers and rewritings for local regular path queries on graph-structured data
Proceedings of the Fourteenth International Database Engineering & Applications Symposium
Determinacy and query rewriting for conjunctive queries and views
Theoretical Computer Science
Answering tree pattern queries using views: a revisit
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
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
View-based query answering in Description Logics: Semantics and complexity
Journal of Computer and System Sciences
Revisiting answering tree pattern queries using views
ACM Transactions on Database Systems (TODS)
Answering queries using views over probabilistic XML: complexity and tractability
Proceedings of the VLDB Endowment
Hi-index | 0.00 |
The problem of rewriting a query using a materialized view is studied for a well known fragment of XPath that includes the following three constructs: wildcards, descendant edges and branches. In earlier work, determining the existence of a rewriting was shown to be coNP-hard, but no tight complexity bound was given. While it was argued that Σ3p is an upper bound, the proof was based on results that have recently been refuted. Consequently, the exact complexity (and even decidability) of this basic problem has been unknown, and there have been no practical rewriting algorithms if the query and the view use all the three constructs mentioned above. It is shown that under fairly general conditions, there are only two candidates for rewriting and hence, the problem can be practically solved by two containment tests. In particular, under these conditions, determining the existence of a rewriting is coNP-complete. The proofs utilize various novel techniques for reasoning about XPath patterns. For the general case, the exact complexity remains unknown, but it is shown that the problem is decidable.