Skip to main content

Indexing Historical Spatiotemporal Data

  • Reference work entry
  • First Online:
  • 32 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 P0 = (x0,y0) and P1 = (x1,y1) at times t0 and t1, respectively. The database server has no idea about the exact locations of object O between t0 and t1. 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 P0 and P1 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 spatio-temporal...

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   4,499.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   6,499.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about 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 the 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 the 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 the 8th International Conference on Extending Database Technology; 2002. p. 251–68.

    Chapter  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.

    Article  Google Scholar 

  7. Lomet DB, Salzberg B. Access methods for multiversion data. In: Proceedings of the 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 the 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 the 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 the 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 the 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 the 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 the 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 the 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 the International Symposium on Spatial Data Handling; 1990. p. 1040–9.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding authors

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

Editor information

Editors and Affiliations

Section Editor information

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Science+Business Media, LLC, part of Springer Nature

About this entry

Check for updates. Verify currency and authenticity via CrossMark

Cite this entry

Mokbel, M.F., Aref, W.G. (2018). Indexing Historical Spatiotemporal Data. In: Liu, L., Özsu, M.T. (eds) Encyclopedia of Database Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8265-9_198

Download citation

Publish with us

Policies and ethics