Complex event processing over distributed probabilistic event streams
Y. H. Wang,K. Cao,X. M. Zhang +2 more
78
TL;DR: A query plan based method using tree data structure is used to process hierarchical complex event from distributed event streams and query plan optimization is proposed based on query optimization technology of probabilistic databases.
read more
Abstract: With the rapid development of Internet of Things (IoT), enormous events are produced every day. Complex Event Processing (CEP), which can be used to extract high level patterns from raw data, becomes the key part of the IoT middleware. In large-scale IoT applications, the current CEP technology encounters the challenge of massive distributed data which cannot be handled by most of the current methods efficiently. Another challenge is the uncertainty of the data caused by noise, sensor error or wireless communication techniques. In order to solve these challenges, in this paper a high-performance complex event processing method over distributed probabilistic event streams is proposed. With the ability to report confidence for processed complex events over uncertain data, this method uses probabilistic nondeterministic finite automaton and active instance stacks to process a complex event in both single and distributed probabilistic event streams. A parallel algorithm is designed to improve the performance. A query plan-based method is used to process the hierarchical complex event from distributed event streams. Query plan optimization is proposed based on the query optimization technology of probabilistic databases. The experimental study shows that this method is efficient in processing complex events over distributed probabilistic event streams.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Prescriptive analytics: Literature review and research challenges
TL;DR: This paper investigates the existing literature pertaining to prescriptive analytics and prominent methods for its implementation, provides clarity on the research field of prescriptives, synthesizes the literature review in order to identify the existing research challenges, and outlines directions for future research.
404
Complex event recognition in the Big Data era: a survey
Nikos Giatrakos,Elias Alevizos,Alexander Artikis,Antonios Deligiannakis,Minos Garofalakis +4 more
- 01 Jan 2020
TL;DR: This survey elaborates on the whole pipeline from the time CER queries are expressed in the most prominent languages, to algorithmic toolkits for scaling-out CER to clustered and geo-distributed architectural settings.
135
Recent Advancements in Event Processing
Miyuru Dayarathna,Srinath Perera +1 more
TL;DR: This survey summarizes the latest cutting-edge work done on EP from both industrial and academic research community viewpoints and divides the entire field of EP into three subareas: EP system architectures, EP use cases, and EP open research topics.
103
A Comprehensive Survey on Parallelization and Elasticity in Stream Processing
Henriette Röger,Ruben Mayer +1 more
TL;DR: In this article, a survey of the state of the art in stream processing parallelization and elasticity is presented, which is necessary to consolidate the state-of-the-art and to plan future research directions on this basis.
A systematic mapping study on internet of things challenges
Aleksandr Lepekhin,Alexandra Borremans,Igor Ilin,Sami Jantunen +3 more
- 27 May 2019
TL;DR: This paper identifies essential IoT-related challenges by conducting a systematic mapping study of existing IoT literature and discusses the findings in order to understand better the general state of IoT research, potential gaps in research, and implications for future research.
28
References
•Proceedings Article
Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data
John Lafferty,Andrew McCallum,Fernando Pereira +2 more
- 28 Jun 2001
TL;DR: This work presents iterative parameter estimation algorithms for conditional random fields and compares the performance of the resulting models to HMMs and MEMMs on synthetic and natural-language data.
Graph-Based Algorithms for Boolean Function Manipulation
TL;DR: In this paper, the authors present a data structure for representing Boolean functions and an associated set of manipulation algorithms, which have time complexity proportional to the sizes of the graphs being operated on, and hence are quite efficient as long as the graphs do not grow too large.
An introduction to hidden Markov models
TL;DR: The purpose of this tutorial paper is to give an introduction to the theory of Markov models, and to illustrate how they have been applied to problems in speech recognition.
Markov logic networks
TL;DR: Experiments with a real-world database and knowledge base in a university domain illustrate the promise of this approach to combining first-order logic and probabilistic graphical models in a single representation.
Related Papers (5)
Eugene Wu,Yanlei Diao,Shariq Rizvi +2 more
- 27 Jun 2006
Opher Etzion,Peter Niblett +1 more
- 07 Aug 2010
Segev Wasserkrug,Avigdor Gal,Opher Etzion,Yulia Turchin +3 more
- 01 Jul 2008