Implementing data cubes efficiently
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Covering indexes for branching path queries
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Holistic twig joins: optimal XML pattern matching
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Selection of Views to Materialize Under a Maintenance Cost Constraint
ICDT '99 Proceedings of the 7th International Conference on Database Theory
DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Incremental Maintenance for Materialized Views over Semistructured Data
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Efficiently Publishing Relational Data as XML Documents
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Automated Selection of Materialized Views and Indexes in SQL Databases
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Tree pattern query minimization
The VLDB Journal — The International Journal on Very Large Data Bases
Artificial Intelligence: A Modern Approach
Artificial Intelligence: A Modern Approach
D(k)-index: an adaptive structural summary for graph-structured data
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Containment and equivalence for a fragment of XPath
Journal of the ACM (JACM)
SIGMOD '04 Proceedings of the 2004 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
FiST: scalable XML document filtering by sequencing twig patterns
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
An Efficient XPath Query Processor for XML Streams
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Rewriting nested XML queries using nested views
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Efficient mining of XML query patterns for caching
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
MARS: a system for publishing XML from mixed and redundant storage
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
Structured materialized views for XML queries
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Materialized View Selection in XML Databases
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 algorithms for descendant-only tree pattern queries
Information Systems
Recommending XMLTable Views for XQuery Workloads
XSym '09 Proceedings of the 6th International XML Database Symposium on Database and XML Technologies
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
Efficient XQuery rewriting using multiple views
ICDE '11 Proceedings of the 2011 IEEE 27th International Conference on Data Engineering
ViP2P: efficient XML management in DHT networks
ICWE'12 Proceedings of the 12th international conference on Web Engineering
Growing triples on trees: an XML-RDF hybrid model for annotated documents
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.00 |
The efficient processing of XQuery still poses significant challenges. A particularly effective technique to improve XQuery processing performance consists of using materialized views to answer queries. In this work, we consider the problem of choosing the best views to materialize within a given space budget in order to improve the performance of a query workload. The paper is the first to address the view selection problem for queries and views with value joins and multiple return nodes. The challenges we face stem from the expressive power and features of both the query and view languages and from the size of the search space of candidate views to materialize. While the general problem has prohibitive complexity, we propose and study a heuristic algorithm and demonstrate its superior performance compared to the state of the art.