TY - GEN
T1 - Grand challenge
T2 - 10th ACM International Conference on Distributed and Event-Based Systems, DEBS 2016
AU - Mayer, Ruben
AU - Mayer, Christian
AU - Tariq, Muhammad Adnan
AU - Rothermel, Kurt
N1 - Publisher Copyright:
© 2016 ACM.
PY - 2016/6/13
Y1 - 2016/6/13
N2 - In recent years, the proliferation of highly dynamic graphstructured data streams fueled the demand for real-time data analytics. For instance, detecting recent trends in social networks enables new applications in areas such as disaster detection, business analytics or health-care. Parallel Complex Event Processing has evolved as the paradigm of choice to analyze data streams in a timely manner, where the incoming data streams are split and processed independently by parallel operator instances. However, the degree of parallelism is limited by the feasibility of splitting the data streams into independent parts such that correctness of event processing is still ensured. In this paper, we overcome this limitation for graph-structured data by further parallelizing individual operator instances using modern graph processing systems. These systems partition the graph data and execute graph algorithms in a highly parallel fashion, for instance using cloud resources. To this end, we propose a novel graph-based Complex Event Processing system GraphCEP and evaluate its performance in the setting of two case studies from the DEBS Grand Challenge 2016.
AB - In recent years, the proliferation of highly dynamic graphstructured data streams fueled the demand for real-time data analytics. For instance, detecting recent trends in social networks enables new applications in areas such as disaster detection, business analytics or health-care. Parallel Complex Event Processing has evolved as the paradigm of choice to analyze data streams in a timely manner, where the incoming data streams are split and processed independently by parallel operator instances. However, the degree of parallelism is limited by the feasibility of splitting the data streams into independent parts such that correctness of event processing is still ensured. In this paper, we overcome this limitation for graph-structured data by further parallelizing individual operator instances using modern graph processing systems. These systems partition the graph data and execute graph algorithms in a highly parallel fashion, for instance using cloud resources. To this end, we propose a novel graph-based Complex Event Processing system GraphCEP and evaluate its performance in the setting of two case studies from the DEBS Grand Challenge 2016.
KW - Complex event processing
KW - Distributed graph processing
UR - https://www.scopus.com/pages/publications/84978743321
U2 - 10.1145/2933267.2933509
DO - 10.1145/2933267.2933509
M3 - Conference contribution
AN - SCOPUS:84978743321
T3 - DEBS 2016 - Proceedings of the 10th ACM International Conference on Distributed and Event-Based Systems
SP - 309
EP - 316
BT - DEBS 2016 - Proceedings of the 10th ACM International Conference on Distributed and Event-Based Systems
PB - Association for Computing Machinery, Inc
Y2 - 20 June 2016 through 24 June 2016
ER -