This article describes how quickly picking up some valuable information from massive RFID event stream often faces with the problem of long detection time, high memory consumption and low detection efficiency due to its stream characteristics of volume, velocity, variety, value and veracity. Aim to solving the problems above, an efficient complex event processing method based on NFA-HTBTS (Nondeterministic Finite Automaton-Hash Table B+ Tree Structure) is presented in this article. The achievement of this article lies in that we successfully use the union of NFA and HTBTS to realize the detection of complex event in massive RFID event stream. Specially, in our scheme, after using NFA to match related primitive events from massive RFID event stream, we use hash table and B+ tree structure to successfully realize the detection of complex event from large matched results above, as a result, these problems existed in current methods above can be effectively solved by our scheme. The simulation results show that our proposed scheme outperforms some general methods for massive RFID event stream.
Complex Event Processing Methods for Greenhouse Control
