Efficient Processing of Ordered XML Twig Pattern

Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries. Holistic twig join algorithm has showed its superiority over binary decompose based approach due to efficient reducing intermediate results. The existing holistic join algorithms, however, cannot deal with ordered twig queries. A straightforward approach that first matches the unordered twig queries and then prunes away the undesired answers is obviously not optimal in most cases. In this paper, we study a novel holistic-processing algorithm, called OrderedTJ, for ordered twig queries. We show that OrderedTJ can identify a large query class to guarantee the I/O optimality. Finally, our experiments show the effectiveness, scalability and efficiency of our proposed algorithm.

• Type: Conference
• Year: 2005
• Where: DEXA
• Authors: Jiaheng Lu, Tok Wang Ling, Tian Yu, Changqing Li, Wei Ni
• Keywords: DEXA 2005, Twig Join Algorithm, Twig Queries, Unordered Twig Queries