TY - GEN
T1 - Modeling spatio-temporal network computations
T2 - 2nd International Conference on Geospatial Semantics, GeoS 2007
AU - George, Betsy
AU - Shekhar, Shashi
PY - 2007
Y1 - 2007
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=38349050304&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=38349050304&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-76876-0_12
DO - 10.1007/978-3-540-76876-0_12
M3 - Conference contribution
AN - SCOPUS:38349050304
SN - 9783540768753
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 177
EP - 194
BT - GeoSpatial Semantics - Second International Conference, GeoS 2007, Proceedings
PB - Springer Verlag
Y2 - 29 November 2007 through 30 November 2007
ER -