基于Hash B+树RFID复杂事件检测算法  

RFID complex event detecting algorithm based on Hash B+tree

作　　者：孟培超[1,2] 胡圣波[1,2] 舒恒[1,2] 曹瑞娟[3] 

机构地区：[1]贵州师范大学智能信息处理研究所,贵州贵阳550001 [2]贵州省教育厅射频设别与传感器网络工程中心,贵州贵阳550001 [3]桂林理工大学信息科学与工程学院,广西桂林541004

出　　处：《贵州师范大学学报（自然科学版）》2012年第6期89-93,共5页Journal of Guizhou Normal University：Natural Sciences

基　　金：贵州省贵阳市科技计划项目(筑科2011101);贵州省教育厅自然科学研究项目(黔教科2011046)

摘　　要：在分析现有RFID复杂事件检测算法的基础上,提出一种基于Hash B+树复杂事件检测算法。根据原子事件在Hash表中映射的位置状态,决定原子事件插入的位置,降低数据操作的时间复杂度。同时引入插入优化算法及滑动窗口,删除中间结果中过期数据,以提高内存的利用率。实验结果表明该方法在保证复杂事件检测有效性的同时可提高其处理效率。On the basis of the analysis of the existing RFID Complex Event Detecting Algorithm, a RFID complex event detecting algorithm which based on Hash B ＋ tree was put forward. According to the atomic events mapped the location of the state in a hash table, and then determining the location of the insertion of atomic events, reducing the time complexity of the data operation. At the same time introduced the optimization algorithm and the sliding window, delete the outdated data of intermediate results, improve the rate of memory utilization. Results of the experiments demonstrate that can ensure the validity of complex event detection and improves processing efficiency.

关 键 词：HASH B+树 RFID复杂事件检测 滑动窗口 时间戳乱序 

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