Implementing data cubes efficiently
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Maintenance of data cubes and summary tables in a warehouse
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
On the complexity of the view-selection problem
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The state of the art in distributed query processing
ACM Computing Surveys (CSUR)
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
Selection of Views to Materialize in a Data Warehouse
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Selection of Views to Materialize Under a Maintenance Cost Constraint
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Materialized Views Selection in a Multidimensional Database
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
A Formal Perspective on the View Selection Problem
Proceedings of the 27th International Conference on Very Large Data Bases
Algorithms for Materialized View Design in Data Warehousing Environment
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Selectivity Estimation for XML Twigs
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
FleXPath: flexible structure and full-text querying for XML
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Incremental maintenance of path-expression views
Proceedings of the 2005 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
Structure and content scoring for XML
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
Maintaining XPath views in loosely coupled systems
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
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
Bloom histogram: path selectivity estimation for XML data with updates
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Multiple Materialized View Selection for XPath Query Rewriting
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Optimizing XML data with view fragments
ADC '10 Proceedings of the Twenty-First Australasian Conference on Database Technologies - Volume 104
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
Materialized view selection for XQuery workloads
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Optimizing XML queries: Bitmapped materialized views vs. indexes
Information Systems
A Performance Analysis of Semantic Caching for XML Query Processing
International Journal of Knowledge-Based Organizations
Hi-index | 0.00 |
Materialized views, a rdbms silver bullet, demonstrate its efficacy in many applications, especially as a data warehousing/decison support system tool. The pivot of playing materialized views efficiently is view selection. Though studied for over thirty years in rdbms , the selection is hard to make in the context of xml databases, where both the semi-structured data and the expressiveness of xml query languages add challenges to the view selection problem. We start our discussion on producing minimal xml views (in terms of size) as candidates for a given workload (a query set). To facilitate intuitionistic view selection, we present a view graph (called vcube ) to structurally maintain all generated views. By basing our selection on vcube for materialization, we propose two view selection strategies, targeting at space-optimized and space-time tradeoff, respectively. We built our implementation on top of Berkeley DB XML, demonstrating that significant performance improvement could be obtained using our proposed approaches.