QTwig: A Structural Join Algorithm for Efficient Query Retrieval Based on Region-Based Labeling

Dependability on XML has increased tremendously over the years. As such the need for efficient query processing technique is certainly important. Despite the fact that these techniques are able to process queries with various edge combinations, they still suffer from processing overheads by buffering large amount of intermediate results particularly for parent–child (P–C) edges. Therefore, in this paper, we propose architecture named ReLaQ, which comprises of two components, ReLab[Formula: see text] (node annotator) and QTwig (query processor) for efficient XML query processing. QTwig improves retrieval time by incorporating a pruning technique that avoids accessing irrelevant data during query processing. Experimental results indicated that ReLaQ superseded TwigStack for both path and twig queries using both regular- and skewed-structured datasets. In addition, this is also proven by means of correctness analysis of ReLaQ.

A XML Pattern Match Algorithm of Structural Index

XML query processing needs to search an XML document and return results that satisfy a request. In this paper, we proposed an effective pattern match algorithm based on structural index. This algorithm uses a suitable labeling scheme and an efficient structural index by identifying parent-child, ancestor-descendant and sibling relationships among nodes. Due to the algorithm avoids invalid immoderate results to be pushed stacks, So, It reduces the amount of joint and improves the performance of Query. Experiment results proved that our algorithm, TwigM performs about 15% better compared to TwigStack [ and 10% better than TwigINLAB[ for all types of queries.