Materialized View Selection in XML Databases

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.

[1]  Inderpal Singh Mumick,et al.  Selection of Views to Materialize in a Data Warehouse , 2005, IEEE Trans. Knowl. Data Eng..

[2]  Rada Chirkova,et al.  A formal perspective on the view selection problem , 2002, The VLDB Journal.

[3]  Z. Meral Özsoyoglu,et al.  Rewriting XPath Queries Using Materialized Views , 2005, VLDB.

[4]  Inderpal Singh Mumick,et al.  Selection of Views to Materialize Under a Maintenance Cost Constraint , 1999, ICDT.

[5]  Laks V. S. Lakshmanan,et al.  Answering tree pattern queries using views , 2006, VLDB.

[6]  Howard J. Karloff,et al.  On the complexity of the view-selection problem , 1999, PODS '99.

[7]  Wenfei Fan,et al.  Rewriting Regular XPath Queries on XML Views , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

[8]  Jeffrey D. Ullman,et al.  Set Merging Algorithms , 1973, SIAM J. Comput..

[9]  Dan Suciu,et al.  Query Caching and View Selection for XML Databases , 2005, VLDB.

[10]  Neoklis Polyzotis,et al.  Selectivity estimation for XML twigs , 2004, Proceedings. 20th International Conference on Data Engineering.

[11]  Jun'ichi Tatemura,et al.  Maintaining XPath views in loosely coupled systems , 2006, VLDB.

[12]  Inderpal Singh Mumick,et al.  Maintenance of data cubes and summary tables in a warehouse , 1997, SIGMOD '97.

[13]  Dan Suciu,et al.  What Can Database Do for Peer-to-Peer? , 2001, WebDB.

[14]  Jian Yang,et al.  Algorithms for Materialized View Design in Data Warehousing Environment , 1997, VLDB.

[15]  Laks V. S. Lakshmanan,et al.  FleXPath: flexible structure and full-text querying for XML , 2004, SIGMOD '04.

[16]  Laks V. S. Lakshmanan,et al.  On Testing Satisfiability of Tree Pattern Queries , 2004, VLDB.

[17]  Laks V. S. Lakshmanan,et al.  Minimization of tree pattern queries , 2001, SIGMOD '01.

[18]  Kam-Fai Wong,et al.  Multiple Materialized View Selection for XPath Query Rewriting , 2008, 2008 IEEE 24th International Conference on Data Engineering.

[19]  Dan Suciu,et al.  Containment and equivalence for an XPath fragment , 2002, PODS.

[20]  Hamid Pirahesh,et al.  A Framework for Using Materialized XPath Views in XML Query Processing , 2004, VLDB.

[21]  Jun'ichi Tatemura,et al.  Incremental maintenance of path-expression views , 2005, SIGMOD '05.

[22]  Hongjun Lu,et al.  Bloom Histogram: Path Selectivity Estimation for XML Data with Updates , 2004, VLDB.

[23]  Elena Baralis,et al.  Materialized Views Selection in a Multidimensional Database , 1997, VLDB.

[24]  Donald Kossmann,et al.  The state of the art in distributed query processing , 2000, CSUR.

[25]  Sihem Amer-Yahia,et al.  Structure and Content Scoring for XML , 2005, VLDB.

[26]  Jeffrey D. Ullman,et al.  Implementing data cubes efficiently , 1996, SIGMOD '96.