Algebra-Based identification of tree patterns in XQuery

  • Authors:

  • Andrei Arion;Véronique Benzaken;Ioana Manolescu;Yannis Papakonstantinou;Ravi Vijay

  • Affiliations:

  • Gemo group, INRIA Futurs, France;LRI, Univ. Paris 11, France;Gemo group, INRIA Futurs, France;CSE Dept., UCSD;Gemo group, INRIA Futurs, France

  • Venue:
  • FQAS'06 Proceedings of the 7th international conference on Flexible Query Answering Systems
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Query processing performance in XML databases can be greatly enhanced by the usage of materialized views whose content has been stored in the database. This requires a method for identifying query subexpressions matching the views, a process known as view-based query rewriting. This process is quite complex for relational databases, and all the more daunting on XML databases. Current XML materialized view proposals are based on tree patterns, since query navigation is conceptually close to such patterns. However, the existing algorithms for extracting tree patterns from XQuery do not detect patterns across nested query blocks. Thus, complex, useful tree pattern views may be missed by the rewriting algorithm. We present a novel tree pattern extraction algorithm from XQuery queries, able to identify larger patterns than previous methods. Our algorithm has been implemented in an XML database prototype [5].