|M.Sc Thesis||Department of Industrial Engineering and Management|
|Assoc. Prof. Gal Avigdor|
|Full Thesis text|
A growing segment of event-based applications require both strict performance goals and processing of complex event patterns. Event processing patterns have two main complexity dimensions: the semantics of the language constructs (e.g. sequence) and the variety of semantic interpretations for each pattern (controlled by policies). We introduce in this work a novel approach for pattern rewriting that aims at efficiently processing patterns that comprise all levels of complexity.
We present a formal model for pattern rewriting and demonstrate its usage in a comprehensive set of rewriting techniques for complex pattern types, taking various semantic interpretations into account. A cost model is presented, balancing processing latency and event throughput according to user's preference. Pattern cost is then estimated using simulation-based techniques. This work advances the state-of-the-art by analyzing complex event processing logic and by using explicit means to optimize elements that are considered "black box." Our experimental study yields encouraging results, with improvement gain of more than tenfold relative to the non optimized solutions that are used in the current state-of-the-art systems.