Advertisement

Time-Aggregated Graphs for Modeling Spatio-temporal Networks

  • Betsy George
  • Shashi Shekhar
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5383)

Abstract

Given applications such as location based services and the spatio-temporal queries they may pose on a spatial network (e.g., road networks), the goal is to develop a simple and expressive model that honors the time dependence of the road network. The model must support the design of efficient algorithms for computing the frequent queries on the network. This problem is challenging due to potentially conflicting requirements of model simplicity and support for efficient algorithms. Time expanded networks, which have been used to model dynamic networks employ replication of the networks across time instants, resulting in high storage overhead and algorithms that are computationally expensive. In contrast, the proposed time-aggregated graphs do not replicate nodes and edges across time; rather they allow the properties of edges and nodes to be modeled as a time series. Since the model does not replicate the entire graph for every instant of time, it uses less memory and the algorithms for common operations are computationally more efficient than for time expanded networks. One important query on spatio-temporal networks is the computation of shortest paths. Shortest paths can be computed either for a given start time or to find the start time and the path that lead to least travel time journeys (best start time journeys). Developing efficient algorithms for computing shortest paths in a time variant spatial network is challenging because these journeys do not always display optimal prefix property, making techniques like dynamic programming inapplicable. In this paper, we propose algorithms for shortest path computation for a fixed start time. We present the analytical cost model for the algorithm and compare with the performance of existing algorithms.

Keywords

time-aggregated graphs shortest paths spatio-temporal data- bases location based services 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ahuja, R., Magnanti, T., Orlin, J.: Network Flows - Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993)zbMATHGoogle Scholar
  2. 2.
    Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, ch. 26, Flow Networks. MIT Press, Cambridge (2002)Google Scholar
  3. 3.
    Dean, B.C.: Algorithms for minimum-cost paths in time-dependent networks. Networks 44(1), 41–46 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Ding, Z., Guting, R.H.: Modeling temporally variable transportation networks. In: Proc. 16th Intl. Conf. on Database Systems for Advanced Applications, pp. 154–168 (2004)Google Scholar
  5. 5.
    Erwig, M.: Graphs in Spatial Databases. PhD thesis, Fern Universität Hagen (1994)Google Scholar
  6. 6.
    Erwig, M., Guting, R.H.: Explicit graphs in a functional model for spatial databases. IEEE Transactions on Knowledge and Data Engineering 6(5), 787–804 (1994)CrossRefGoogle Scholar
  7. 7.
    ESRI. ArcGIS Network Analyst (2006), http://www.esri.com/software/arcgis/extensions/
  8. 8.
    George, B., Shekhar, S.: Time-aggregated Graphs for Modeling Spatio-Temporal Networks - An Extended Abstract. In: Proceedings of Workshops at International Conference on Conceptual Modeling (November 2006)Google Scholar
  9. 9.
    Hall, R.W. (ed.): Handbook of Transportation Science. Kluwer Academic Publishers, Dordrecht (2003)zbMATHGoogle Scholar
  10. 10.
    Hamre, T.: Development of Semantic Spatio-temporal Data Models for Integration of Remote Sensing and in situ Data in Marine Information System. PhD thesis, University of Bergen, Norway (1995)Google Scholar
  11. 11.
    Kaufman, D.E., Smith, R.L.: Fastest paths in time-dependent networks for intelligent vehicle highway systems applications. IVHS Journal 1(1), 1–11 (1993)Google Scholar
  12. 12.
    Kohler, E., Langtau, K., Skutella M.: Time-expanded graphs for flow-dependent transit times. In: Proc. 10th Annual European Symposium on Algorithms, pp. 599–611 (2002)Google Scholar
  13. 13.
    Koubarakis, M., Sellis, T.K., Frank, A.U., Grumbach, S., Güting, R.H., Jensen, C.S., Lorentzos, N.A., Manolopoulos, Y., Nardelli, E., Pernici, B., Schek, H.-J., Scholl, M., Theodoulidis, B., Tryfona, N.(eds.): Spatio-Temporal Databases. LNCS, vol. 2520. Springer, Heidelberg (2003)zbMATHGoogle Scholar
  14. 14.
    Lu, Q., George, B., Shekhar, S.: Capacity Constrained Routing Algorithms for Evacuation Planning: A Summary of Results. In: Bauzer Medeiros, C., Egenhofer, M.J., Bertino, E. (eds.) SSTD 2005. LNCS, vol. 3633. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  15. 15.
    Oracle. Oracle Spatial 10g, An Oracle White Paper (August 2005), http://www.oracle.com/technology/products/spatial/
  16. 16.
    Orda, A., Rom, R.: Minimum weight paths in time-dependent networks. Networks 21, 295–319 (1991)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Pallottino, S., Scuttella, M.G.: Shortest path algorithms in tranportation models: Classical and innovative aspects. In: Equilibrium and Advanced transportation Modelling (Kluwer), pp. 245–281 (1998)Google Scholar
  18. 18.
    Rasinmäki, J.: Modelling spatio-temporal environmental data. In: 5th AGILE Conference on Geographic Information Science, Palma, Balearic Islands, Spain (April 2002)Google Scholar
  19. 19.
    Shekhar, S., Chawla, S.: Spatial Databases: Tour. Prentice-Hall, Englewood Cliffs (2003)Google Scholar
  20. 20.
    Sawitzki, D.: Implicit Maximization of Flows over Time. Technical report, University of Dortmund (2004)Google Scholar
  21. 21.
    Dreyfus, S.E.: An appraisal of some shortest path algorithms. Operations Research 17, 395–412 (1969)CrossRefzbMATHGoogle Scholar
  22. 22.
    Sheffi, Y.: Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Method. Prentice-Hall, Englewood Cliffs (1985)Google Scholar
  23. 23.
    Shekhar, S., Liu, D.: CCAM: A Connectivity-Clustered Access Method for Networks and Networks Computations. IEEE Transactions on Knowledge and Data Engineering, vol. 9 (January 1997)Google Scholar
  24. 24.
    Stephens, S., Rung, J., Lopez, X.: Graph data representation in oracle databese 10g: Case studies in life sciences. IEEE Data Engineering Bulletin 27(4), 61–66 (2004)Google Scholar
  25. 25.
    Wardrop, J.: Some theoretical aspects of road traffic research. Proceedings of the Institution of Civil Engineers 2(1) (1952)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Betsy George
    • 1
  • Shashi Shekhar
    • 1
  1. 1.Department of Computer Science and EngineeringUniversity of MinnesotaMinneapolisUSA

Personalised recommendations