Spatio-temporal Network Databases and Routing Algorithms: A Summary of Results

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

Abstract

Spatio-temporal networks are spatial networks whose topology and parameters change with time. These networks are important due to many critical applications such as emergency traffic planning and route finding services and there is an immediate need for models that support the design of efficient algorithms for computing the frequent queries on such networks. 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 network across time instants, resulting in high storage overhead and algorithms that are computationally expensive. In contrast, 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 (e.g. connectivity, shortest path) are computationally more efficient than those 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 leads to least travel time journeys (best start time journeys). Developing efficient algorithms for computing shortest paths in a time varying spatial network is challenging because these journeys do not always display greedy property or optimal substructure, making techniques like dynamic programming inapplicable. In this paper, we propose algorithms for shortest path computations in both contexts. We present the analytical cost models for the algorithms and provide an experimental comparison of performance with existing algorithms.

Keywords

time-aggregated graphs shortest paths spatio-temporal data bases 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Cherkassky, B.V., Goldberg, A.V., Radzik, T.: Shortest Paths Algorithms: Theory and Experimental Evaluation . Mathematical Programming 73, 129–174 (1996)MathSciNetGoogle Scholar
  2. 2.
    Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms (Chapter 26, Flow Networks). MIT Press, Cambridge, MA, USA (2002)Google Scholar
  3. 3.
    Dean, B.C.: Algorithms for minimum-cost paths in time-dependent networks. networks 44(1), 41–46 (2004)MATHCrossRefMathSciNetGoogle 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 (2006)Google Scholar
  9. 9.
    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
  10. 10.
    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
  11. 11.
    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
  12. 12.
    Sellis, T., Koubarakis, M., Frank, A., Grumbach, S., Güting, R.H., Jensen, C., Lorentzos, N.A., Manolopoulos, Y., Nardelli, E., Pernici, B., Theodoulidis, B., Tryfona, N., Schek, H.-J., Scholl, M.O.: Spatio-Temporal Databases: The CHOROCHRONOS Approach. In: Sellis, T., Koubarakis, M., Frank, A., Grumbach, S., Güting, R.H., Jensen, C., Lorentzos, N.A., Manolopoulos, Y., Nardelli, E., Pernici, B., Theodoulidis, B., Tryfona, N., Schek, H.-J., Scholl, M.O. (eds.) Spatio-Temporal Databases. LNCS, vol. 2520, Springer, Heidelberg (2003)Google Scholar
  13. 13.
    Lu, Q., George, B., Shekhar, S.: Capacity Constrained Routing Algorithms for Evacuation Planning: A Summary of Resu lts. In: Bauzer Medeiros, C., Egenhofer, M.J., Bertino, E. (eds.) SSTD 2005. LNCS, vol. 3633, Springer, Heidelberg (2005)Google Scholar
  14. 14.
    Oracle. Oracle Spatial 10g, An Oracle White Paper (August 2005), http://www.oracle.com/technology/products/spatial/
  15. 15.
    Orda, A., Rom, R.: Minimum weight paths in time-dependent networks. networks 21, 295–319 (1991)MATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Pallottino, S.: Shortest-Path Methods: Complexity, Interrelations and New Propositions. Networks 14, 257–267 (1984)MATHCrossRefGoogle Scholar
  17. 17.
    Pallottino, S., Scuttella, M.G.: Shortest path algorithms in tranportation models: Classical and innovative aspects. Equilibrium and Advanced transportation Modelling, 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)MATHGoogle Scholar
  22. 22.
    Shekhar, S., Liu, D.: CCAM: A Connectivity-Clustered Access Method for Networks and Networks Computations. IEEE Transactions on Knowledge and Data Engineering, 9 (January 1997)Google Scholar
  23. 23.
    Spatial Data Management Lab, Virginia Polytechnic Institute and State University. AITVS: Advanced Interactive Traffic Visualization System (2007), http://spatial.nvc.cs.vt.edu/traffic_zhh/
  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.
    Zhan, F.B., Noon, C.E.: Shortest Paths Algorithms: An Evaluation Using Real Road Networks. Transportation Science 32, 65–73 (1998)MATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Betsy George
    • 1
  • Sangho Kim
    • 1
  • Shashi Shekhar
    • 1
  1. 1.Department of Computer Science and Engineering, University of Minnesota, 200 Union St SE, Minneapolis, MN 55455USA

Personalised recommendations