Twig Pattern Matching: A Revisit
MetadataShow full item record
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 , TwigFast , etc) use the core function getNext of TwigStack  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.
Lecture Notes in Computer science
© 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