A declarative framework for matching iterative and aggregative patterns against event streams

1Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Complex Event Processing as well as pattern matching against streams have become important in many areas including financial services, mobile devices, sensor-based applications, click stream analysis, real-time processing in Web 2.0 and 3.0 applications and so forth. However, there is a number of issues to be considered in order to enable effective pattern matching in modern applications. A language for describing patterns needs to feature a well-defined semantics, it needs be rich enough to express important classes of complex patterns such as iterative and aggregative patterns, and the language execution model needs to be efficient since event processing is a real-time processing. In this paper, we present an event processing framework which includes an expressive language featuring a precise semantics and a corresponding execution model, expressive enough to represent iterative and aggregative patterns. Our approach is based on a logic, hence we analyse deductive capabilities of such an event processing framework. Finally, we provide an open source implementation and present experimental results of our running system. © Springer-Verlag Berlin Heidelberg 2011.

Cite

CITATION STYLE

APA

Anicic, D., Rudolph, S., Fodor, P., & Stojanovic, N. (2011). A declarative framework for matching iterative and aggregative patterns against event streams. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6826 LNCS, pp. 138–153). https://doi.org/10.1007/978-3-642-22546-8_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free