摘要
RETE算法是应用于产生式系统的 ,迄今为止被认为是性能最好的匹配算法 .但该算法本身也包含某些影响执行效率的因素 .本文在分析该算法优缺点的基础上 ,针对该算法删除操作与栈操作开销过大的情况 ,提出了一种新的匹配算法—— IMPR算法 ,并通过理论分析和实验检验表明 ,在各种情况下 ,IMPR均优于
RETE, which is applied to production systems, is so far considered as the match algorithm with the best performance. But this algorithm in itself contains some factors disadvantageous to the execution efficiency. Based on the analysis of the advantages and the disadvantages of the algorithm, and aimed at the situation of too large overhead of deletion operation and stack operation of it, a new match algorithm--IMPR is put forward in this article. And through the theoretical analysis and the experimental test, a fact is indicated that in all cases the IMPR algorithm outperforms the RETE algorithm.
出处
《小型微型计算机系统》
CSCD
北大核心
2002年第2期176-179,共4页
Journal of Chinese Computer Systems
基金
国家自然科学基金资助项目 (项目号 :69475 0 14 )