We propose a new algorithm, BPI-TWIG, to evaluate XML twig queries. The algorithm uses a set of novel twig indices to reduce the number of comparisons needed
for the twig evaluation and transform the join operation to an intersection operation between the contributing twig paths
inside the query. In this paper, we present our technique and experimentally evaluate its performance.
Keywords XML Query processing - Twig Queries