TwigEN:一种新的小枝模式匹配算法

TwigEN:A New Twig Pattern Matching Algorithm

随着互联网的迅速发展,XML已经成为网上通用的数据表示与交换的标准。因此,如何有效地查询XML数据成为一个重要的研究课题。近年来,小枝模式匹配问题已被广泛地研究,提出了不少小枝模式匹配算法。在汲取各种小枝模式匹配算法优点的基础上,提出了一种新的小枝模式匹配算法TwigEN。根据XML文档结构它可以跳过那些在结构连接中无用的元素结点,这样不仅减少了待处理结点的数目,缩短了处理时间,而且也节省了内存空间。

With the rapid development of the Internet, XML is an emerging standard for data representation and exchange on the Internet. Therefore, how to query XML data effectively has becomes an important research topic. In recent years, twig pattern matching problem has been widely studied, and a lot of twig pattern matching algorithms have been proposed, On the basis of summarizing and analyzing some twig pattern matching algorithms, a novel approach of twig pattern matching is proposed： TwigEN. The algorithm could skip elements that do not participate in a final twig matching , this will not only reduce the number of nodes to be processed, shortening the processing time but also saving the memory space.