Abstract
Geographical (spatial) information about the real world changes rapidly with time. We can simply see examples of these changes when we look at any area. New buildings, new roads and highways, and many other new constructions are added or updated. Spatial changes can be categorized in two categories: (1) Discrete: changes of the geometries of physical entities (i.e., buildings) and (2) abstract: moving objects like airplanes, cars or even moving people. Spatio-temporal databases need to store information about spatial information and record their changes over time. The main goal our study in this paper is to find an efficient way to deal with spatio-temporal data, including the ability to store, retrieve, update, and query. We offer an approach for indexing and retrieving spatio-temporal data (AIRSTD). We concentrate on two main objectives: (1) Provide indexing structures for spatio-temporal data and (2) provide efficient algorithms to deal with these structures.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Abdelguerfi, M., Givaudan, J.: Advances in Spatio-Temporal R-tree Based Structures. Technical report TR012-02, Computer Science Department, University of New Orleans (2002)
Abdelguerfi, M., Julie, G., Kevin, S., Ladner, R.: Spatio-Temporal Data Handling: The 2-3TR-tree, a Trajectory-oriented Index Structure for Fully Evolving Valid-time Spatio-Temporal Datasets. In: Proceedings of the 10th ACM International Symposium on Advances in Geographic Information Systems (2002)
Guttman, A.: R-tree: A Dynamic Index Structure for Spatial Searching. In: Proc. of the 1984 ACM SIGMOD International Conference on Management Data, Boston, MA, pp. 47–57 (1984)
Halaoui, H.: Spatio-Temporal Data Model: Data Model and Temporal Index Using Versions for Spatio-Temporal Databases. In: Proceedings of the GIS Planet 2005, Estoril, Portugal (May 2005)
Nascimento, M., Silva, J.: Towards Historical R-trees. In: Proc. of ACM Symposium on Applied Computing, pp. 235–240 (1998)
Noel, G., et al.: The Po-Tree, a Real-Time Spatio-Temporal Data Indexing Structure. In: Proc. of Development in Spatial Data Handling SDH 2004, Leicester, pp. 259–270 (August 2004)
Noel, G., Servigne, S., Laurini, R.: Spatial and Temporal Information Structuring for Natural Risk Monitoring. In: Proceedings of the GIS Planet 2005, Estoril, Portugal (May 2005)
Procopiuc, C., Agarwal, P., Har-Peled, S.: Star-tree: An Efficient Self-Adjusting Index for Moving Points. In: ALENEX (2000)
Saltenis, S., et al.: Indexing the Positions of Continuously Moving Objects. In: Proc. of ACM SIGMOD (2000)
Schreck, T., Chen, Z.: R-Tree Implementation Using Branch-Grafting Method. In: Shekhar, S., Chawla, S. (eds.) Proc. of 2000 ACM Symposium on Spatial Databases: A Tour. Prentice Hall, Upper Saddle River (2003)
Theodoridis, Y., Sellis, P.T.A., Manolopoulos, Y.: Specifications for Efficient Indexing in Spatio-Temporal Databases. In: Proc. SSDBM, pp. 123–132 (1998)
Tsotras, V.J., Kangelaris, N.: The Snapshot Index, an I/O-Optimal Access Method for Time-slice Queries. Information Systems 20(3) (1995)
Tsotras, V.J., Jensen, C.S., Snodgrass, R.T.: An Extensible Notation for Spatio-Temporal Index Queries. In: ACM SIGMOND Record, pp. 47–53 (March 1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Halaoui, H.F. (2009). AIRSTD: An Approach for Indexing and Retrieving Spatio-Temporal Data. In: Damiani, E., Yetongnon, K., Chbeir, R., Dipanda, A. (eds) Advanced Internet Based Systems and Applications. SITIS 2006. Lecture Notes in Computer Science, vol 4879. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01350-8_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-01350-8_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01349-2
Online ISBN: 978-3-642-01350-8
eBook Packages: Computer ScienceComputer Science (R0)