Abstract
Spatio-temporal network is defined by a set of nodes, and a set of edges, where the properties of nodes and edges may vary over time. Such networks are encountered in a variety of domains ranging from transportation science to sensor data analysis. Given a spatio-temporal network, the aim is to develop a model that is simple, expressive and storage efficient. The model must also provide support for the design of algorithms to process frequent queries that need to be answered in the application domains. 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. This model is generally used to represent time-dependent flow networks and tends to be application-specific in nature. 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. Our approach achieves physical data independence and also addresses the issue of modeling spatio-temporal networks that do not involve flow parameters. In this paper, we describe the model at the conceptual, logical and physical levels. We also present case studies from various application domains.
This work was supported by the NSF/SEI grant 0431141, US Army Corps of Engineers (Topographic Engineering Center) grant, and Minnesota Department of Transportation. The content does not necessarily reflect the position or policy of the government and no official endorsement should be inferred.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Erwig, M.: Graphs in Spatial Databases. PhD thesis, Fern Universität Hagen (1994)
Erwig, M., Guting, R.: Explicit Graphs in a Functional Model for Spatial Databases. IEEE Transactions on Knowledge and Data Engineering 6(5), 787–804 (1994)
ESRI: ArcGIS Network Analyst (2006), http://www.esri.com/software/arcgis/extensions/
S., S., S., C.: Spatial Databases: Tour. Prentice Hall, Englewood Cliffs (2003)
Shekhar, S., Liu, D.: CCAM: A Connectivity-Clustered Access Method for Networks and Networks Computations. IEEE Transactions on Knowledge and Data Engineering 9 (1997)
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)
Ding, Z., Guting, R.: Modeling Temporally Variable Transportation Networks. In: Proc. 16th Intl. Conf. on Database Systems for Advanced Applications, pp. 154–168 (2004)
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)
Rasinmäki, J.: Modelling Spatio-temporal Environmental Data. In: 5th AGILE Conference on Geographic Information Science, Palma, Balearic Islands, Spain (2002)
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., Scholl, M., Theodoulidis, B., Tryfona, N.: Spatio-Temporal Databases. LNCS, vol. 2520. Springer, Heidelberg (2003)
Dreyfus, S.: An Appraisal of Some Shortest Path Algorithms. Operations Research 17, 395–412 (1969)
Ford, L., Fulkerson, D.: Constructing maximal Dynamic Flows from Static Flows. Operations Research 6 (1958)
Ford, L., fulkerson, D.: Flows in Networks. Princeton University Press, Princeton, NJ (1962)
Kaufman, D., Smith, R.: Fastest Paths in Time-Dependent Networks for Intelligent Vehicle Highway Systems Applications. IVHS Journal 1(1), 1–11 (1993)
Kohler, E., Langtau, K.: Time-Expanded Graphs for Flow-Dependent Transit Times. In: Proc. 10th Annual European Symposium on Algorithms, pp. 599–611 (2002)
Orda, A., Rom, R.: Minimum Weight Paths in Time-dependent Networks. Networks 21, 295–319 (1991)
Pallottino, S., Scuttella, M.G.: Shortest Path Algorithms in Tranportation Models: Classical and Innovative Aspects. Equilibrium and Advanced transportation Modelling (Kluwer), 245–281 (1998)
Gregerson, H., Jensen, C.: Temporal Entity Relationship Models - A Survey. IEEE Transactions on Knowledge and Data Engineering 11(3), 464–497 (1999)
Zimayi, E., Parent, C., Spaccapietra, S.: TERC+: A Temporal Conceptual Model. In: Proceedings of International Symposium on Digital Media Information Base (1997)
George, B., Kim, S., Shekhar, S.: Spatio-temporal Network Databases and Routing Algorithms: A Summary of Results. In: Proceedings of International Symposium on Spatial and Temporal Databases (SSTD 2007). LNCS, vol. 4605, pp. 460–477. Springer, Berlin (2007)
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)
Levine, N.: CrimeStat 3.0: A Spatial Statistics Program for the Analysis of Crime Incident Locations. Ned Levine & Associatiates: Houston, TX / National Institute of Justice: Washington, DC (2004)
Chen, P.: The Entity-Relationship Model - Towards a Unified View of Data. ACM Transactions on Database Systems 1(1), 9–36 (1976)
Shekhar, S., Vatsavai, R., Chawla, S., Burk, T.: Spatial Pictorgram Enhanced Conceptual Data Models and Their Translation to Logical Data Models. In: Agouris, P., Stefanidis, A. (eds.) ISD 1999. LNCS, vol. 1737, Springer, Heidelberg (1999)
Hamacher, H., Tjandra, S.: Mathematical Modeling of Evacuation Problems: A state of the art. Pedestrian and Evacuation Dynamics, 227–266 (2002)
W3C: RDF Primer: W3C Recommendation (2004), http://www.w3.org/TR/rdf-primer/
Chong, E., Das, S., Eadon, G., Srinivasan, J.: An Efficient SQL-based RDF Queryin Scheme. In: Proceedings of the 31st International Conference on Very Large Databases (2005)
Sawitzki, D.: Implicit Maximization of Flows over Time. Technical report, University of Dortmund (2004)
Cherkassky, B., Goldberg, A., Radzik, T.: Shortest Paths Algorithms: Theory and Experimental Evaluation. Mathematical Programming 73, 129–174 (1996)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
George, B., Shekhar, S. (2007). Modeling Spatio-temporal Network Computations: A Summary of Results. In: Fonseca, F., RodrÃguez, M.A., Levashkin, S. (eds) GeoSpatial Semantics. GeoS 2007. Lecture Notes in Computer Science, vol 4853. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76876-0_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-76876-0_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76875-3
Online ISBN: 978-3-540-76876-0
eBook Packages: Computer ScienceComputer Science (R0)