Evaluating structural summaries as access methods for XML

Authors:
Mirella M. Moro;Zografoula Vagena;Vassilis J. Tsotras
Affiliations:
UC Riverside;IBM Almaden Research Center;UC Riverside
Venue:
Proceedings of the 15th international conference on World Wide Web
Year:
2006

Citing 5
Cited 3

A Space-Economical Suffix Tree Construction Algorithm

Journal of the ACM (JACM)
Holistic twig joins: optimal XML pattern matching

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases

VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Virtual cursors for XML joins

Proceedings of the thirteenth ACM international conference on Information and knowledge management
Tree-pattern queries on a lightweight XML processor

VLDB '05 Proceedings of the 31st international conference on Very large data bases

XML Structural Summaries

Proceedings of the VLDB Endowment
XMin: Minimizing Tree Pattern Queries with Minimality Guarantee

World Wide Web
Optimizing XML queries: Bitmapped materialized views vs. indexes

Information Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Structural summaries are data structures that preserve all structural features of XML documents in a compact form. We investigate the applicability of the most popular summaries as textitaccess methods within XML query processing. In this context, issues like space and false positives introduced by the summaries need to be examined. Our evaluation reveals that the additional space required by the more precise structures is usually small and justified by the considerable performance gains that they achieve.