A performance comparison of the Rete and TREAT algorithms for testing database rule conditions

Author

Wang, Yu-Wang ; Hanson, Eric N.

Author_Institution

Utek Corp., Lisle, IL, USA

fYear

1992

fDate

2-3 Feb 1992

Firstpage

88

Lastpage

97

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

Keywords

database theory; deductive databases; digital simulation; knowledge based systems; performance evaluation; Rete algorithm; TREAT algorithm; data patterns; database rule conditions; database rule system; join conditions; performance simulation comparison; production rule condition testing algorithms; rule definition; update patterns; Application software; Computer science; Context modeling; Design optimization; Military computing; Process design; Production systems; Relational databases; Statistical analysis; System testing;

fLanguage

English

Publisher

ieee

Conference_Titel

Data Engineering, 1992. Proceedings. Eighth International Conference on

Conference_Location

Tempe, AZ

Print_ISBN

0-8186-2545-7

Type

conf

DOI

10.1109/ICDE.1992.213202

Filename

213202