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

Displayed time zone: Eastern Time (US & Canada) change

10:30 - 12:00
Session 2REBLS at Haselton 1
10:30
22m
Talk
Indexing RETE's Working Memory - Catering to Dynamic Changes of the Ruleset
REBLS
Simon Van de Water VUB, Thierry Renaux Vrije Universiteit Brussel, Lode Hoste , Wolfgang De Meuter Vrije Universiteit Brussel
10:52
22m
Talk
Type Inference of Asynchronous Arrows in JavaScript
REBLS
Eric Fritz , Tian Zhao University of Wisconsin-Milwaukee
11:15
22m
Talk
Functional Reactive Programming with nothing but Promises (Implementing Push/Pull FRP using JavaScript Promises)
REBLS
Alan Jeffrey Alcatel-Lucent Bell Labs, Tom Van Cutsem Alcatel-Lucent Bell Labs
11:37
22m
Talk
Type Safe Evolution of Live Systems
REBLS
Miguel Domingues NOVA-LINCS - Universidade Nova de Lisboa, João Costa Seco NOVA LINCS -- Universidade Nova de Lisboa