Tue 27 Oct 2015 10:30 - 10:52 at Haselton 1 - Session 2

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
Times are displayed in time zone: (GMT-04:00) Eastern Time (US & Canada) change

10:30 - 12:00: REBLS - Session 2 at Haselton 1
rebls201510:30 - 10:52
Simon Van de WaterVUB, Thierry RenauxVrije Universiteit Brussel, Lode Hoste, Wolfgang De MeuterVrije Universiteit Brussel
rebls201510:52 - 11:15
Eric Fritz, Tian ZhaoUniversity of Wisconsin-Milwaukee
rebls201511:15 - 11:37
Alan JeffreyAlcatel-Lucent Bell Labs, Tom Van CutsemAlcatel-Lucent Bell Labs
rebls201511:37 - 12:00
Miguel DominguesNOVA-LINCS - Universidade Nova de Lisboa, João Costa SecoNOVA LINCS -- Universidade Nova de Lisboa