Efficiently finding all occurrences of a twig pattern is a core operation of XML query processing. In this paper, we first propose a generic twig join algorithm TJFGeneric which only scans the leaf query nodes using a cursor interface to return elements. And then we present TJFGeneric +  algorithm incorporating two optimization rules into TJFGeneric to explore potential benefit of disk read and CPU cost. In particular, available indices (such as B + -tree) are applied to skip the elements that do not participate in final results. Experimental results on various datasets indicate that our algorithms outperform previous approaches significantly.
['Jinhua Jiang', 'Gang Chen', 'Lidan Shou', 'Ke Chen']
Efficient Holistic Twig Join Algorithm on XML Documents with Optimization Rules and Index