Efficient Adaptive Detection of Complex Event Patterns
Ilya Kolchinsky, Assaf Schuster

TL;DR
This paper introduces a novel, efficient method for dynamically deciding when to reoptimize event pattern evaluation structures in complex event processing, avoiding false positives and improving performance.
Contribution
It presents the first provably accurate mechanism for adaptive reoptimization in CEP, with formal guarantees and demonstrated effectiveness on real datasets.
Findings
Reduces unnecessary reoptimizations, saving computational resources.
Achieves higher accuracy in event pattern detection.
Outperforms existing methods in speed and precision.
Abstract
Complex event processing (CEP) is widely employed to detect occurrences of predefined combinations (patterns) of events in massive data streams. As new events are accepted, they are matched using some type of evaluation structure, commonly optimized according to the statistical properties of the data items in the input stream. However, in many real-life scenarios the data characteristics are never known in advance or are subject to frequent on-the-fly changes. To modify the evaluation structure as a reaction to such changes, adaptation mechanisms are employed. These mechanisms typically function by monitoring a set of properties and applying a new evaluation plan when significant deviation from the initial values is observed. This strategy often leads to missing important input changes or it may incur substantial computational overhead by over-adapting. In this paper, we present an…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
