Answering queries using views (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-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
On wrapping query languages and efficient XML integration
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Containment and equivalence for an XPath fragment
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
An algorithm for answering queries efficiently using views
ADC '01 Proceedings of the 12th Australasian database conference
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Reformulation of XML Queries and Constraints
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Querying XML Views of Relational Data
Proceedings of the 27th International Conference on Very Large Data Bases
XPath Containment in the Presence of Disjunction, DTDs, and Variables
ICDT '03 Proceedings of the 9th International Conference on Database Theory
MiniCon: A scalable algorithm for answering queries using views
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
Constraint-based XML query rewriting for data integration
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
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
Answering tree pattern queries using views
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
XPath Rewriting Using Multiple Views
DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
Answering XML queries using materialized views revisited
Proceedings of the 18th ACM conference on Information and knowledge management
Query rewritings using views for XPath queries, framework, and methodologies
Information Systems
Rewriting XPath queries using materialized XPath views
Journal of Computer and System Sciences
Optimizing XML queries: Bitmapped materialized views vs. indexes
Information Systems
| Hi-index | 0.00 |
Query rewriting has many applications, such as data caching, query optimization, schema integration, etc. This issue has been studied extensively for relational databases and, as a result, the technology is maturing. For XML data, however, it is still at the developing stage. Several works have studied this issue for XML documents recently. They are mostly application-specific, being that they address the issues of query rewriting in a specific domain, and develop methods to meet the specific requirements. In this paper, we study this issue in a general setting, and concentrate on the correctness requirement. Our approach is based on the concept of query containment for XPath queries, and address the question of how that concept can be adopted to develop solutions to query rewriting problem. We study various conditions under which the efficiencies and applicability can trade each other at different levels, and introduce algorithms accordingly.