Efficient complex event processing under boolean model

  • Authors:

  • Shanglian Peng;Tianrui Li;Hongjun Wang;Jia He;Tiejun Wang;Fan Li;An Liu

  • Affiliations:

  • School of Computer, Chengdu University of Information Technology, Chengdu, China;School of Information Science and Technology, SouthWest Jiaotong University, Chengdu, China;School of Information Science and Technology, SouthWest Jiaotong University, Chengdu, China;School of Computer, Chengdu University of Information Technology, Chengdu, China;School of Computer, Chengdu University of Information Technology, Chengdu, China;School of Computer, Chengdu University of Information Technology, Chengdu, China;School of Computer, Chengdu University of Information Technology, Chengdu, China

  • Venue:
  • WAIM'13 Proceedings of the 14th international conference on Web-Age Information Management
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

Existing evaluation techniques for complex event processing mainly target sequence patterns. However, boolean expression represents a broader class of patterns and is widely used to model complex events in practice. In this paper, we study efficient evaluation techniques for complex events modeled as boolean expressions. We propose an evaluation approach based on pseudo-NFA. The efficiency of pseudo-NFA approach is investigated and its optimization techniques are presented. We show that the proposed techniques are theoretically sound and demonstrate by extensive experiments that they perform considerably better than existing alternatives.