Indexing RETE's Working Memory: Catering to Dynamic Changes of the Ruleset

Simon Van De Water, Thierry Renaux, Lode Hoste, Wolfgang De Meuter

Onderzoeksoutput: Unpublished paper


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.
Originele taal-2English
Aantal pagina's7
StatusPublished - 7 okt 2015
EvenementREBLS 2015: Reactive and Event-based Languages & Systems - Sheraton Station Square Hotel, Pittsburgh, United States
Duur: 27 okt 201527 okt 2015


WorkshopREBLS 2015: Reactive and Event-based Languages & Systems
LandUnited States


Duik in de onderzoeksthema's van 'Indexing RETE's Working Memory: Catering to Dynamic Changes of the Ruleset'. Samen vormen ze een unieke vingerafdruk.

Citeer dit