Skip to main content
SpringerLink
Log in

Indexing Historical Spatio-temporal Data

  • Living reference work entry
  • First Online:
Encyclopedia of Database Systems

  • 69 Accesses

Synonyms

Historical spatio-temporal access methods; Indexing the past; Trajectory indexing

Definition

Consider an object O that reports to a database server two consecutive locations P 0 = (x 0,y 0) and P 1 = (x 1,y 1) at times t 0 and t 1, respectively. The database server has no idea about the exact locations of object O between t 0 and t 1. To be able to answer queries regarding the user location at any time, the database server interpolates the two accurate locations through a trajectory that connects P 0 and P 1 through a straight line. While object O keeps sending location samples, the database server keeps accumulating set of consecutive trajectory lines that represent the historical movement of object O. Indexing historical spatio-temporal data includes dealing with such large numbers of trajectories. The main idea is to organize past trajectories in a way that supports historical spatial, temporal, and spatio-temporal queries.

Historical Background

The rapid increase in...

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Recommended Reading

  1. Becker B, Gschwind S, Ohler T, Seeger B, Widmayer P. An asymptotically optimal multiversion B-tree. VLDB J. 1996;5(4):264–75.

    Article  Google Scholar 

  2. Burton FW, Kollias JG, Matsakis DG, Kollias VG. Implementation of overlapping B-trees for time and space efficient representation of collections of similar files. Comput J. 1990;33(3):279–80.

    Article  Google Scholar 

  3. Chakka VP, Everspaugh A, Patel JM. Indexing large trajectory data sets with SETI. In: Proceedings of 1st Biennial Conference on Innovative Data Systems Research; 2003.

    Google Scholar 

  4. Guttman A. R-Trees: a dynamic index structure for spatial searching. In: Proceedings of ACM SIGMOD International Conference on Management of Data; 1984. p. 47–57.

    Google Scholar 

  5. Hadjieleftheriou M, Kollios G, Tsotras VJ, Gunopulos D. Efficient indexing of spatiotemporal objects. In: Advances in Database Technology, Proceedings of 8th International Conference on Extending Database Technology; 2002. p. 251–68.

    Google Scholar 

  6. Kollios G, Tsotras VJ, Gunopulos D, Delis A, Hadjieleftheriou M. Indexing animated objects using spatiotemporal access methods. IEEE Trans Knowl Data Eng. 2001;13(5):758–77. TKDE.

    Article  Google Scholar 

  7. Lomet DB, Salzberg B. Access methods for multiversion data. In: Proceedings of ACM SIGMOD International Conference on Management of Data; 1989. p. 315–24.

    Google Scholar 

  8. Nascimento MA, Silva JRO. Towards historical R-trees. In: Proceedings of 1998 ACM Symposium on Applied Computing; 1998. p. 235–40.

    Google Scholar 

  9. Pfoser D, Jensen CS, Theodoridis Y. Novel approaches in query processing for moving object trajectories. In: Proceedings of 26th International Conference on Very Large Data Bases; 2000. p. 395–406.

    Google Scholar 

  10. Song Z, Roussopoulos N. SEB-tree: an approach to index continuously moving objects. In: Proceedings of 4th International Conference on Mobile Data Management; 2003. p. 340–4.

    Google Scholar 

  11. Tao Y, Papadias D. Efficient historical R-trees. In: Proceedings of 13th International Conference on Scientific and Statistical Database Management; 2001. p. 223–32.

    Google Scholar 

  12. Tao Y, Papadias D. MV3R-Tree: a spatio-temporal access method for timestamp and interval queries. In: Proceedings of 27th International Conference on Very Large Data Bases; 2001. p. 431–40.

    Google Scholar 

  13. Theodoridis Y, Vazirgiannis M, Sellis T. Spatio-temporal indexing for large multimedia applications. In: Proceedings of International Conference on Multimedia Computing and Systems; 1996. p. 441–8.

    Google Scholar 

  14. Tzouramanis T, Vassilakopoulos M, Manolopoulos~Y. Overlapping linear quadtrees: a spatio-temporal access method. In: Proceedings of 6th International Symposium on Advances in Geographic Information Systems; 1998. p. 1–7.

    Google Scholar 

  15. Xu X, Han J, Lu W. RT-Tree: an improved R-tree indexing structure for temporal spatial databases. In: Proceedings of International Symposium on Spatial Data Handling; 1990. p. 1040–9.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Minnesota, – Twin Cities, 4-192 EE/Computer Science Building, Minneapolis, MN, 55455, USA

    Mohamed F. Mokbel

  2. Purdue University, 305 N. Univ. Street, West Lafayette, IN, 47907-2107, USA

    Walid G. Aref

Authors
  1. Mohamed F. Mokbel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Walid G. Aref
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Mohamed F. Mokbel or Walid G. Aref .

Editor information

Editors and Affiliations

  1. Georgia Institute of Technology College of Computing, Atlanta, Georgia, USA

    Ling Liu

  2. University of Waterloo School of Computer Science, Waterloo, Ontario, Canada

    M. Tamer Özsu

Section Editor information

  1. Dept. of Computer Science and Eng., Hong Kong Univ. of Science and Technology, Clear Water Bay, Kowloon, Hong Kong, Hong Kong SAR

    Dimitris Papadias

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer Science+Business Media New York

About this entry

Cite this entry

Mokbel, M.F., Aref, W.G. (2014). Indexing Historical Spatio-temporal Data. In: Liu, L., Özsu, M. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4899-7993-3_198-2

Download citation

  • DOI: https://doi.org/10.1007/978-1-4899-7993-3_198-2

  • Received:

  • Accepted:

  • Published:

  • Publisher Name: Springer, New York, NY

  • Online ISBN: 978-1-4899-7993-3

  • eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering

Publish with us

Policies and ethics

Search

Navigation