Rule Engine based on improvement Rete algorithm
Rete algorithm is the mainstream of the algorithm in the rules engine; it provides efficient local entities data and rules pattern matching method. But Rete algorithm applied in rules engine has defects in performance and demand aspect, this paper applies three methods to improve the Rete algorithm...
Saved in:
Published in | The 2010 International Conference on Apperceiving Computing and Intelligence Analysis Proceeding pp. 346 - 349 |
---|---|
Main Authors | , , |
Format | Conference Proceeding |
Language | English |
Published |
IEEE
01.12.2010
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | Rete algorithm is the mainstream of the algorithm in the rules engine; it provides efficient local entities data and rules pattern matching method. But Rete algorithm applied in rules engine has defects in performance and demand aspect, this paper applies three methods to improve the Rete algorithm in the rule engine: rule decomposition, Alpha-Node-Hashing and Beta-Node-Indexing. Rules engine is enterprise applications, business logic framework for extracting rules from software application, and make it more flexible. This paper describes the principle of Rule Engine at first, secondly show the Rete algorithm, and finally we do some improvement to Rete algorithm. It makes Rule Engine widely meet the application demand and be greatly improved the efficiency. |
---|---|
ISBN: | 9781424480258 1424480256 |
DOI: | 10.1109/ICACIA.2010.5709916 |