A data model for trip planning in multimodal transportation systems

This paper introduces the problem of modeling urban transportation systems in a database where certain aspects of the data are probabilistic in nature. The transportation network is composed of multiple modes (e.g., automobile, bus, train, pedestrian) that the user can alternate between. A trip -- a path between an origin and destination subject to some constraints -- is the central concept. How these trips and the network can be represented as both a graph and relational model, as well as the requirements for querying are the main contributions of this paper. A set of operators are defined to work over these transportation concepts and they are integrated within a SQL-like syntax to express queries over the uncertain transportation network. Additionally, the paper shows how this model can be integrated within other moving objects and spatio-temporal data models, and how these graph-based queries can be processed.

[1]  Alberto O. Mendelzon,et al.  Visualizing queries and querying visualizations , 1992, SGMD.

[2]  Giovanni Storchi,et al.  Shortest viable path algorithm in multimodal networks , 2001 .

[3]  Markus Schneider,et al.  Spatio-Temporal Predicates , 2002, IEEE Trans. Knowl. Data Eng..

[4]  Alberto O. Mendelzon,et al.  A graphical query language supporting recursion , 1987, SIGMOD '87.

[5]  Rakesh Agrawal,et al.  Extending SQL with Generalized Transitive Closure Functionality , 1993, IEEE Trans. Knowl. Data Eng..

[6]  Maurizio Bielli,et al.  Object modeling and path computation for multimodal travel systems , 2006, Eur. J. Oper. Res..

[7]  H. V. Jagadish,et al.  Optimization of generalized transitive closure queries , 1991, [1991] Proceedings. Seventh International Conference on Data Engineering.

[8]  Nikos Pelekis,et al.  Literature review of spatio-temporal database models , 2004, The Knowledge Engineering Review.

[9]  A. Prasad Sistla,et al.  Querying the Uncertain Position of Moving Objects , 1997, Temporal Databases, Dagstuhl.

[10]  Tiziana Catarci,et al.  QBD*: A Graphical Query Language with Recursion , 1989, IEEE Trans. Software Eng..

[11]  Ralf Hartmut Güting,et al.  Modeling and querying moving objects in networks , 2006, The VLDB Journal.

[12]  Theodore S. Norvell,et al.  Aggregative closure: an extension of transitive closure , 1989, [1989] Proceedings. Fifth International Conference on Data Engineering.

[13]  Markus Schneider,et al.  A foundation for representing and querying moving objects , 2000, TODS.

[14]  Markus Schneider,et al.  STQL — A Spatio-Temporal Query Language , 2002 .

[15]  A. Prasad Sistla,et al.  Modeling and querying moving objects , 1997, Proceedings 13th International Conference on Data Engineering.

[16]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .