Twig Pattern Matching: A Revisit
View/ Open
Author(s)
Li, J
Wang, J
Huang, M
Griffith University Author(s)
Year published
2011
Metadata
Show full item recordAbstract
Twig pattern matching plays a crucial role in xml query processing. In order to reduce the processing time, some existing holistic one phase 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 ...
View more >Twig pattern matching plays a crucial role in xml query processing. In order to reduce the processing time, some existing holistic one phase 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.
View less >
View more >Twig pattern matching plays a crucial role in xml query processing. In order to reduce the processing time, some existing holistic one phase 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.
View less >
Journal Title
Lecture Notes in Computer science
Volume
6861
Copyright Statement
© 2011 Springer Berlin / Heidelberg. This is the author-manuscript version of this paper. Reproduced in accordance with the copyright policy of the publisher. The original publication is available at www.springerlink.com
Subject
Database systems