A RFID data cache structure based on Dual T Tree for spatio-temporal query

RFID technology provides a powerful ability of perceiving the world for human and it produces vast amounts of data. how to store and analyze the mass information has become a new challenge. A novel data structure for management and storage of RFID data is proposed in this paper, which uses a improvement form of the T tree - T list of trees (Dual T tree) and a path encoding technique to build spatio-temporal memory structure efficiently. Based on the memory structure, this paper introduces the event processing and query analysis algorithms, called DTTSTQ, and analyzes the time complexity of the algorithm. Experiments on real and synthetical data prove the validity and correctness of the proposed structure and algorithms.