The growing number of XML documents leads to the need for appropriate XML querying algorithms which are able to utilize the specific characteristics of XML documents. A labelling scheme is fundamental to processing XML queries efficiently. They are used to determine structural relationships between elements corresponding to query nodes in twig pattern queries (TPQs). This article presents a design and implementation of a new indexing technique which exploits the property of prime numbers to identify Parent-Child (P-C) relationships in TPQs during query evaluation. The Child Prime Label (CPL, for short) approach can be efficiently incorporated within the existing labelling schemes. Here, we propose a novel twig matching algorithm based on the well known TwigStack algorithm [3], which applies the CPL approach and focuses on reducing the overhead of storing useless elements and performing unnecessary join operations. Our performance evaluation demonstrates that the new algorithm significantly outperforms the previous approaches.
CITATION STYLE
Alsubai, S., & North, S. (2018). TwigStackPrime: A novel twig join algorithm based on prime numbers. In Lecture Notes in Business Information Processing (Vol. 322, pp. 1–20). Springer Verlag. https://doi.org/10.1007/978-3-319-93527-0_1
Mendeley helps you to discover research relevant for your work.