Advertisement

Indexing Objects Moving on Fixed Networks

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

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.

Keywords

Line Segment Road Network Leaf Node Range Query Query Window 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 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. 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)CrossRefGoogle Scholar
  4. 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. 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. 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. 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)CrossRefGoogle Scholar
  8. 8.
    Pfoser, D.: Indexing the Trajectories of Moving Objects. IEEE Data Engineering Bulletin 25(2), 2–9 (2002)Google Scholar
  9. 9.
    Pfoser, D., Jensen, C.S.: Querying the Trajectories of On-Line Mobile Objects. TIMECENTER Technical Report, TR-57 (2001)Google Scholar
  10. 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. 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. 12.
    Saltenis, S., Jensen, C.S.: Indexing of Moving Objects for Location-Based Services. TIMECENTER Technical Report, TR-63 (2001)Google Scholar
  13. 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. 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. 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. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Elias Frentzos
    • 1
  1. 1.Department of Rural and Surveying EngineeringNational Technical University of AthensZographou, AthensHellas, Greece

Personalised recommendations