An Improving Method Of Rete Algorithm

Recently,with the rapid development of object-oriented technology,artificial intelligence,the optimization of business rule management system becomes research focus.Rule engine system is the core of business rule management system,but the bottleneck of the rule engine system is the rule matching process.Today the Rete matching algorithm is the most widely algorithm in the rule engines.The idea of the Rete algorithm is to create a Rete network through storing the part results in the matching process, the idea improves the efficiency of the rule matching greatly.Firstly, the principle of the business management system and the Rete algorithm has been conducted by the paper,then the shortcoming of original algorithm is verified by mathematical analysis.Due to the existence of the large amount invalid operation in the Rete network and the unreasonable rule condition's order in the matching,leading to a large waste of time and space resources.The algorithm was optimized as follows by two respect,one is creating the rete network,we can rearrange the rules' internel conditions,which can remove unnecessary matching thus reducing the memory usage.The other one is by adding the essential information in the status nodes' increasing process can accelerate the remove process,meanwhile the system perfomance can be optimized.Finally,the optimized algorithm and original algorithm are compared by this paper,and varified its correctness and validity.