摘要
复杂事件处理技术通常基于有限状态自动机实现,匹配过程中会在事件流上产生大量且重叠的部分匹配,有限状态自动机需维护大量的重复匹配状态,导致基于该技术的方法都会出现冗余计算的问题。为了提高复杂事件处理的匹配效率,提出了使用复杂事件实例覆盖技术来实现复杂事件处理的方法。通过设计临时匹配链式分区存储结构以及基于此结构的匹配算法来利用复杂事件实例覆盖减少冗余计算,从而实现匹配效率的提升。在模拟数据集和真实数据集上进行了实验测试与分析,与两种常用的复杂事件处理技术进行比较。实验表明,提出方法能够在保证匹配正确性的同时有效地减少匹配过程中的冗余计算,提高整体匹配效率。
Complex event processing technology is usually implemented based on finite state automaton.During the matching process,a large number of overlapping partial matches will be generated by the event stream.The finite state automaton needs to maintain a large number of repeated matching states,which leads to the problem of redundant calculation in the methods based on this technology.In order to improve the matching efficiency of complex event processing,this paper proposed a method of using complex event instance coverage technology to realize complex event processing.By designing a temporary matching chain partition storage structure and matching algorithms based on this structure,it used complex event instance coverage to reduce redundant calculations,so as to improve the matching efficiency.Experiments were performed on simulated and real datasets,and compared with two commonly used complex event processing technologies.The experimental results show that the proposed method can effectively reduce the redundant computation in the matching process while ensuring the correctness of the matching,and improve the overall matching efficiency.
作者
邱涛
谢沛良
邓国鹏
郗红梅
郑智
夏秀峰
Qiu Tao;Xie Peiliang;Deng Guopeng;Xi Hongmei;Zheng Zhi;Xia Xiufeng(School of Computer Science,Shenyang Aerospace University,Shenyang 110136,China;Flight Test Station,Shenyang Aircraft Industry(Group)Co.Ltd.,Shenyang 110034,China)
出处
《计算机应用研究》
CSCD
北大核心
2022年第9期2677-2682,2688,共7页
Application Research of Computers
基金
国家自然科学基金青年基金资助项目(62002245)
辽宁省教育厅基础研究项目(JYT2020027)。
关键词
复杂事件处理
查询优化
有限状态自动机
分区存储
complex event processing(CEP)
query optimization
nondeterministic finite automaton(NFA)
partition storage
