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
Minimization of tree pattern queries
SIGMOD '01 Proceedings of the 2001 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
Data integration: a theoretical perspective
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Holistic twig joins: optimal XML pattern matching
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Containment for XPath Fragments under DTD Constraints
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Reformulation of XML Queries and Constraints
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Structural Properties of XPath Fragments
ICDT '03 Proceedings of the 9th International Conference on Database Theory
A Scalable Algorithm for Answering Queries Using Views
VLDB '00 Proceedings of the 26th 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
The VLDB Journal — The International Journal on Very Large Data Bases
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
ViST: a dynamic index method for querying XML data by tree structures
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Rewriting XPath queries using materialized views
VLDB '05 Proceedings of the 31st international conference on Very large data bases
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
Managing collections of XML schemas in microsoft SQL server 2005
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
A theoretic framework for answering XPath queries using views
XSym'05 Proceedings of the Third international conference on Database and XML Technologies
Structured materialized views for XML queries
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Query Rewriting for Access Control on Semantic Web
SDM '08 Proceedings of the 5th VLDB workshop on Secure Data Management
Filtering Techniques for Rewriting XPath Queries Using Views
WISE '08 Proceedings of the 9th international conference on Web Information Systems Engineering
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
Transforming Tree Patterns with DTDs for Query Containment Test
DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
Updates and views dependencies in semi-structured databases
IDEAS '08 Proceedings of the 2008 international symposium on Database engineering & applications
A heuristic approach for checking containment of generalized tree-pattern queries
Proceedings of the 17th ACM conference on Information and knowledge management
On rewriting XPath queries using views
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Materialized View Selection in XML Databases
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
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
Containment of partially specified tree-pattern queries in the presence of dimension graphs
The VLDB Journal — The International Journal on Very Large Data Bases
Precomputing queries for personal health sensor environments
Proceedings of the International Conference on Management of Emergent Digital EcoSystems
Answering XML queries using materialized views revisited
Proceedings of the 18th ACM conference on Information and knowledge management
Minimal common container of tree patterns
Proceedings of the 18th ACM conference on Information and knowledge management
Query rewritings using views for XPath queries, framework, and methodologies
Information Systems
BNCOD'07 Proceedings of the 24th British national conference on Databases
On tree pattern query rewriting using views
WISE'07 Proceedings of the 8th international conference on Web information systems engineering
Efficient evaluation of query rewriting plan over materialized XML view
Journal of Systems and Software
Exploring XML web collections with DescribeX
ACM Transactions on the Web (TWEB)
Optimizing XML data with view fragments
ADC '10 Proceedings of the Twenty-First Australasian Conference on Database Technologies - Volume 104
On the expressiveness of generalization rules for XPath query relaxation
Proceedings of the Fourteenth International Database Engineering & Applications Symposium
Certain answers and rewritings for local regular path queries on graph-structured data
Proceedings of the Fourteenth International Database Engineering & Applications Symposium
A schemaguide for accelerating the view adaptation process
ER'10 Proceedings of the 29th international conference on Conceptual modeling
XML reconstruction view selection in XML databases: complexity analysis and approximation scheme
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
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
Chasing tree patterns under recursive DTDs
DASFAA'10 Proceedings of the 15th international conference on Database Systems for Advanced Applications - Volume Part I
Rewriting XPath queries using materialized XPath views
Journal of Computer and System Sciences
XML query processing using views
WAIM'11 Proceedings of the 2011 international conference on Web-Age Information Management
Revisiting answering tree pattern queries using views
ACM Transactions on Database Systems (TODS)
MQTree based query rewriting over multiple XML views
DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
Access Control on Semantic Web Data Using Query Rewriting
International Journal of Organizational and Collective Intelligence
Optimizing XML queries: Bitmapped materialized views vs. indexes
Information Systems
Hi-index | 0.00 |
We study the query answering using views (QAV) problem for tree pattern queries. Given a query and a view, the QAV problem is traditionally formulated in two ways: (i) find an equivalent rewriting of the query using only the view, or (ii) find a maximal contained rewriting using only the view. The former is appropriate for classical query optimization and was recently studied by Xu and Ozsoyoglu for tree pattern queries (TP). However, for information integration, we cannot rely on equivalent rewriting and must instead use maximal contained rewriting as shown by Halevy. Motivated by this, we study maximal contained rewriting for TP, a core subset of XPath, both in the absence and presence of a schema. In the absence of a schema, we show there are queries whose maximal contained rewriting (MCR) can only be expressed as the union of exponentially many TPs. We characterize the existence of a maximal contained rewriting and give a polynomial time algorithm for testing the existence of an MCR. We also give an algorithm for generating the MCR when one exists. We then consider QAV in the presence of a schema. We characterize the existence of a maximal contained rewriting when the schema contains no recursion or union types, and show that it consists of at most one TP. We give an efficient polynomial time algorithm for generating the maximal contained rewriting whenever it exists. Finally, we discuss QAV in the presence of recursive schemas.