TwigList : Make Twig Pattern Matching Fast

Twig pattern matching problem has been widely studied in recent years. Give an XML tree T . A twig-pattern matching query, Q, represented as a query tree, is to find all the occurrences of such twig pattern in T . Previous works like HolisticTwig and TJFast decomposed the twig pattern into single paths from root to leaves, and merged all the occurrences of such path-patterns to find the occurrences of the twig-pattern matching query, Q. Their techniques can effectively prune impossible path-patterns to avoid producing a large amount of intermediate results. But they still need to merge path-patterns which occurs high computational cost. Recently, Twig2 Stack was proposed to overcome this problem using hierarchical-stacks to further reduce the merging cost. But, due to the complex hierarchical-stacks Twig2 Stack used, Twig2 Stack may end up many random accesses in memory, and need to load the whole XML tree into memory in the worst case. In this paper, we propose a new algorithm, call...

• Type: Conference
• Year: 2007
• Where: DASFAA
• Authors: Lu Qin, Jeffrey Xu Yu, Bolin Ding
• Keywords: DASFAA 2007, Database, Twig Pattern, Twig-pattern Matching Query, XML Tree