𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Lana–Match algorithm: a parallel version of the Rete–Match algorithm

✍ Scribed by Mostafa M Aref; Mohammed A Tayyib

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
220 KB
Volume
24
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

✦ Synopsis

The Rete-Match algorithm is a matching algorithm used to develop production systems. Although this algorithm is the fastest known algorithm, for many patterns and many objects matching, it still suffers from considerable amount of time needed due to the recursive nature of the problem. In this paper, a parallel version of the Rete-Match algorithm for distributed memory architecture is presented. Also, a theoretical analysis to its correctness and performance is discussed.

📜 SIMILAR VOLUMES

Derivation of a parallel string matching
Derivation of a parallel string matching algorithm
✍ Jayadev Misra 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 67 KB

We derive an efficient parallel algorithm to find all occurrences of a pattern string in a subject string in O(log n) time, where n is the length of the subject string. The number of processors employed is of the order of the product of the two string lengths.

Rete: A fast algorithm for the many patt
Rete: A fast algorithm for the many pattern/many object pattern match problem
✍ Charles L. Forgy 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 982 KB

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 f

A parallel algorithm for tree pattern ma
A parallel algorithm for tree pattern matching
✍ Koji Tarora; Tomio Hirata; Yasuyoshi Inagaki 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 814 KB

## Abstract Given a text tree __t__ and a pattern tree __p__, tree pattern matching involves finding subtrees of __t__ which match __p.__ This paper proposed a parallel algorithm for tree pattern matching. The algorithm is designed to run in __O__(log __n__) parallel time using __mn__/log__n__ proc

A Comparison of Approximate String Match
A Comparison of Approximate String Matching Algorithms
✍ PETTERI JOKINEN; JORMA TARHIO; ESKO UKKONEN 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 972 KB

Experimental comparisons of the running time of approximate string matching algorithms for the k differences problem are presented. Given a pattern string, a text string, and an integer k, the task is to find all approximate occurrences of the pattern in the text with at most k differences (insertio