Boundary-Based Time Partitioning with Flattened R-Tree for Indexing Ubiquitous Objects

The advances of wireless communication technologies, personal locator technology, and global positioning systems enable a wide range of location-aware services. To enable the services, a number of spatiotemporal access methods have been proposed for handling timestamp and time interval queries. However, the performance of the existing methods of a single index structure quickly degrades as time progresses. To overcome the problem, we propose to employ time-based partitioning on the R-tree called time boundary-based partitioning with flattened R-tree (BPR-Tree). The proposed scheme employs a new insertion policy to reduce the height of the tree and a time grouping method in order to minimize the search time of various queries. Extensive computer simulation reveals that the proposed scheme significantly outperforms the existing schemes.

[1]  Hee Yong Youn,et al.  Efficient Indexing of Moving Objects Using Time-Based Partitioning with R-Tree , 2005, International Conference on Computational Science.

[2]  Antonin Guttman,et al.  R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.

[3]  Yufei Tao,et al.  MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries , 2001, VLDB.

[4]  Christian S. Jensen,et al.  Spatio-Temporal Database Management , 1999, Lecture Notes in Computer Science.

[5]  Dieter Pfoser,et al.  Novel Approaches in Query Processing for Moving Object Trajectories , 2000, VLDB 2000.

[6]  Dieter Pfoser,et al.  Novel Approaches to the Indexing of Moving Object Trajectories , 2000, VLDB.

[7]  Matthias Jarke,et al.  Advances in Database Technology — EDBT 2002 , 2002, Lecture Notes in Computer Science.

[8]  A. Guttman,et al.  A Dynamic Index Structure for Spatial Searching , 1984, SIGMOD 1984.

[9]  Thomas Brinkhoff,et al.  Generating network-based moving objects , 2000, Proceedings. 12th International Conference on Scientific and Statistica Database Management.

[10]  Dieter Pfoser,et al.  Querying the trajectories of on-line mobile objects , 2001, MobiDe '01.

[11]  Yannis Theodoridis,et al.  Evaluation of Access Structures for Discretely Moving Points , 1999, Spatio-Temporal Database Management.

[12]  Yannis Theodoridis,et al.  On the Generation of Spatiotemporal Datasets , 1999 .

[13]  Timos K. Sellis,et al.  Spatio-temporal indexing for large multimedia applications , 1996, Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems.

[14]  Dimitrios Gunopulos,et al.  Efficient Indexing of Spatiotemporal Objects , 2002, EDBT.

[15]  Max J. Egenhofer,et al.  Advances in Spatial Databases , 1997, Lecture Notes in Computer Science.

[16]  Mario A. Nascimento,et al.  Towards historical R-trees , 1998, SAC '98.

[17]  Thanasis Hadzilacos,et al.  Advances in Spatial and Temporal Databases: 8th International Symposium, SSTD 2003, Santorini Island, Greece, July 24 - 27, 2003. Proceedings , 2003 .

[18]  Elias Frentzos,et al.  Indexing Objects Moving on Fixed Networks , 2003, SSTD.