Twig pattern matching: a revisit

Authors:
Jiang Li;Junhu Wang;Maolin Huang
Affiliations:
School of Information and Communication Technology, Griffith University, Gold Coast, Australia;School of Information and Communication Technology, Griffith University, Gold Coast, Australia;Faculty of Engineering and Information Technology, The University of Technology, Sydney, Australia
Venue:
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part II
Year:
2011

Citing 5
Cited 0

Holistic twig joins: optimal XML pattern matching

Proceedings of the 2002 ACM SIGMOD international conference on Management of data
The XML benchmark project

The XML benchmark project
Fast Matching of Twig Patterns

DEXA '08 Proceedings of the 19th international conference on Database and Expert Systems Applications
Efficient holistic twig joins in leaf-to-root combining with root-to-leaf way

DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Efficient processing of XML twig pattern: a novel one-phase holistic solution

DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Twig pattern matching plays a crucial role in xml query processing. In order to reduce the processing time, some existing holistic onephase twig pattern matching algorithms (e.g., HolisticTwigStack [3], TwigFast [5], etc) use the core function getNext of TwigStack [2] to effectively and efficiently filter out the useless elements. However, using getNext as a filter may incur other redundant computation. We propose two approaches, namely re-test checking and forward-to-end, which can avoid the redundant computation and can be easily applied to both holistic one-phase and two-phase algorithms. The experiments show that our approach can significantly improve the efficiency by avoiding the redundant computation.