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
Efficient Indexing of Spatiotemporal Objects
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Novel Approaches in Query Processing for Moving Object Trajectories
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries
Proceedings of the 27th International Conference on Very Large Data Bases
On the Generation of Spatiotemporal Datasets
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
Generating Network-Based Moving Objects
SSDBM '00 Proceedings of the 12th International Conference on Scientific and Statistical Database Management
Complex spatio-temporal pattern queries
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Spatio-Temporal Indexing for Large Multimedia Applications
ICMCS '96 Proceedings of the 1996 International Conference on Multimedia Computing and Systems
Efficient indexing of moving objects using time-based partitioning with r-tree
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part II
| Hi-index | 0.00 |
The advances of wireless communication technologies, personal locator technology, and global positioning systems enable a wide range of services in real time environments. 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 spatio-temporal based time partitioning on the R-tree called SPR-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.