东北大学学报（自然科学版）

东北大学学报(自然科学版) ›› 2012, Vol. 33 ›› Issue (5): 627-631.DOI: -

• 论著 • 上一篇    下一篇

高密度RFID事件流上的复杂事件检测

徐传飞;林树宽;乔建忠;于戈;   

  1. 东北大学信息科学与工程学院;
  • 收稿日期:2013-06-19 修回日期:2013-06-19 发布日期:2013-04-04
  • 通讯作者: -
  • 作者简介:-
  • 基金资助:
    国家自然科学基金资助项目(60873009);;

Complex event detection on high-density RFID event streams

Xu, Chuan-Fei (1); Lin, Shu-Kuan (1); Qiao, Jian-Zhong (1); Yu, Ge (1)   

  1. (1) School of Information Science and Engineering, Northeastern University, Shenyang 110819, China
  • Received:2013-06-19 Revised:2013-06-19 Published:2013-04-04
  • Contact: Xu, C.-F.
  • About author:-
  • Supported by:
    -

RichHTML

0

PDF (PC)

639

摘要： 由于高密度事件流具有实时性和海量性特点,应用已有的复杂事件检测技术处理时,存在时间效率不高、占用内存空间较大等不足.针对这些问题,提出了一种基于哈希链表结构的复杂事件检测算法.该算法设计有效的哈希映射分类来保存中间结果,加快了匹配过程,同时,提出高效的更新机制及时删除内存中过期的数据.针对常见的事件流的乱序现象,对原有自动机处理机制进行了改进.实验和分析证明,复杂事件流检测方法具有理论上的可行性和操作上的高效性与正确性.

关键词: 高密度事件流, 复杂事件检测, 哈希结构, 更新机制, 乱序

Abstract: The high-density event stream contains mass events which arrive in real time. Existing complex event detection techniques are inefficient and more memory is needed when processing high-density event streams. In order to solve these problems, a new complex event detection algorithm based on Hash structure was proposed. The effective Hash mapping structure is designed in the algorithm to store intermediate data, which improves detection efficiency. Besides, updating mechanism to delete efficiently the overdue events from the memory was also proposed. Furthermore, auto deal mechanism was improved so as to detect complex events over out of order event streams. The feasibility, efficiency and correctness of our algorithms are demonstrated by the theoretical analysis and experiments.

中图分类号: