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

被引:7
作者
Poppe, Olga [1 ]
Lei, Chuan [2 ]
Ma, Lei [3 ]
Rozet, Allison [4 ]
Rundensteiner, Elke A. [3 ]
机构
[1] Microsoft Gray Syst Lab, One Microsoft Way, Redmond, WA 98052 USA
[2] IBM Res Almaden, 650 Harry Rd, San Jose, CA 95120 USA
[3] Worcester Polytech Inst, 100 Inst Rd, Worcester, MA 01609 USA
[4] MathWorks, 1 Apple Hill Dr, Natick, MA 01760 USA
来源
SIGMOD '21: PROCEEDINGS OF THE 2021 INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA | 2021年
关键词
Complex Event Processing; query optimization; computation sharing; incremental aggregation; event trend;
D O I
10.1145/3448016.3452785
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Complex event processing (CEP) systems continuously evaluate large workloads of pattern queries under tight time constraints. Event trend aggregation queries with Kleene patterns are commonly used to retrieve summarized insights about the recent trends in event streams. State-of-art methods are limited either due to repetitive computations or unnecessary trend construction. Existing shared approaches are guided by statically selected and hence rigid sharing plans that are often sub-optimal under stream fluctuations. In this work, we propose a novel framework HAMLET that is the first to overcome these limitations. HAMLET introduces two key innovations. First, HAMLET 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. Second, HAMLET is equipped with a highly efficient shared trend aggregation strategy that avoids trend construction. Our experimental study on both real and synthetic data sets demonstrates that HAMLET consistently reduces query latency by up to five orders of magnitude compared to state-of-the-art approaches.
引用
收藏
页码:1452 / 1464
页数:13
相关论文
共 41 条
[1]  
Agrawal J., 2008, SIGMOD 08, P147
[2]  
[Anonymous], 2004, P 30 INT C VER LARG
[3]  
[Anonymous], 2003, P CIDR
[4]   High-Performance Dynamic Pattern Matching over Disordered Streams [J].
Chandramouli, Badrish ;
Goldstein, Jonathan ;
Maier, David .
PROCEEDINGS OF THE VLDB ENDOWMENT, 2010, 3 (01) :220-231
[5]  
Chen JJ, 2000, SIGMOD REC, V29, P379, DOI 10.1145/335191.335432
[6]  
Demers A.J., 2007, Conference on Innovative Data Systems Research, V7, P412
[7]   Complex event recognition in the Big Data era: a survey [J].
Giatrakos, Nikos ;
Alevizos, Elias ;
Artikis, Alexander ;
Deligiannakis, Antonios ;
Garofalakis, Minos .
VLDB JOURNAL, 2020, 29 (01) :313-352
[8]   Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-totals [J].
Gray, J ;
Chaudhuri, S ;
Bosworth, A ;
Layman, A ;
Reichart, D ;
Venkatrao, M ;
Pellow, F ;
Pirahesh, H .
DATA MINING AND KNOWLEDGE DISCOVERY, 1997, 1 (01) :29-53
[9]   Three-level Processing of Multiple Aggregate Continuous Queries [J].
Guirguis, Shenoda ;
Sharaf, Mohamed A. ;
Chrysanthis, Panos K. ;
Labrinidis, Alexandros .
2012 IEEE 28TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE), 2012, :929-940
[10]  
Hammad MoustafaA., 2003, P 29 INT C VERY LARG, V29, P297