支持演化规则引擎的Rete算法研究

在演化规则模式匹配过程中, 存在内存空间有限与用户请求响应要求快速等问题, 传统的Rete算法并不能完全适合此类实际应用。针对此类问题, 在经典Rete算法的基础上, 通过从算法空间复杂度的角度对Rete网络结构匹配效率进行分析, 并结合系统动态演化过程中强动态和高实时性的特点, 引入节点复用技术构造Rete网络, 且以规则权重、入网时间为依据, 增设了Rete网络节点存储空间可调整机制, 完成了Rete算法在内存消耗与调节、匹配耗时方面的优化。对比测试表明, 优化后的算法提高了网络匹配性能, 实现了系统的平稳安全运行, 解决了演化系统模式匹配过程中存在的问题。

Research on Rete algorithm supporting evolution rules engine

In the rule pattern matching process of dynamic evolution of software system, traditional Rete algorithm can't be entirely suitable for solving such problem as the requirement of limited memory and quick response from users. This paper focused on the optimization of the Rete algorithm on aspects of memory consumption and time-consuming in matching process. On the basis of the classic Rete algorithm and from the perspective of the complexity of algorithm space, it analyzed Rete network structure matching efficiency, combined with characteristics of system dynamic evolution of the strong dynamic and high efficiency, and introduced node multiplexing technique for constructing Rete network. And based on rule weights and entering network time, through additional node storage space adjustable mechanism, it completed the algorithm optimization. Comparison test shows that the optimized Rete algorithm can improve the network matching performance, make the operation of system more stable and safe, which solves the existing problems in pattern matching process of the evolution of system.