Abstract
The Rete algorithm [Forg 82] is a very efficient method for comparing a large collection of patterns with a large collection of objects. It is widely used in rule-based expert systems. We studied ([AF 88] or [Alb 88]) the average case complexity of the Rete algorithm on collections of patterns and objects with a random tree structure. Objects and patterns are often made up of a head-symbol and a list of variable or constant arguments (OPSV [Forg
CR classification
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
IX. Bibliography
L. Albert, “Présentation et évaluation de la complexité de l'algorithme RETE de multi-pattern matching dans les systèmes de règles de production”, rapport de DEA, Université de PARIS XI, ENS, rapport de recherche 87-8 LCR Thomson-CSF, 1987.
L. Albert, “Présentation et évaluation de la complexité en moyenne d'algorithms de filtrage dans les moteurs d'inférences (Rete et arbre d'unification)”, Revue d' intelligence artificielle, volume 2, Hermes, 1988, pp. 7–40.
L. Albert, “Complexité en moyenne de l'algorithme de multi-pattern matching RETE sur des ensembles de patterns et d'objets de profondeur 1”, INRIA Research Report 1009, 1989.
L. Albert, F. Fages, “Average case complexity analysis of the RETE pattern match algorithm”, proceedings of the 15th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, 317, Springer-Verlag, Tampere, Finland, July 1988.
NG de Bruijn, Asymptotic Methods in Analysis, Dover 1958.
C.Choppy, S.Kaplan, M.Soria, “Algorithmic complexity of term rewriting systems”, Proceedings of the First Conference on Rewriting Techniques and Applications, Dijon, France, 1986.
D.W. Clark, “Measurements of Dynamic List Structures Use in Lisp”, IEEE Transactions on Software Engineering SE-5(1), pp. 51–59. (Jan. 1979).
J. Dieudonné, Calcul infinitésimal, Hermann, 1968.
P. Dufresne, “Contribution algorithmique à l'inférence par règles de production”, Thèse Université Paul Sabatier, Toulouse, 1984.
J. McDermott, A. Newell, J. Moore, “The efficiency of certain production system implementations”, in Pattern-Directed Inference Systems (Waterman et Hayes-Roth ed.) Academic Press, New York, 1978, pp. 155–176.
F. Fages, “On the proceduralization of rules in expert systems”, First France-Japan Symposium on Artificial Intelligence, Programming of Future Generation Computers, Addison-Wesley, Eds. M. Nivat and K. Fuchi, Tokyo, Nov., 1986.
F. Fages, “Rulebased extension of programming langages”, Proceedings of Les systèmes experts et leurs applications, Avignon, 1988.
P. Flajolet, “Mathematical methods in the analysis of algorithms and data structures”, INRIA, Research Report 400, 1985. To appear in A Graduate Course in Computer Science, Computer Science Press, 1987.
P. Flajolet, “The symbolic operator method”, Mathematical methods in the analysis of algorithms and data structure, L.N.C.S., Springer Verlag, to appear, 1987.
C. Forgy, “On the efficient implementation of production systems”, PhD Thesis, Carnegie Mellon University, 1979.
C. Forgy, “OPS-V user's manual”, Computer Science Department, Carnegie Mellon University, Pittsburgh, MA, 1981.
C. Forgy, “Rete, a fast algorithm for the many patterns many objects Match problem”, Artificial Intelligence 19, 1982, pp. 17–37.
P. Flajolet, R. Sedgewick, “Mathematical analysis of algorithms”, Computer Science 504, Lecture Notes for Princeton University, 1986.
P. Flajolet, P. Sipala et J.M. Steyaert, “The analysis of tree compaction in symbolic manipulations”, preprint.
P. Flajolet, J. Vitter, “Average Case Analysis of Algorithms and Data Structures”, in A Handbook of Theoretical Computer Science, North-Holland, 1987.
M. Ghallab, P. Dufresne, “Moteurs d'inférences pour systèmes de règles de production: techniques de compilation et d'interprétation”, Colloqu d'Intelligence Artificielle, Marseille, Oct. 1984, pp. 89–103.
A. Gupta et C.L. Forgy, “Measurements on production systems”, Carnegie Mellon University, Technical Report CMU-CS-83-167, 1983.
M. Ghallab, “New optimal decision tree for matching patterns in inference and planning system”, 2nd Int. Meeting on Artificial Intelligence, Leningrad, Oct. 1980.
D. Gardy, C. Puech, “On the size of projection: a generating function approach”, Information Systems, Vol. 9, No 3/4, pp. 231–235, 1984.
D. Gardy, C.Puech, “On the effect of join operations on relation sizes”, to appear in ACM Transactions On Database Systems.
A. Gupta, “Parallelism in production Systems: the sources and the expected Speed-up”, Carnegie Mellon University Technical Report CMU-CS-84-169, 1984.
P. Henrici, Applied and Computational complex Analysis, Volumes 1–3, Wiley, New-York.
Laboratoire central de Recherches, Xrete: manuel de référence, Thomson-CSF, domaine de Corbeville 91401 Orsay Cedex France, 1988.
D.P. Miranker, “TREAT: A Better Match Algorithm for AI Production Systems”, Proceedings of the 1987 National Conference on Artificial Intelligence, Seattle, Washington, 1987.
A. Meier, J.W. Moon, “On the altitude of nodes in random trees”, Canadian Journal of Math 30, 1978, pp. 997–1015.
A.S. Rosenthal, “Note on the expected size of a join”, SIGMOD Record 11(4), pp. 19–25, july 1981.
M. Regnier, E. Simon, “Efficient evaluation of production rules in a DBMS”, Proceedings of V ièmes Journées Bases de Données Avancées, Genève, 1989.
J.M. Steyaert, P. Flajolet, “Patterns and pattern match in trees: an analysis”, Information and Control 58, 1983, pp. 19–58.
Schang T. and Fages F. “A Real-Time Expert System for On-Board Radar Identification” 55th Symposium AVP-AGARD on Software Engineering and its Applications to Avionics, 1988.
J.M. Steyaert, “Complexité et structures des algorithmes”, Thèse d'Etat, Université de Paris 7, 1984.
G. Viennot, “La combinatoire bijective par l'exemple”, Université de Bordeaux 1, 1986.
M.L. Wright, M.W. Green, G.Fiegl, P.F. Cross, “An Expert System for Real-Time Control”, SRI International, in IEEE Software, March 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Albert, L. (1989). Average case complexity analysis of RETE pattern-match algorithm and average size of join in Databases. In: Veni Madhavan, C.E. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1989. Lecture Notes in Computer Science, vol 405. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52048-1_46
Download citation
DOI: https://doi.org/10.1007/3-540-52048-1_46
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52048-1
Online ISBN: 978-3-540-46872-1
eBook Packages: Springer Book Archive