TransDec: A Data-Driven Framework for Decision-Making in Transportation Systems

In this paper, we present an end-to-end data-driven system, dubbed TransDec (short for Transportation Decision-Making), to enable decision-making queries in transportation systems with dynamic, real-time and historical data. With TransDec, we particularly address the challenges in visualization, monitoring, querying and analysis of dynamic and large-scale spatiotemporal transportation data. TransDec fuses a variety of transportation related real-world spatiotemporal datasets including massive traffic sensor data, trajectory data, transportation network data, and points-of-interest data to create an immersive and realistic virtual model of a transportation system. Atop such a virtual system, TransDec allows for processing a wide range of customized spatiotemporal queries efficiently and interactively. TransDec has a three-tier architecture, including a multimodal spatiotemporal database, an expressive and efficient query-engine and an interactive map-mashup presentation tier. With this paper, first we describe the components of the TransDec architecture. Subsequently, as proof-of-concept we present a number of decision-making queries enabled by TransDec.

[1]  Cyrus Shahabi,et al.  The spatial skyline queries , 2006, VLDB.

[2]  Martin Skutella,et al.  Time-Expanded Graphs for Flow-Dependent Transit Times , 2002, ESA.

[3]  Subhash Suri,et al.  On the Complexity of Time-Dependent Shortest Paths , 2011, Algorithmica.

[4]  Jonathan Halpern,et al.  Shortest route with time dependent length of edges and limited delay possibilities in nodes , 1977, Math. Methods Oper. Res..

[5]  Farnoush Banaei Kashani,et al.  Towards modeling the traffic data on road networks , 2009, IWCTS '09.

[6]  Stuart E. Dreyfus,et al.  An Appraisal of Some Shortest-Path Algorithms , 1969, Oper. Res..

[7]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[8]  Cyrus Shahabi,et al.  A Road Network Embedding Technique for K-Nearest Neighbor Search in Moving Object Databases , 2003, GeoInformatica.

[9]  Cyrus Shahabi,et al.  ProPolyne: A Fast Wavelet-Based Algorithm for Progressive Evaluation of Polynomial Range-Sum Queries , 2002, EDBT.

[10]  K. Cooke,et al.  The shortest route through a network with time-dependent internodal transit times , 1966 .

[11]  Cyrus Shahabi,et al.  A Road Network Embedding Technique for K-Nearest Neighbor Search in Moving Object Databases , 2002, GIS '02.

[12]  Cyrus Shahabi,et al.  WOLAP : Wavelet-Based Range Aggregate Query Processing , 2007 .

[13]  Cyrus Shahabi,et al.  How to evaluate multiple range-sum queries progressively , 2002, PODS '02.

[14]  Shashi Shekhar,et al.  Spatio-temporal Network Databases and Routing Algorithms: A Summary of Results , 2007, SSTD.

[15]  Farnoush Banaei Kashani,et al.  Efficient K-Nearest Neighbor Search in Time-Dependent Spatial Networks , 2010, DEXA.

[16]  C. Shahabi,et al.  Wavelet Disk Placement for E � cient Querying of Large Multidimensional Data Sets , 2003 .

[17]  Richard E. Korf,et al.  Real-Time Heuristic Search , 1990, Artif. Intell..

[18]  Cyrus Shahabi,et al.  A Multi-Resolution Compression Scheme for EfficientWindow Queries over Road Network Databases , 2006, Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06).

[19]  Cyrus Shahabi,et al.  Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases , 2004, VLDB.

[20]  Kyriakos Mouratidis,et al.  Continuous nearest neighbor monitoring in road networks , 2006, VLDB.

[21]  Jörg-Rüdiger Sack,et al.  Shortest paths in time-dependent FIFO networks using edge load forecasts , 2009, IWCTS '09.

[22]  Josef Stoer,et al.  Numerische Mathematik 1 , 1989 .

[23]  Hanan Samet,et al.  Scalable network distance browsing in spatial databases , 2008, SIGMOD Conference.

[24]  Jörg-Rüdiger Sack,et al.  Shortest Paths in Time-Dependent FIFO Networks , 2010, Algorithmica.

[25]  Ariel Orda,et al.  Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length , 1990, JACM.

[26]  Dimitris Sacharidis,et al.  SHIFT-SPLIT: I/O efficient maintenance of wavelet-transformed multidimensional data , 2005, SIGMOD '05.

[27]  Hua Lu,et al.  S-GRID: A Versatile Approach to Efficient Query Processing in Spatial Networks , 2007, SSTD.

[28]  Antonin Guttman,et al.  R-trees: a dynamic index structure for spatial searching , 1984, SIGMOD '84.

[29]  Yufei Tao,et al.  Query Processing in Spatial Network Databases , 2003, VLDB.