Advertisement
Published in:
2006 | OriginalPaper | Chapter
Faster Twig Pattern Matching Using Extended Dewey ID
Authors : Chung Keung Poon, Leo Yuen
Published in: Database and Expert Systems Applications
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries. Recently, Lu
et al.
[7] proposed the
TJFast
algorithm that uses the
extended Dewey
labelling scheme and reported better performance compared with other
state-of-the-art
holistic twig join algorithms, both in terms of number of elements scanned and stored during the computation. In this paper, we designed an enhancement to further exploit the power of the
extended Dewey ID
. This reduces the CPU cost and also favors indexed inputs. Our algorithm can be shown analytically as efficient as
TJFast
in terms of worst case I/O, and experimentally performs significantly better.