Scalable Efficient Composite Event Detection - Coordination Models and Languages Access content directly
Conference Papers Year : 2010

Scalable Efficient Composite Event Detection


Composite event detection (CED) is the task of identifying combinations of events which are meaningful with respect to program-defined patterns. Recent research in event-based programming has focused on language design (in different paradigms), leading to a wealth of prototype programming models and languages. However, implementing CED in an efficient and scalable manner remains an under-addressed problem. In fact, the lack of scalable algorithms is the main roadblock to incorporating support for more expressive event patterns into prominent event-based programming languages. This lack of scalable algorithms is a particularly acute problem in event stream processing, where event patterns can additionally be specified over time windows. In this paper we describe GenTrie, a deterministic trie-based algorithm for CED. We describe how complex event patterns are split, how each sub-pattern maps to a node in the trie, and demonstrate through empirical evaluation that GenTrie has higher throughput than current implementations of related languages.
Fichier principal
Vignette du fichier
Paper27-Jayaram-Eugster.pdf (575.64 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01054628 , version 1 (07-08-2014)





K. R. Jayaram, Patrick Eugster. Scalable Efficient Composite Event Detection. 12th International Conference on Coordination Models and Languages (COORDINATION) Held as part of International Federated Conference on Distributed Computing Techniques (DisCoTec), Jun 2010, Amsterdam, Netherlands. pp.168-182, ⟨10.1007/978-3-642-13414-2_12⟩. ⟨hal-01054628⟩
64 View
103 Download



Gmail Facebook X LinkedIn More