一种针对正规树模式的复杂事件查询方法  

Complex Event Query Based on Regular Tree Pattern

作　　者：郑利强 廖湖声 苏航 高红雨 ZHENG Liqiang;LIAO Husheng;SU Hang;GAO Hongyu(Faculty of Information Technology,Beijing University of Technology,Beijing 100124)

机构地区：[1]北京工业大学信息学部,北京100124

出　　处：《计算机与数字工程》2018年第5期966-971,共6页Computer & Digital Engineering

基　　金：北京市自然科学基金项目(编号:4122011)资助;国家自然科学基金青年基金项目(编号:61202074)资助

摘　　要：随着对半结构化流式数据进行复杂事件查询的需求日益增加,高效地进行复杂事件查询显得尤为重要。目前针对复杂事件查询的方法主要集中在仅有结构约束的查询请求,对同时含有时序约束的查询请求不能很好地支持。因此,针对XML这种半结构化流式数据,提出了一种基于下推自动机扩展的模式匹配算法,它能够高效地处理使用正规树模式描述的含有结构约束和时序约束的复杂事件,通过对比实验也证明了该方法具有更高的性能。With the growing demand of complex event query in semi-structured streaming data,a high performance in query processing is of great importance. Most state-of-the-art algorithms mainly focus on the requests containing only structural constraints,but the requests containing both structural and temporal constraints are not well-supported. With such concerns,an extended pattern-matching algorithm is proposed to efficiently process complex event queries over XML streaming data based on the pushdown automata. This method can process the request containing both structural and temporal constraints as described in regular tree pattern. The extensive experiments verify the efficiency and effectiveness of our approach.

关 键 词：复杂事件查询 正规树模式 下推自动机 XML流数据 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]