Algorithm for RFID Event Aggregation and Filtering Based on KDB-tree
Lianglun Cheng · Jisuanji gongcheng · 2009
The characteristics of query data for RFID middleware are analyzed. Based on the characteristics,a method named aggregate transformation is proposed to save storage cost of index and reduce insertion time. The performance of several existing multidimensional indexes is analyzed and compared,KDB-tree index is supplied into RFID middleware. Theoretic analysis and experimental results demonstrate that KDB-tree index outperforms others in synthesized consideration of storage cost,insertion time cost and query time cost. In particular the query time cost of KDB-tree is distinctly lower than others because it provides single-path traverse in the query processing.