Efficient matching of incoming events of data streams to persistent queries is fundamental to event stream processing systems. These applications require dealing with high volume and continuous data streams with fast processing time on distributed complex event processing (CEP) systems. Therefore, a well-managed parallel processing technique is needed for improving the performance of the system. However, the specific properties of pattern operators in the CEP systems increase the difficulties of the parallel processing problem. To address these issues, a parallelization model and an adaptive parallel processing strategy are proposed for the complex event processing by introducing a histogram, and utilizing the probability and queue theory. The proposed strategy can estimate the optimal event splitting policy, which can suit the most recent workloads conditions such that the selected policy has the least expected waiting time for further processing the arriving events. The proposed strategy can keep the CEP system running fast under the variation of the time window sizes of operators and input rates of streams. Finally, the utility of our work is demonstrated through the experiments on the StreamBase system.
In conclusion, the traditional centralized CEP architecture limits its developments, because it is hardly robust and scalable due to single point failure or network break. In addition, some applications are geographically distributed which need to detect complex events from the distributed system. Therefore, distributed CEP has been considered recently. @cite_47 devised plan-based CEP across distributed sources. @cite_67 designed an approach for distributed complex event processing for the RFID application. Compared with our work, these methods do not support distributed pattern operators in the CEP systems.
@cite_67 @cite_47
2139800559 2409573971 2094206427 2043390121
Radio-frequency identification (RFID) technology has brought tremendous benefits for business processing, especially in incorporating RFID data into supply chain management (SCM). With the explosion of RFID data, there has raised important problem how to mine valuable information from tremendous and potentially infinite volumes of RFID data. Complex event processing (CEP) technology used to process RFID data has attracted increasing attention. However, the current researches usually focus on centralized CEP architecture, which requires greater bandwidth and computational capability, and lacks of robustness and scalability because of single point failure or network break. This paper first proposes a novel distributed CEP architecture, which spreads centralized CEP tasks load over multiple communicating stations by a space-based communication paradigm over a distributed message broker architecture based on Jini network. A distributed complex event detection algorithm based on master-workers pattern is proposed. The results of experiment show that the performance of our approach is remarkable in the large-scale RFID applications. Research issues in complex event processing (CEP) emphasizing on query optimization.Cover deterministic probabilistic models, centralized distributed settings.Issues for CEP optimization over Big Data enabling cloud computing platforms.Predictive Analytics and CEP in cloud platforms even with dispersed resource pools. Many Big Data technologies were built to enable the processing of human generated data, setting aside the enormous amount of data generated from Machine-to-Machine (M2M) interactions and Internet-of-Things (IoT) platforms. Such interactions create real-time data streams that are much more structured, often in the form of series of event occurrences. In this paper, we provide an overview on the main research issues confronted by existing Complex Event Processing (CEP) techniques, with an emphasis on query optimization aspects. Our study expands on both deterministic and probabilistic event models and spans from centralized to distributed network settings. In that, we cover a wide range of approaches in the CEP domain and review the current status of techniques that tackle efficient query processing. These techniques serve as a starting point for developing Big Data oriented CEP applications. Therefore, we further study the issues that arise upon trying to apply those techniques over Big Data enabling technologies, as is the case with cloud platforms. Furthermore, we expand on the synergies among Predictive Analytics and CEP with an emphasis on scalability and elasticity considerations in cloud platforms with potentially dispersed resource pools. Complex Event Processing (CEP) has emerged as a technology for monitoring event streams in search of user specified event patterns. When a CEP system is deployed in sensitive environments the user may wish to mitigate leaks of private information while ensuring that useful nonsensitive patterns are still reported. In this paper we consider how to suppress events in a stream to reduce the disclosure of sensitive patterns while maximizing the detection of nonsensitive patterns. We first formally define the problem of utility-maximizing event suppression with privacy preferences, and analyze its computational hardness. We then design a suite of real-time solutions to solve this problem. Our first solution optimally solves the problem at the event-type level. The second solution, at the event-instance level, further optimizes the event-type level solution by exploiting runtime event distributions using advanced pattern match cardinality estimation techniques. Our user study and experimental evaluation over both real-world and synthetic event streams show that our algorithms are effective in maximizing utility yet still efficient enough to offer near real-time system responsiveness. Detecting complex patterns in event streams, i.e., complex event processing (CEP), has become increasingly important for modern enterprises to react quickly to critical situations. In many practical cases business events are generated based on pre-defined business logics. Hence constraints, such as occurrence and order constraints, often hold among events. Reasoning using these known constraints enables us to predict the non-occurrences of certain future events, thereby helping us to identify and then terminate the long running query processes that are guaranteed to not lead to successful matches. In this work, we focus on exploiting event constraints to optimize CEP over large volumes of business transaction streams. Since the optimization opportunities arise at runtime, we develop a runtime query unsatisfiability (RunSAT) checking technique that detects optimal points for terminating query evaluation. To assure efficiency of RunSAT checking, we propose mechanisms to precompute the query failure conditions to be checked at runtime. This guarantees a constant-time RunSAT reasoning cost, making our technique highly scalable. We realize our optimal query termination strategies by augmenting the query with Event-Condition-Action rules encoding the pre-computed failure conditions. This results in an event processing solution compatible with state-of-the-art CEP architectures. Extensive experimental results demonstrate that significant performance gains are achieved, while the optimization overhead is small.