Efficient indexing of moving objects using time-based partitioning with r-tree

Authors:
Youn Chul Jung;Hee Yong Youn;Ungmo Kim
Affiliations:
School of Information and Communications Engineering, Sungkyunkwan University, Suwon, Korea;School of Information and Communications Engineering, Sungkyunkwan University, Suwon, Korea;School of Information and Communications Engineering, Sungkyunkwan University, Suwon, Korea
Venue:
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part II
Year:
2005

Citing 9
Cited 2

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
Towards historical R-trees

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
MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries

Proceedings of the 27th 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
Generating Network-Based Moving Objects

SSDBM '00 Proceedings of the 12th International Conference on Scientific and Statistical Database Management
Spatio-Temporal Indexing for Large Multimedia Applications

ICMCS '96 Proceedings of the 1996 International Conference on Multimedia Computing and Systems

Efficient indexing methods of continuously moving object in wireless networks

Proceedings of the 9th ACM international symposium on Mobility management and wireless access
Boundary-Based time partitioning with flattened r-tree for indexing ubiquitous objects

MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

A number of spatiotemporal access methods such as 3DR-Tree and MV3R-tree have been proposed for timestamp and interval query. These access methods consist of a single index structure covering the entire time span, and thus the performances quickly degrade since the indexed time region gets large as time progresses. To overcome the problem, we propose to employ time-based partitioning on the R-tree called Time-Based Partitioning R-tree (TPR-Tree). Since the structure of the TPR-Tree efficiently fits various queries on two dimensional data, it significantly outperforms other access methods for queries of various timestamps and time intervals. Extensive simulation validates the performance of the proposed scheme.