| Abstrakt: |
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. |
