Twig Pattern Matching: A Revisit

File Size Format
75057_1.pdf 240Kb Adobe PDF View
Title Twig Pattern Matching: A Revisit
Author Li, Jiang; Wang, Junhu; Huang, Maolin
Journal Name Lecture Notes in Computer Science
Year Published 2011
Place of publication Germany
Publisher Springer
Abstract 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.
Peer Reviewed Yes
Published Yes
Alternative URI http://dx.doi.org/10.1007/978-3-642-23091-2_4
Copyright Statement Copyright 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
Volume 6861
Page from 43
Page to 50
ISSN 0302-9743
Date Accessioned 2012-01-12
Date Available 2012-09-14T02:13:16Z
Language en_US
Research Centre Institute for Integrated and Intelligent Systems
Faculty Faculty of Science, Environment, Engineering and Technology
Subject Database Management
URI http://hdl.handle.net/10072/42552
Publication Type Journal Articles (Refereed Article)
Publication Type Code c1

Show simple item record

Griffith University copyright notice