首页> 外文会议>Data Engineering, ICDE, 2009 IEEE 25th International Conference on >Sequence Pattern Query Processing over Out-of-Order Event Streams
【24h】

Sequence Pattern Query Processing over Out-of-Order Event Streams

机译:乱序事件流上的序列模式查询处理

获取原文

摘要

Complex event processing has become increasingly important in modern applications, ranging from RFID tracking for supply chain management to real-time intrusion detection. A key 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. State-of-the-art event stream processing technology experiences significant challenges when faced with out-of-order data arrival including output blocking, huge system latencies, memory resource overflow, and incorrect result generation. To address these problems, we propose two alternate solutions: aggressive and conservative strategies respectively to process sequence pattern queries on out-of-order event streams. The aggressive strategy produces maximal output under the optimistic assumption that out-of-order event arrival is rare. In contrast, to tackle the unexpected occurrence of an out-of-order event and with it any premature erroneous result generation, appropriate error compensation methods are designed for the aggressive strategy. The conservative method works under the assumption that out-of-order data may be common, and thus produces output only when its correctness can be guaranteed. A partial order guarantee (POG) model is proposed under which such correctness can be guaranteed. For robustness under spiky workloads, both strategies are supplemented with persistent storage support and customized access policies. Our experimental study evaluates the robustness of each method, and compares their respective scope of applicability with state-of-art methods.
机译:复杂的事件处理在现代应用中已变得越来越重要,其范围从用于供应链管理的RFID跟踪到实时入侵检测。复杂事件处理的关键方面是从事件流中提取模式以实时做出明智的决策。但是,网络等待时间和计算机故障可能会导致事件在事件处理引擎处无序到达。当遇到乱序的数据到达时,最新的事件流处理技术将面临巨大的挑战,包括输出阻塞,巨大的系统等待时间,内存资源溢出和错误的结果生成。为了解决这些问题,我们提出了两种替代解决方案:积极策略和保守策略分别用于处理乱序事件流上的序列模式查询。在乐观的假设(乱序事件很少发生)的情况下,积极进取的策略会产生最大的输出。相反,为了解决意外事件的意外发生以及随之而来的任何过早错误结果的产生,针对激进策略设计了适当的错误补偿方法。保守方法是在无序数据可能是常见的假设下工作的,因此只有在可以保证其正确性的情况下才产生输出。提出了一种可以保证这种正确性的部分订单保证(POG)模型。为了在棘手的工作负载下保持鲁棒性,这两种策略都补充有持久性存储支持和自定义访问策略。我们的实验研究评估了每种方法的鲁棒性,并将它们各自的适用范围与最新方法进行了比较。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号