Abstract
Today's one-size-fits-all approach to travel-time computation in spatial networks proceeds in two steps. In a preparatory off-line step, a set of distributions, e.g., one per hour of the day, is computed for each network segment. Then, when a path and a departure time are provided, a distribution for the path is computed on-line from pertinent pre-computed distributions. Motivated by the availability of massive trajectory data from vehicles, we propose a completely on-line approach, where distributions are computed from trajectories on-the-fly, i.e., when a query arrives. This new approach makes it possible to use arbitrary sets of underlying trajectories for a query. Specifically, we study the potential for accuracy improvements over the one-size-fits-all approach that can be obtained using the on-the-fly approach and report findings from an empirical study that suggest that the on-the-fly approach is able to improve accuracy significantly and has the potential to replace the current one-size-fits-all approach.
Original language | English |
---|---|
Title of host publication | Proceedings - 18th IEEE International Conference on Mobile Data Management, MDM 2017 |
Number of pages | 6 |
Publisher | IEEE (Institute of Electrical and Electronics Engineers) |
Publication date | 29 Jun 2017 |
Pages | 240-245 |
Article number | 7962458 |
ISBN (Electronic) | 9781538639320 |
DOIs | |
Publication status | Published - 29 Jun 2017 |
Event | 18th IEEE International Conference on Mobile Data Management, MDM 2017 - Daejeon, Korea, Republic of Duration: 29 May 2017 → 1 Jun 2017 |
Conference
Conference | 18th IEEE International Conference on Mobile Data Management, MDM 2017 |
---|---|
Country/Territory | Korea, Republic of |
City | Daejeon |
Period | 29/05/2017 → 01/06/2017 |
Sponsor | Daejeon International Marketing Enterprise, Daejeon Metropolitan City, IEEE, IEEE Technical Committee on Data Engineering (TCDE), Korea Advanced Institute of Science and Technology (KAIST) School of Computing |