Twig pattern matching: A revisit

Publication Type:
Conference Proceeding
Citation:
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2011, 6861 LNCS (PART 2), pp. 43 - 50
Issue Date:
2011-09-20
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2011001180OK.pdf2.33 MB
Adobe PDF
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. © 2011 Springer-Verlag Berlin Heidelberg.
Please use this identifier to cite or link to this item: