RFID complex event detecting algorithm based on Hash B+tree
Cao Rui-juan · Journal of Guizhou Normal University · 2012
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.