Open AccessProceedings Article
On Load Shedding in Complex Event Processing
Yeye He,Siddharth Barman,Jeffrey F. Naughton +2 more
- pp 213-224
Reads0
Chats0
TLDR
This paper formalizes broad classes of CEP load-shedding scenarios as different optimization problems and demonstrates an array of complexity results that reveal the hardness of these problems and construct shedding algorithms with performance guarantees.Abstract:
Complex Event Processing (CEP) is a stream processing model that focuses on detecting event patterns in continuous event streams. While the CEP model has gained popularity in the research communities and commercial technologies, the problem of gracefully degrading performance under heavy load in the presence of resource constraints, or load shedding, has been largely overlooked. CEP is similar to “classical” stream data management, but addresses a substantially different class of queries. This unfortunately renders the load shedding algorithms developed for stream data processing inapplicable. In this paper we study CEP load shedding under various resource constraints. We formalize broad classes of CEP load-shedding scenarios as different optimization problems. We demonstrate an array of complexity results that reveal the hardness of these problems and construct shedding algorithms with performance guarantees. Our results shed some light on the difficulty of developing load-shedding algorithms that maximize utility.read more
Citations
More filters
Proceedings ArticleDOI
On main-memory flushing in microblogs data management systems
TL;DR: In this paper, the authors propose kFlushing policy that exploits popularity of top-k queries in microblogs to smartly select a subset of microblogs for data flushing to increase memory hit ratio.
Posted Content
Foundations of Complex Event Processing.
TL;DR: A formal language for specifying complex events, called CEPL, that contains the common features used in the literature and has a simple and denotational semantics is proposed, and a formal computational model based on transducers and symbolic automata that captures the regular core of CEPL is introduced.
Proceedings ArticleDOI
pSPICE: Partial Match Shedding for Complex Event Processing
TL;DR: In this article, the authors proposed a load shedding strategy for CEP systems which drops a portion of the CEP operator's internal state (a.k.a. partial matches) to maintain a given latency bound.
Proceedings ArticleDOI
EIRES: Efficient Integration of Remote Data in Event Stream Processing
TL;DR: EIRES as discussed by the authors is a framework for efficient integration of static data from remote sources in CEP, which employs a cost-model to determine when to fetch certain remote data elements and how long to keep them in a cache for future use.
Posted Content
hSPICE: State-Aware Event Shedding in Complex Event Processing
TL;DR: A probabilistic model that uses the type and position of an event in a window and the state of a PM to assign a utility to an event corresponding to each PM, and an approach to predict a utility threshold that is used to drop the required amount of events to maintain a given latency bound.
References
More filters
Book
Convex Optimization
Stephen Boyd,Lieven Vandenberghe +1 more
TL;DR: In this article, the focus is on recognizing convex optimization problems and then finding the most appropriate technique for solving them, and a comprehensive introduction to the subject is given. But the focus of this book is not on the optimization problem itself, but on the problem of finding the appropriate technique to solve it.
Book
Approximation Algorithms
TL;DR: Covering the basic techniques used in the latest research work, the author consolidates progress made so far, including some very recent and promising results, and conveys the beauty and excitement of work in the field.
Book
Online Computation and Competitive Analysis
Allan Borodin,Ran El-Yaniv +1 more
TL;DR: This book discusses competitive analysis and decision making under uncertainty in the context of the k-server problem, which involves randomized algorithms in order to solve the problem of paging.
Proceedings ArticleDOI
Probabilistic computations: Toward a unified measure of complexity
TL;DR: Two approaches to the study of expected running time of algoritruns lead naturally to two different definitions of intrinsic complexity of a problem, which are the distributional complexity and the randomized complexity, respectively.
Book
Handbook of Scheduling: Algorithms, Models, and Performance Analysis
TL;DR: This book discusses Real-Time Scheduling Problems, Scheduling Models, Stochastic Scheduling, and Online Deterministic Scheduling as well as some basic Scheduling Algorithms and Complexity.