基于Extended Dewey编码的小枝模式匹配方法  

Twig pattern matching approach based on Extended Dewey encoding

作　　者：傅立功[1] 陶世群[2] 

机构地区：[1]山西大学计算机中心,山西太原030006 [2]山西大学计算机与信息技术学院,山西太原030006

出　　处：《计算机工程与设计》2008年第4期803-806,共4页Computer Engineering and Design

摘　　要：XML数据库的查询优化技术是当前数据库领域中的一个研究热点,而小枝模式匹配又是其中的一个研究重点。在总结分析各种小枝模式匹配算法的基础上,提出了一种新的基于Extended Dewey编码的小枝模式匹配方法。该方法首先使用TJFast算法在XML文档的JoinGuide索引上进行预匹配,然后再扫描预匹配结果中的叶子结点序列就可以找出所有的匹配结果。最后,用实验的方法同其它算法作了比较,并对实验结果进行了分析。Nowadays the query optimization technique of XML databases has become a hot research topic in database field, and twig pattern matching is an important problem in XML field. On the basis of summarizing and analyzing some twig pattern matching algorithms, a novel approach of twig pattern matching based on Extended Dewey encoding is proposed. Firstly the approach gets the prematching results on the XML JoinGuide index with the algorithm of TJFast, and then all the final matching results would be got while the leaf node streams in the pre-matching results are scanned. Finally the approach is compared with other algorithms through experiments and the analysis of the experiment results is given.

关 键 词：可扩展标记语言 EXTENDED DEWEY编码 JoinGuide索引 XPATH 小枝模式匹配 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]