%0 Conference Proceedings
%T Scalable Efficient Composite Event Detection
%+ Department of Computer Science
%A Jayaram, K. R.
%A Eugster, Patrick
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 12th International Conference on Coordination Models and Languages (COORDINATION) Held as part of International Federated Conference on Distributed Computing Techniques (DisCoTec)
%C Amsterdam, Netherlands
%Y Dave Clarke; Gul Agha
%I Springer
%3 Coordination Models and Languages
%V LNCS-6116
%P 168-182
%8 2010-06-07
%D 2010
%R 10.1007/978-3-642-13414-2_12
%Z Computer Science [cs]/Digital Libraries [cs.DL]Conference papers
%X 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.
%G English
%2 https://inria.hal.science/hal-01054628/document
%2 https://inria.hal.science/hal-01054628/file/Paper27-Jayaram-Eugster.pdf
%L hal-01054628
%U https://inria.hal.science/hal-01054628
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-LNCS-6116
%~ IFIP-COORDINATION
%~ IFIP-DISCOTEC
%~ IFIP-2010