The 2-3TR-tree, a trajectory-oriented index structure for fully evolving valid-time spatio-temporal datasets

Authors:
Mahdi Abdelguerfi;Julie Givaudan;Kevin Shaw;Roy Ladner
Affiliations:
University of New Orleans, LA;University of New Orleans, LA;Stennis Space Center, MS;Stennis Space Center, MS
Venue:
Proceedings of the 10th ACM international symposium on Advances in geographic information systems
Year:
2002

Citing 11
Cited 4

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
A model for the prediction of R-tree performance

PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Overlapping linear quadtrees: a spatio-temporal access method

Proceedings of the 6th ACM international symposium on Advances in geographic information systems
Towards historical R-trees

SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
Mining Spatio-Temporal Information Systems

Mining Spatio-Temporal Information Systems
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects

VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Novel Approaches in Query Processing for Moving Object Trajectories

VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Hilbert R-tree: An Improved R-tree using Fractals

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Specifications for Efficient Indexing in Spatiotemporal Databases

SSDBM '98 Proceedings of the 10th 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

PIST: An Efficient and Practical Indexing Technique for Historical Spatio-Temporal Point Data

Geoinformatica
AIRSTD: An Approach for Indexing and Retrieving Spatio-Temporal Data

Advanced Internet Based Systems and Applications
Indexing the fully evolvement of spatiotemporal objects

WSEAS Transactions on Information Science and Applications
SQUISH: an online approach for GPS trajectory compression

Proceedings of the 2nd International Conference on Computing for Geospatial Research & Applications

Quantified Score

Hi-index	0.01

Visualization

Abstract

Supporting large volumes of multi-dimensional data is an inherent characteristic of modern database applications, such as Geographical Information Systems (GIS), Computer Aided design (CAD), and Image and Multimedia Databases. Such databases need underlying systems with extended features like query languages, data models, and indexing methods, as compared to traditional databases, mainly because of the complexity of representing and retrieving data. The presented work deals with access methods for databases that accurately model the real world. More precisely, the focus is on index structures that can capture the time varying nature of moving objects, namely spatio-temporal structures. A new taxonomy to classify these structures has been defined according to dataset characteristics and query requirements. Then, a new spatio-temporal access method, the 2-3TR-tree, has been designed to process specific datasets and fulfill specific query requirements that no other existing spatio-temporal index could handle.