scispace - formally typeset
Journal ArticleDOI

GRETA: graph-based real-time event trend aggregation

Reads0
Chats0
TLDR
The Graph-based Real-time Event Trend Aggregation (Greta) approach that dynamically computes event trend aggregation without first constructing these trends, and defines the Greta graph to compactly encode all trends.
Abstract
Streaming applications from algorithmic trading to traffic management deploy Kleene patterns to detect and aggregate arbitrarily-long event sequences, called event trends. State-of-the-art systems process such queries in two steps. Namely, they first construct all trends and then aggregate them. Due to the exponential costs of trend construction, this two-step approach suffers from both a long delays and high memory costs. To overcome these limitations, we propose the Graph-based Real-time Event Trend Aggregation (GRETA) approach that dynamically computes event trend aggregation without first constructing these trends. We define the GRETA graph to compactly encode all trends. Our GRETA runtime incrementally maintains the graph, while dynamically propagating aggregates along its edges. Based on the graph, the final aggregate is incrementally updated and instantaneously returned at the end of each query window. Our GRETA runtime represents a win-win solution, reducing both the time complexity from exponential to quadratic and the space complexity from exponential to linear in the number of events. Our experiments demonstrate that GRETA achieves up to four orders of magnitude speed-up and up to 50--fold memory reduction compared to the state-of-the-art two-step approaches.

read more

Content maybe subject to copyright    Report

Citations
More filters
Proceedings ArticleDOI

Event Trend Aggregation Under Rich Event Matching Semantics

TL;DR: The Coarse-Grained Event Trend Aggregation (Cogra) approach supports a rich variety of event matching semantics within one system and incrementally maintains aggregates at the coarsest granularity possible for each of these semantics.
Proceedings ArticleDOI

To Share, or not to Share Online Event Trend Aggregation Over Bursty Event Streams

TL;DR: Hamlet as discussed by the authors proposes a novel framework Hamlet that adaptively decides at run time whether to share or not to share computations depending on the current stream properties to harvest the maximum sharing benefit.
Proceedings ArticleDOI

Sharon: Shared Online Event Sequence Aggregation

TL;DR: In this paper, a shared online event sequence aggregation (Sharon) approach is proposed to share intermediate aggregates among multiple queries while avoiding the expensive construction of event sequences, which can achieve up to an 18-fold speed-up compared to state-of-the-art approaches.
Proceedings ArticleDOI

Muse: Multi-query Event Trend Aggregation

TL;DR: This work proposes MUSE (Multi-query Shared Event trend aggregation), the first framework that shares aggregation queries with Kleene patterns while avoiding expensive trend construction and increases throughput by 4 orders of magnitude compared to state-of-the-art approaches.
Proceedings ArticleDOI

Efficient Complete Event Trend Detection over High-Velocity Streams

TL;DR: In this paper, an attribute-based indexing (ABI) graph model is proposed to represent the relationship between events, and several efficient traversal-based algorithms are designed to extract complete event trend (CET) from the graph.
References
More filters
Posted Content

Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals

TL;DR: The cube operator as discussed by the authors generalizes the histogram, cross-tabulation, roll-up, drill-down, and sub-total constructs found in most report writers, and treats each of the N aggregation attributes as a dimension of N-space.
Proceedings ArticleDOI

High-performance complex event processing over streams

TL;DR: This paper proposes a complex event language that significantly extends existing event languages to meet the needs of a range of RFID-enabled monitoring applications and describes a query plan-based approach to efficiently implementing this language.
Proceedings ArticleDOI

Efficient pattern matching over event streams

TL;DR: This paper presents a formal evaluation model that offers precise semantics for this new class of queries and a query evaluation framework permitting optimizations in a principled way and further analyzes the runtime complexity of query evaluation using this model and develops a suite of techniques that improve runtime efficiency by exploiting sharing in storage and processing.
Book ChapterDOI

Linear road: a stream data management benchmark

TL;DR: Results show that a dedicated Stream Data Management System can outperform a Relational Database by at least a factor of 5 on streaming data applications.
Proceedings Article

Cayuga: A General Purpose Event Monitoring System.

TL;DR: This work describes the design and implementation of the Cornell Cayuga System for scalable event processing and presents a query language based on Cayuga Algebra for naturally expressing complex event patterns.
Related Papers (5)