THE RULES ENGINE DESIGN AND IMPLEMENTATION BASED ON THE IMPROVED RETE ALGORITHM

摘要

Current rules engine is mainly designed based on the Rete algorithm. Rete algorithm is the most efficient forward inference algorithm, but it has some shortcomings ：the cost of deleting WME is the same with adding it;and β network has too many redundant nodes to save the partial match results which waste a lot of space; what’s more null join often occur. Therefore, this paper will improve the shortcomings of the Rete algorithm,put forward a timestamp-βmemory upper bound method to restrict the β network space and implement the asymmetric deleting WME, and use the unjoin method to solve the null join problem. We design the rules engine based on the improved algorithm. Then give the empirical result to show its feasibility and superiority. At last,we give the future work we should do to improve ulteriorly.