Boundary-Based time partitioning with flattened r-tree for indexing ubiquitous objects

Authors:
Youn Chul Jung;Hee Yong Youn;Eun Seok Lee
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:
MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
Year:
2005

Citing 10
Cited 0

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
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
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 of moving objects using time-based partitioning with r-tree

ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.