Rete: A fast algorithm for the many pattern/many object pattern match problem

✍ Scribed by Charles L. Forgy

• Publisher: Elsevier Science
• Year: 1982
• Tongue: English
• Weight: 982 KB
• Volume: 19
• Category: Article
• ISSN: 0004-3702
• DOI: 10.1016/0004-3702(82)90020-0

✦ Synopsis

The Rete Match Algorithm is an efficient method for comparing a large collection of patterns to a large collection of objects. It finds all the objects that match each pattern. The algorithm was developed for use in production system interpreters, and it has been used for systems containing from a few hundred to more than a thousand patterns and objects. This article presents the algorithm in detail. It explains the basic concepts of the algorithm, it describes pattern and object representations that are appropriate for the algorithm, and it describes the operations performed by the pattern matcher.