Indexing RETE's Working Memory - Catering to Dynamic Changes of the Ruleset
Complex Event Processing systems are used to detect patterns in large streams of events. These patterns are described by rules. Due to changing requirements or updated security policies for example, these rules need to be frequently updated at runtime. Changing the ruleset at runtime, however, is a costly operation because the events that occurred in the past need to be re-evaluated. In this paper we present an extension to the pattern-matching algorithm called RETE. Our extension aims to improve the performance of the re-evaluation of events when the ruleset is modified. More specifically, we optimise the addition of rules that match events by means of the inequality operators >, ≥, < and ≤. We do this by introducing indexes to order the events that are stored in the working memory. Afterwards, we measure our performance improvements on targeted micro-benchmarks.
Tue 27 Oct (GMT-04:00) Eastern Time (US & Canada) change
|10:30 - 10:52|
|10:52 - 11:15|
|11:15 - 11:37|
|11:37 - 12:00|