A New Efficient Algorithm:cacheTwig For XML Twig Queries

摘要：

As the use of XML getting extensive, there is a popular research topic about how to find ours interested information in the XML database under a certain twig pattern. BrunoN proposed the concept of holistic twig in 2002 and brought up the algorithm of TwigStack. When processing the search which only contains ancestor-descendant relationships, this algorithm is the most superior. However, when the search contains parent-child relationships, there will come out with massive intermediate results. Trying to work out this problem, we will propose a improved twig pattern matching— cacheTwig, which is based on output detention theory. The experimental result indicates that our algorithm is not only the most superior for the queries that contains the ancestor-descendant relationships below branching nodes, and when comparing with the present algorithm, it is also highly effective when processing parent-child relationships below branching nodes.

关键词： twig query XML database XML pattern matching

作者: Xin-yi Peng Yan-xin Luo Zhi-wei Huang

作者单位: Dept. of Computer Science and EngineeringSouth China University of TechnologyGuangzhou, China Dept. of Computer Science and Engineering South China University of Technology Guangzhou, China

会议类型: 国际会议

会议名称: 2010 3rd International Conference on Advanced Computer Theory and Engineering(2010年第三届先进计算机理论与工程国际会议 ICACTE 2010)

会议地点: 成都

会议语种:英文

页码: 1-4

在线出版日期: 2010-08-20（万方平台首次上网日期，不代表论文的发表时间）