We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

The organization and performance of a TREAT-based production system compiler

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
$31 $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)
Miranker, D.P. ; Texas Univ., Austin, TX, USA ; Lofaso, B.J.

An ensemble of techniques that compile OPS5 production system programs to executable machine code is described and an increase in the execution speed of production system programs by two orders of magnitude over the commonly used list processing (LISP)-based OPS5 system is demonstrated. The computer is based on the TREAT incremental match algorithm. A version of the TREAT algorithm, formulated in relational algebra, is presented. The compiler employs optimization techniques derived from relational database system. The combination of the TREAT algorithm and the compiling techniques reduces the proportion of time spent in the match phase below the `greater than 90%' figure often cited by developers of other production system environments

Published in:

Knowledge and Data Engineering, IEEE Transactions on  (Volume:3 ,  Issue: 1 )