Abstract

This study presents a novel method to develop kleene operators on a Binary Tree-Based Directed Graph (BTDG) to improve expressibility and performance of our developed complex event processing system. Complex Event Processing (CEP) systems are widely employed to notify opportunities and threats, which many of these situations are discovered through detection of multiple occurrences of the similar set of events. Many of CEP systems proposed kleene operators to detect these situations. The high expressibility of our implemented CEP system achieved by developing algorithms on kleene operator. These algorithms are designed on a BTDG as a unified basis to arrange input data and joining this input according to a given query. The performance is improved through directing events instantly to join with other events, dynamically switching to an optimal plan and late applying combination for kleene with specified size. The experiments shows kleene operator on BTDG brings rather high degree of expressiblity and performance in compare to its counterparts.

Keywords:

Binary tree-based directed graph, complex event processing, event matching, kleene operator,

References

1. Agrawal, J., Y. Diao, D. Gyllstrom and N. Immerman, 2008. Efficient pattern matching over event streams. Proceeding of the ACM SIGMOD International Conference on Management of Data. Vancouver, Canada, pp: 147-160.
   CrossRef    
2. Behravesh, B., S. Mariyam and A.H.T. Sim, 2014. Optimizing throughput and end-to-end latency in complex event processing. Under Revision in Math Probl. Eng., pp: 1-33.
   
3. Cugola, G. and A. Margara, 2010. TESLA: A formally defined event specification language. Proceeding of the 4th ACM International Conference on Distributed Event-based Systems, pp: 50-61.
   CrossRef    
4. Cugola, G. and A. Margara, 2012. Processing flows of information: From data stream to complex event processing. ACM Comput. Surv., 44(3): 1-70.
   CrossRef    
5. Demers, A.J., J. Gehrke, B. Panda, M. Riedewald, V. Sharma and W.M White, 2007. Cayuga: A general purpose event monitoring system. Proceeding of the 3rd Biennial Conference on Innovative Data Research (CIDR, 2007), Jan. 7-10, pp: 412-422.
   
6. Diao, Y., N. Immerman and D. Gyllstrom, 2008. SASE+: An agile language for kleene closure over event streams. Technical Report, UMass, pp: 1-13.
   
7. Gyllstrom, D., Y. Diao, E. Wu, P. Stahlberg and G. Anderson, 2007. SASE: Complex event processing over streams. Proceeding of the Biennial Conference on Innovative Data Systems Research (CIDR), pp: 407-411.
   
8. Mei, Y. and S. Madden, 2009. Zstream: A cost-based query processor for adaptively detecting composite events. Proceeding of the 35th SIGMOD International Conference on Management of Data, pp: 193-206.
   CrossRef    PMid:19296261    
9. Muthusamy, V., H. Liu and H.A. Jacobsen, 2010. Predictive publish/subscribe matching. Proceeding of the 4th ACM International Conference on Distributed Event-based Systems, pp: 14-25.
   CrossRef    
10. Peer, B., P. Rajbhoj and N. Chathanur, 2013. Complex events processing: Unburdening big data complexities. Infosys Labs Briefings, 11(1): 53-64.
    
11. Wang, D., E.A. Rundensteiner, H. Wang and R.T. Ellison, 2010. Active complex event processing: Applications in real-time health care. Proceeding of 36th International Conference on Very Large Data Bases, Sept. 13-17, pp: 1545-1548.
    CrossRef    
12. Wu, E., Y. Diao and S. Rizvi, 2006. High-performance complex event processing over streams. Proceeding of the 2006 ACM SIGMOD International Conference on Management of Data, pp: 407-418.
    CrossRef    

Competing interests

The authors have no competing interests.

Open Access Policy

This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Copyright

The authors have no competing interests.