By Topic

JazzMatch: fine-grained parallel matching for large rule sets

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
M. Richeldi ; Dept. of Comput. Sci., Houston Univ., TX, USA ; J. Tan

JazzMatch, a parallel matching algorithm explicitly designed for secondary memory-based production systems, is presented. JazzMatch is a state-saving algorithm that performs incremental match. It exploits extremely fine-grained parallelism and optimizes the storage state by permitting the sharing of common conditions in the rules. JazzMatch is supported by a message passing parallel architecture. A cost and performance analysis of JazzMatch is provided, and the results are compared with those for other schemes in current literature

Published in:

Data Engineering, 1993. Proceedings. Ninth International Conference on

Date of Conference:

19-23 Apr 1993