A SchemaGuide for Accelerating the View Adaptation Process

Materialization of XML views significantly improves query performance in the often slow execution times for XPath expressions. Existing efforts focus on providing approaches of how to reuse materialized view for answering XPath queries and, the problem of synchronizing materialized data in response to the changes taking place at data source level. In this paper, we study a closely related problem, the view adaptation problem, which maintains the materialized data incrementally after view definitions have been redefined/changed (view redefinition). Our research focuses on an efficient process for view adaptation upon the fragment-based view representation by segmenting materialized data into fragments and developing algorithms to update only those materialized fragments that have affected by the view definition changes. This serves to minimize the effect of view adaptation and provide a more efficient process for stored views. Additionally, we study the containment problem at fragment level under the constraints expressed in a so-name SchemaGuide. We have implemented our view adaptation system and we present in this paper the performance analysis.

[1]  Kenneth A. Ross,et al.  Adapting materialized views after redefinitions , 1995, SIGMOD '95.

[2]  Alin Deutsch,et al.  XPath Rewriting Using Multiple Views: Achieving Completeness and Efficiency , 2008, WebDB.

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

[4]  Alin Deutsch,et al.  Containment and Integrity Constraints for XPath , 2001, KRDB.

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

[6]  Peng Liu,et al.  Incremental adaptation of XPath access control views , 2007, ASIACCS '07.

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

[8]  Wenfei Fan,et al.  Keys with Upward Wildcards for XML , 2001, DEXA.

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

[10]  Zohra Bellahsene,et al.  Optimizing XML data with view fragments , 2010, ADC.

[11]  Dan Suciu,et al.  Containment and equivalence for a fragment of XPath , 2004, JACM.

[12]  Zohra Bellahsene View adaptation in the fragment-based approach , 2004, IEEE Transactions on Knowledge and Data Engineering.

[13]  Thomas Schwentick,et al.  On the complexity of XPath containment in the presence of disjunction, DTDs, and variables , 2006, Log. Methods Comput. Sci..

[14]  Mark Roantree,et al.  OTwig: An Optimised Twig Pattern Matching Approach for XML Databases , 2010, SOFSEM.

[15]  Torsten Grust,et al.  MonetDB/XQuery: a fast XQuery processor powered by a relational engine , 2006, SIGMOD Conference.

[16]  Jun Gao,et al.  MQTree Based Query Rewriting over Multiple XML Views , 2007, DEXA.

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

[18]  Bernhard Rumpe,et al.  SOFSEM 2010: Theory and Practice of Computer Science, 36th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic, January 23-29, 2010. Proceedings , 2010, SOFSEM.

[19]  Mark Roantree,et al.  Precomputing queries for personal health sensor environments , 2009, MEDES.

[20]  Hao Tang,et al.  Materialized View Selection in XML Databases , 2009, DASFAA.

[21]  Divesh Srivastava,et al.  Holistic twig joins: optimal XML pattern matching , 2002, SIGMOD '02.

[22]  Sang Hyuk Son,et al.  Access control of XML documents considering update operations , 2003, XMLSEC '03.

[23]  Ioana Manolescu,et al.  Structured Materialized Views for XML Queries , 2007, VLDB.

[24]  Theo Härder,et al.  S3: Evaluation of Tree-Pattern Queries Supported by Structural Summaries , 2009, Data Knowl. Eng..

[25]  Torsten. Grust,et al.  Accelerating XPath location steps , 2002, SIGMOD '02.

[26]  Mark Roantree,et al.  Metamodel-Based Optimisation of XPath Queries , 2009, BNCOD.