Efficient strategy for out-of-order event stream processing

被引:0
作者
机构
[1] Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology, Key Laboratory of Computer Vision and System, Ministry of Education, Tianjin University of Technology
[2] College of Information Technology, South China Normal University
来源
Xiao, Y. (yyxiao@tjut.edu.cn) | 1600年 / 17期
关键词
Event stream processing; Latency distance; Out-of-order events; Purging time; Redo strategy;
D O I
10.6180/jase.2014.17.1.09
中图分类号
学科分类号
摘要
Complex event processing has been widely used in many modern applications. Akey aspect of complex event processing is to extract patterns from event streams to make informed decisions in real-time. However, network latencies and machine failures may cause events to arrive out-of-order at the event processing engine. To address the problem, a number of disordered event processing techniques are proposed. In this paper, we introduce latency distance and purging time to process out-of-order event streams in real-time. Further, we present a redo strategy based on playback, with which those false pattern matches produced at the early phase can be corrected by the aid of the cloud platform.We conduct extensive experiments, and the experimental results demonstrate the effectiveness of our methods.
引用
收藏
页码:73 / 80
页数:7
相关论文
共 13 条
  • [1] Wu E., Diao Y., Rizvi S., High-performance complex event processing over streams, Proc. of 2006 SIGMOD, pp. 407-418, (2006)
  • [2] Chen Q., Li Z., Liu H., Optimizing complex event processing over RFID data streams, Proc. of 2008 ICDE, pp. 1442-1444, (2008)
  • [3] Chakravarthy S., Krishnaprasad V., Anwar E., Kim S.-K., Composite events for active databases: Semantics, contexts and detection, Proc. of 1994 VLDB, pp. 601-617, (1994)
  • [4] Tucker P.A., Maier D., Sheard T., Fegaras L., Exploiting punctuation semantics in continuous data streams, IEEE Transactions on Knowledge and Data Engineering, 15, 3, pp. 555-568, (2003)
  • [5] Srivastava U., Widom J., Flexible time management in data stream systems, Proc. of 2004 PODS, pp. 263-274, (2004)
  • [6] Babu S., Srivastava U., Widom J., Exploiting k-constraints to reduce memory over-head in continuous queries over data streams, ACM Transitions on Database Systems, 29, 3, pp. 545-580, (2004)
  • [7] Li M., Liu M., Ding L., Event stream processing with out-of-order data arrival, Proc. of 2007 ICDCSW, pp. 67-74, (2007)
  • [8] Liu M., Li M., Golovnya D., Rundensteiner E.A., Claypool K., Sequence pattern query processing over out-of-order event streams, Proc. of 2009 ICDE, pp. 784-795, (2009)
  • [9] Wei M., Liu M., Supporting a spectrum of outof- order event processing technologies: From aggressive to conservative methodologies, Proc. of 2009 SIGMOD, pp. 1031-1033, (2009)
  • [10] Zhou C., Meng X., IO3: Interval-based outof- order event processing in pervasive computing, Proc. of 2010 DASFAA, pp. 261-268, (2010)