TwigINLAB: A Decomposition-Matching-Merging Approach To Improving XML Query Processing
The emergence of the Web has increased significant interests in querying XML data. Current methods for XML query processing still suffers from producing large intermediate results and are not efficient in supporting query with mixed types of relationships. We propose the TwigINLAB algorithm to process and optimize the query evaluation. Our TwigINLAB adopts the decomposition-matching-merging approach and focuses on optimizing all three sub-processes; introducing a novel compact labeling scheme, optimizing the matching phase and reducing the number of inspection required in the merging phase. Experimental results indicate that TwigINLAB can process both path queries and twig queries better than the TwigStack algorithm on an average of 21.7% and 18.7% respectively in terms of execution time using the SwissProt dataset.
How to Cite
Haw, S. C. & Lee, C. S. (2008). TwigINLAB: A Decomposition-Matching-Merging Approach To Improving XML Query Processing . American Journal of Applied Sciences, 5(9), 1199-1205. https://doi.org/10.3844/ajassp.2008.1199.1205
© 2020 Su-Cheng Haw and Chien-Sing Lee. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
- query optimization
- structural query
- twig query