Adapting the Rete-Algorithm to Evaluate F-Logic Rules
The evaluation of production rules is typically based on the Rete-algorithm. The topic of the current paper is to investigate, whether set-oriented bottom-up evaluation of rules in deductive databases can also take advantage of the Rete approach. We report on our implementation of the Rete algorithm as one possible evaluation technique inside the F-Logic rule evaluation engine Florid. We demonstrate, that in situations in which several rules share common subgoals a considerable improvement of the execution time can be gained by the Rete approach. We show this by means of benchmark programs, also comparing our results with the performance of Jess, a production rule system relying on Rete.
KeywordsProduction Rule Hash Table Deductive Database Path Expression Production Node
Unable to display preview. Download preview PDF.
- 1.Batory, D.: The LEAPS Algorithms.Technical Report 94-28, Department of Computer Sciences, University of Texas at Austin (1994)Google Scholar
- 2.Doorenbos, R.: Production Matching for Large Learning Systems. PhD thesis, Computer Science Department, CMU, Pittsburgh (1995)Google Scholar
- 4.Frohn, J., Lausen, G., Uphoff, H.: Access to objects by path expressions and rules. In: VLDB 1994. Proceedings of the 20th International Conference on Very Large Data Bases, pp. 273–284. Morgan Kaufmann, San Francisco, CA, USA (1994)Google Scholar
- 6.May, W.: Florid User Manual. Technical report, Institut für Informatik, Universität Freiburg (2000)Google Scholar
- 7.May, W.: How to write F-Logic Programs in Florid. Technical report, Institut für Informatik, Universität Freiburg (2000)Google Scholar
- 9.Sawas, N.: Adapting the Rete-Algorithm to F-logic and its Implementation in Florid. Institut für Informationssysteme, Technische Universität Braunschweig, master’s thesis (2007)Google Scholar
- 10.Wright, I., Marshall, J.: The execution kernel of RC++: RETE*, a faster RETE with TREAT as a special case. International Journal of Intelligent Games and Simulation 2(1), 36–48 (2003)Google Scholar