Skip to main content

Trajectory Compression under Network Constraints

  • Conference paper
Advances in Spatial and Temporal Databases (SSTD 2009)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 5644))

Included in the following conference series:

Abstract

The wide usage of location aware devices, such as GPS-enabled cellphones or PDAs, generates vast volumes of spatiotemporal streams modeling objects movements, raising management challenges, such as efficient storage and querying. Therefore, compression techniques are inevitable also in the field of moving object databases. Moreover, due to erroneous measurements from GPS devices, the problem of matching the location recordings with the underlying traffic network has recently gained the attention of the research community. So far, the proposed compression techniques are not designed for network constrained moving objects, while map matching algorithms do not consider compression issues. In this paper, we propose solutions tackling theĀ combined, map matched trajectory compression problem, the efficiency of which is demonstrated through an experimental evaluationĀ using a real trajectory dataset.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brakatsoulas, S., Pfoser, D., Salas, R., Wenk, C.: On Map-Matching Vehicle Tracking Data. In: Proc. 31st International Conference on Very Large Data Bases (VLDB) (2005)

    Google ScholarĀ 

  2. Cao, H., Wolfson, O.: Nonmaterialized Motion Information in Transport Networks. In: Eiter, T., Libkin, L. (eds.) ICDT 2005. LNCS, vol.Ā 3363, pp. 173ā€“188. Springer, Heidelberg (2004)

    ChapterĀ  Google ScholarĀ 

  3. GrĆ¼nwald, P., Myung, I.J., Pitt, M.: Advances in Minimum Description Length: Theory and Applications. MIT Press, Cambridge (2005)

    Google ScholarĀ 

  4. Johnson, D.B.: Efficient algorithms for shortest paths in sparse networks. Journal of the ACMĀ 24(1), 1ā€“13 (1977)

    ArticleĀ  MathSciNetĀ  MATHĀ  Google ScholarĀ 

  5. Kellaris, G., Pelekis, N., Theodoridis, Y.: Trajectory Compression under Network Constraints, UNIPI-INFOLAB-TR-2009-01, Technical Report Series, InfoLab, Univ. Piraeus (April 2009), http://infolab.cs.unipi.gr

  6. Meratnia, N., de By, R.A.: Spatiotemporal Compression Techniques for Moving Point Objects. In: Bertino, E., Christodoulakis, S., Plexousakis, D., Christophides, V., Koubarakis, M., Bƶhm, K., Ferrari, E. (eds.) EDBT 2004. LNCS, vol.Ā 2992, pp. 765ā€“782. Springer, Heidelberg (2004)

    ChapterĀ  Google ScholarĀ 

  7. Tiakas, E., Papadopoulos, A.N., Nanopoulos, A., Manolopoulos, Y.: Trajectory Similarity Search in Spatial Networks. In: Proc. 10th International Database Engineering and Applications Symposium (IDEAS) (2006)

    Google ScholarĀ 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

Ā© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kellaris, G., Pelekis, N., Theodoridis, Y. (2009). Trajectory Compression under Network Constraints. In: Mamoulis, N., Seidl, T., Pedersen, T.B., Torp, K., Assent, I. (eds) Advances in Spatial and Temporal Databases. SSTD 2009. Lecture Notes in Computer Science, vol 5644. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02982-0_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02982-0_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02981-3

  • Online ISBN: 978-3-642-02982-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics