基于T^＊树的RFID数据缓存的研究与实现  

Research and Implementation in RFID Data Cache Based on T^＊ Tree

作　　者：龚华明[1] 阴躲芬[1] 

机构地区：[1]阿坝师范高等专科学校,汶川623002

出　　处：《计算机与数字工程》2013年第12期1967-1969,共3页Computer & Digital Engineering

摘　　要：如何对RFID中的海量数据进行有效存储并支持高效查询已成为目前研究的难点和热点。根据RFID数据的访问特点,将RFID数据的存储分为缓存和数据仓库两部分。并设计实现了基于T*树内存索引结构的RFID数据缓存模块,最后对其中的查询算法特别是批量查询给出了具体实现。结果表明,T*树比T树更节省存储空间,具有更高的cache效率以及更短的平均查询时间。How to store vast data of RFID effectively and support efficient query has become difficult and hot of research. According to the features of data access in RFID, the data storage of RFID is divided into two parts, cache and data warehouse. The RFID data cache mod- ule based on T^＊ tree memory index structure is designed and implemented. Lastly the implement of the query algorithm especially the batch query has been given. The results show that T^＊ tree algorithm can save more storage space than T tree, and it has higher cache efficiency and shorter average query time.

关 键 词：RFID数据缓存 内存索引 T树 T^＊树 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]