Browse > Article

A Time Interval Index for Tracking Trajectories of RFID Tags : SLR-Tree  

Ryu, Woo-Seok (부산대학교 컴퓨터공학과)
Ahn, Sung-Woo (부산대학교 컴퓨터공학과)
Hong, Bong-Hee (부산대학교 컴퓨터공학과)
Ban, Chae-Hoon (경남정보대학 인터넷응용계열)
Lee, Se-Ho (삼성전자 정보통신총괄)
Publication Information
Journal of KIISE:Databases / v.34, no.1, 2007 , pp. 59-69 More about this Journal
Abstract
The trajectory of a tag in RFID system is represented as a interval that connects two spatiotemporal locations captured when the tag enters and leaves the vicinity of a reader. Whole trajectories of a tag are represented as a set of unconnected interval because the location of the tag which left the vicinity of a reader is unknown until it enters the vicinity of another reader. The problems are that trajectories of a tag are not connected. It takes a long time to find trajectories of a tag because it leads to searching the whole index. To solve this problem, we propose a technique that links two intervals of the tag and an index scheme called SLR-tree. We also propose a sharing technique of link information between two intervals which enhances space utilization of nodes, and propose a split policy that preserves shared-link information. And finally, we evaluate the performance of the proposed index and prove that the index processes history queries efficiently.
Keywords
RFID; tag indexing; tag trajectory; history query;
Citations & Related Records
연도 인용수 순위
  • Reference
1 A. Guttman, 'R-Trees: A dynamic index structure for spatial searching,' In Proc. of the 1984 ACM SIGMOD Intl. Conf. on Management of Data, pp.47-57, June 1984
2 K. Romer, T. Schoch, 'Infrastructure Concepts for Tag-Based Ubiquitous Computing Applications,' Workshop on Concepts and Models for Ubiquitous Computing, Ubicomp 2002, Goteborg, Sweden, September 2002
3 D. Pfoser, C. S. Jensen, and Y. Theodoridis, 'Novel Approaches to the Indexing of Moving Objects,' In Proc. of the 26th VLDB Conf, pp.395-406, 2000
4 J. L. Bently, 'Algorithms for Klee's Rectangle Problems,' Computer Science Department, Carnegie-Mellon University, Pittsburgh, 1977
5 Mark Harrison, 'EPCTM Information Service-Data Model and Queries,' 2003
6 Y. Theodoridis, M. Vassilakopoulos, and T. Sellis, 'Spatio-temporal indexing for large multimedia applications,' In Proc. of the 3rd IEEE Conf. on Multimedia Computing and Systems, pp.441-448, June 1996
7 B. CheaHoon. BongHee Hong, 'Time Parameterized Interval R-tree for Tracing Tags in RFID Systems,' 16th International Conference, DEXA 2005 (pp. 503-513)
8 N. Beckmann and H. P. Kriegel, 'The R*-tree: An Efficient and Robust Access Method for Points and Rectangles,' Proc. ACM SIGMOD, pp.332-331, 1990
9 S. E. Sarma, S. A. Weis, and D. W. Engels, 'RFID Systems and Security and Privacy Implications,' Springer-Verlag, pp.454-469, 2002
10 M. A. Nascimento and J.R.O. Silva, 'Towards historical R-Trees,' In Proc. of the 1998 ACM Symposium on applied Computing, pp.235-240, February 1998
11 M. A. Nascimento, J. T. O. Silca, and Y. Theodoridis, 'Evaluation of access structures for discretel moving points,' Proc. Of Int'l Workshop on Spatio-Temporal Database Management, pp.171-188, 1999
12 C. Kolovson and M. Stonebraker, 'Segment Indexes: Dynamic Indexing Techniques for Multi-Dimensional Interval Data,' Proc. ACM SIGMOD, pp.138-147, 1991