Efficient evaluation of XML twig queries

Authors:
Ya-Hui Chang;Cheng-Ta Lee;Chieh-Chang Luo
Affiliations:
Department of Computer Science, National Taiwan Ocean University;Department of Computer Science, National Taiwan Ocean University;Department of Computer Science, National Taiwan Ocean University
Venue:
APWeb'06 Proceedings of the 2006 international conference on Advanced Web and Network Technologies, and Applications
Year:
2006

Citing 8
Cited 0

Holistic twig joins: optimal XML pattern matching

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Query Optimization for XML

VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Indexing and Querying XML Data for Regular Path Expressions

Proceedings of the 27th International Conference on Very Large Data Bases
XBench - A Family of Benchmarks for XML DBMSs

Proceedings of the VLDB 2002 Workshop EEXTT and CAiSE 2002 Workshop DTWeb on Efficiency and Effectiveness of XML Tools and Techniques and Data Integration over the Web-Revised Papers
Structural Joins: A Primitive for Efficient XML Query Pattern Matching

ICDE '02 Proceedings of the 18th International Conference on Data Engineering
A Succinct Physical Storage Scheme for Efficient Evaluation of Path Queries in XML

ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Efficient structural joins on indexed XML documents

VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
From tree patterns to generalized tree patterns: on efficient evaluation of XQuery

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29

Quantified Score

Hi-index	0.00

Visualization

Abstract

With rapid acceptance of XML technologies, efficient query processing is a critical issue for XML repositories. In this paper, we consider the XML query which can be represented as a query tree with twig patterns. The proposed approach will first quickly retrieve data satisfying fragment paths which consist of only the parent-child relationship, and deal with the ancestor-descendent constraint in the later gluing stage. This approach focuses on where the data need to be “glued” and thus is very efficient. We conduct several experiments to evaluate the performance of the proposed approach. The results show that our system is more efficient than the holistic approach.