OPS83: Style Guide for High Performance

摘要

The Rete algorithm is employed in most of the shells that use a rule-based knowledge representation paradigm, as well as in other shells that provide procedural encoding. the Rete match algorithm performs comparisons between the items in working (data) memory and the patterns of the rule's antecedents. The size and configuration of both the working memory and the patterns markedly impact match times. Interactive effects of six parameters on both make and remove times are measured: number of rules; number of conditions per rule; number of comparisons per condition; total number of working-memory elements; number of working-memory elements matched with conditions; constant-condition, within-condition, and between-condition comparisons.