The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Novel Approaches in Query Processing for Moving Object Trajectories
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Evaluation of Access Structures for Discretely Moving Points
STDBM '99 Proceedings of the International Workshop on Spatio-Temporal Database Management
On the Generation of Spatiotemporal Datasets
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
RFID Systems and Security and Privacy Implications
CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
Smart Identification Frameworks for Ubiquitous Computing Applications
PERCOM '03 Proceedings of the First IEEE International Conference on Pervasive Computing and Communications
Spatio-Temporal Indexing for Large Multimedia Applications
ICMCS '96 Proceedings of the 1996 International Conference on Multimedia Computing and Systems
| Hi-index | 0.00 |
Recently, there has been a demand for RFID systems that can trace tag locations. For tracing tag locations, trajectories should be modeled and indexed in an RFID system. The trajectory of a tag is represented as a line that connects two spatiotemporal locations that are captured when the tag enters and leaves the vicinity of a reader. If a tag enters but does not leave a reader, its trajectory is represented only as the point captured at entry. When we process a query that finds the tag staying in a reader, it takes a long time to find this tag because it leads to searching the whole index. To solve this problem, we propose a data model in which trajectories of these tags are defined as intentional fixed intervals and a new index scheme called the Fixed Interval R-tree. We also propose a new insert and split policy to process queries efficiently. We evaluated the performance of the proposed index scheme and compared it with other schemes on various datasets and queries.