Paper Info
Title
A performance comparison of the Rete and TREAT algorithms for testing database rule conditions
Abstract
The authors present the results of a simulation comparing the performance of the two most widely used production rule condition testing algorithms, Rete and TREAT, in the context of a database rule system. The results show that TREAT almost always outperforms Rete. TREAT requires less storage than Rete, and is less sensitive to optimization decisions than Rete. Based on these results, it is concluded that TREAT is the preferred algorithm for testing join conditions of database rules. Since Rete does outperform TREAT in some cases, this study suggests a next step which would be to develop a hybrid version of Rete and TREAT with an optimizer that would decide which strategy to use based on the rule definition and statistics about the data and update patterns
Year
DOI
Venue
1992
10.1109/ICDE.1992.213202
ICDE
Keywords
Field
DocType
database rule conditions,knowledge based systems,production rule condition testing algorithms,rete algorithm,performance simulation comparison,treat algorithm,database rule system,rule definition,treat algorithms,testing database rule conditions,update patterns,deductive databases,database theory,performance comparison,join conditions,digital simulation,performance evaluation,data patterns,context modeling,relational databases,system testing,process design,application software,design optimization,statistical analysis,computer science,production systems
Data mining,Computer science,Knowledge-based systems,Algorithm,Rete algorithm,Database theory,Database
Conference
ISBN
Citations 
PageRank 
0-8186-2545-7
40
21.19
References 
Authors
22
2
Name
Order
Citations
PageRank
Yu-Wang Wang111660.82
Eric N. Hanson2917376.11