Abstract
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.
Highlights
EXtensible Mark-up Language (XML) is emerging as the de facto standard for data exchange over the Web
We evaluated the performance of TwigINLAB as compared to TwigStack on two main types of queries namely, path query and twig query
We have presented the TwigINLAB algorithm to optimize all the sub-processes involved in the decomposition-matching-merging approaches
Summary
EXtensible Mark-up Language (XML) is emerging as the de facto standard for data exchange over the Web. MPMGJN [4], Stack-Tree [5] and TwigStack [6] algorithms are based on (docno, begin : end, level) labeling of XML elements These algorithms accept two lists of sorted individual matching nodes and structurally join pairs of nodes from both lists to produce the matching of the binary relationships. Another similar approach is to decompose the twig query into a set of path queries instead. Zezula et al propose a novel technique, tree signature, to represent tree structures as ordered sequences of pre-order and post-order ranks of the nodes [3] They use tree signatures as index structure and find qualifying patterns through integration of structurally consistent path query.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
