By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Yongli Wang ; Sch. of Comput. Sci. & Technol., Nanjing Univ. of Sci. & Technol., Xiaolingwei, China ; Gongxuan Zhang ; Feng Sheng ; Min Xu

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.

Published in:

Information Science and Technology (ICIST), 2011 International Conference on

Date of Conference:

26-28 March 2011