Skip to main content

Indexing Objects Moving on Fixed Networks

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

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2750))

Included in the following conference series:

Abstract

The development of a spatiotemporal access method suitable for objects moving on fixed networks is a very attractive challenge due to the great number of real-world spatiotemporal database applications and fleet management systems dealing with this type of objects. In this work, a new indexing technique, named Fixed Network R-Tree (FNR-Tree), is proposed for objects constrained to move on fixed networks in 2-dimensional space. The general idea that describes the FNR-Tree is a forest of 1-dimensional (1D) R-Trees on top of a 2-dimensional (2D) R-Tree. The 2D R-Tree is used to index the spatial data of the network (e.g. roads consisting of line segments), while the 1D R-Trees are used to index the time interval of each object’s movement inside a given link of the network. The performance study, comparing this novel access method with the traditional R-Tree under various datasets and queries, shows that the FNR-Tree outperforms the R-Tree in most cases.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Brinkhoff, T.: Generating Network-Based Moving Objects. In: Proceedings of the 12th Int’l Conference on Scientific and Statistical Database Management, SSDBM 2000, Berlin, Germany (2000)

    Google Scholar 

  2. Guttman, A.: R-Trees: a dynamic index structure for spatial searching. In: Proceedings of the 13th Association for Computing Machinery SIGMOD Conference, pp. 47–57 (1984)

    Google Scholar 

  3. Hadjieleftheriou, M., Kollios, G., Tsotras, V.J., Gunopulos, D.: Efficient Indexing of Spatiotemporal Objects. In: Jensen, C.S., Jeffery, K., Pokorný, J., Šaltenis, S., Bertino, E., Böhm, K., Jarke, M. (eds.) EDBT 2002. LNCS, vol. 2287, p. 251. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  4. Kamel, I., Faloutsos, C.: On Packing R-trees. In: Proceedings of the 2nd Conference on Information and Knowledge Management, pp. 490–499 (1993)

    Google Scholar 

  5. Kollios, G., Gunopulos, D., Tsotras, V.: On Indexing Mobile Objects. In: Proceedings of the 18th ACM Symposium on Principles of Database Systems, Philadelphia, PA, USA, pp. 261–272 (1999)

    Google Scholar 

  6. Nascimento, M.A., Silva, J.R.O.: Towards historical R-trees. In: Proceedings of the 13th ACM Symposium on Applied Computing, ACM-SAC 1998 (1998)

    Google Scholar 

  7. Nascimento, M.A., Silva, J.R.O., Theodoridis, Y.: Evaluation for access structures for discretely moving points. In: Böhlen, M.H., Jensen, C.S., Scholl, M.O. (eds.) STDBM 1999. LNCS, vol. 1678, pp. 171–188. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  8. Pfoser, D.: Indexing the Trajectories of Moving Objects. IEEE Data Engineering Bulletin 25(2), 2–9 (2002)

    Google Scholar 

  9. Pfoser, D., Jensen, C.S.: Querying the Trajectories of On-Line Mobile Objects. TIMECENTER Technical Report, TR-57 (2001)

    Google Scholar 

  10. Pfoser, D., Jensen, C.S., Theodoridis, Y.: Novel Approaches to the Indexing of Moving Object Trajectories. In: Proceedings of the 26th International Conference on Very Large Databases, Cairo, Egypt (2000)

    Google Scholar 

  11. Papadias, D., Tao, Y., Kalnis., P., Zhang, J.: Indexing Spatio-Temporal Data Warehouses. In: Proceedings of IEEE International Conference on Data Engineering, ICDE (2002)

    Google Scholar 

  12. Saltenis, S., Jensen, C.S.: Indexing of Moving Objects for Location-Based Services. TIMECENTER Technical Report, TR-63 (2001)

    Google Scholar 

  13. Saltenis, S., Jensen, C.S., Leutenegger, S.T., Lopez, M.A.: Indexing the Positions of Continuously Moving Objects. TIMECENTER Technical Report, TR- 44 (1999)

    Google Scholar 

  14. Tao, Y., Papadias, D.: Mv3R-tree: a spatiotemporal access method for timestamp and interval queries. In: Proceedings of the 27th International Conference on Very Large Databases (2001)

    Google Scholar 

  15. Theodoridis, Y., Sellis, T., Papadopoulos, A.N., Manolopoulos, Y.: Specifications for Efficient Indexing in Spatiotemporal Databases. In: Proceedings of the 10th International Conference on Scientific and Statistical Database Management, Capri, Italy (1998)

    Google Scholar 

  16. Theodoridis, Y., Vazirgiannis, M., Sellis, T.: Spatio-temporal Indexing for Large Multimedia Applications. In: Proceedings of the 3rd IEEE Conference on Multimedia Computing and Systems, Hiroshima, Japan (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Frentzos, E. (2003). Indexing Objects Moving on Fixed Networks. In: Hadzilacos, T., Manolopoulos, Y., Roddick, J., Theodoridis, Y. (eds) Advances in Spatial and Temporal Databases. SSTD 2003. Lecture Notes in Computer Science, vol 2750. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45072-6_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45072-6_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40535-1

  • Online ISBN: 978-3-540-45072-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics