Algebra-based identification of tree patterns in XQuery

5Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

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]. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Arion, A., Benzaken, V., Manolescu, L., Papakonstantinou, Y., & Vijay, R. (2006). Algebra-based identification of tree patterns in XQuery. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4027 LNAI, pp. 13–25). Springer Verlag. https://doi.org/10.1007/11766254_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free