OTJFast: Processing Ordered XML Twig Join Fast

Thanks to standard specifications for web services, more and more data is represented and exchanged in XML. Efficiently finding all occurrences of a twig pattern is a core operation of XML query processing. Recently, a large number of holistic twig join algorithms have been proposed, however ordered XML twig join has been ignored in most of them. In this paper we design a novel algorithm called OTJFast to process ordered xml twig joins efficiently which only need to access the elements of the leaf query nodes. Experimental results show the benefits of our algorithm in term of the size of intermediate results, the number of element reads and the execution time.