Planar separators and parallel polygon triangulation
Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
Optimal paths in graphs with stochastic or multidimensional weights
Communications of the ACM
On Reachability Under Uncertainty
SIAM Journal on Control and Optimization
IEEE Transactions on Knowledge and Data Engineering
Fast probabilistic algorithms for hamiltonian circuits and matchings
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Maintaining Sliding Window Skylines on Data Streams
IEEE Transactions on Knowledge and Data Engineering
Heuristic shortest path algorithms for transportation applications: state of the art
Computers and Operations Research
Stochastic shortest paths via Quasi-convex maximization
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Engineering highway hierarchies
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
A fast unified optimal route query evaluation algorithm
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Adaptive fastest path computation on a road network: a traffic mining approach
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Scalable network distance browsing in spatial databases
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Shortest paths in stochastic networks with correlated link costs
Computers & Mathematics with Applications
Highway hierarchies hasten exact shortest path queries
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Efficient discovery of frequent subgraph patterns in uncertain graph databases
Proceedings of the 14th International Conference on Extending Database Technology
Distance-constraint reachability computation in uncertain graphs
Proceedings of the VLDB Endowment
Traffic aware route planning in dynamic road networks
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part I
Efficient subgraph similarity search on large probabilistic graph databases
Proceedings of the VLDB Endowment
Mining frequent subgraphs over uncertain graph databases under probabilistic semantics
The VLDB Journal — The International Journal on Very Large Data Bases
Finding traffic-aware fastest paths in spatial networks
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
| Hi-index | 0.00 |
Path queries such as "finding the shortest path in travel time from my hotel to the airport" are heavily used in many applications of road networks. Currently, simple statistic aggregates such as the average travel time between two vertices are often used to answer path queries. However, such simple aggregates often cannot capture the uncertainty inherent in traffic. In this paper, we study how to take traffic uncertainty into account in answering path queries in road networks. To capture the uncertainty in traffic such as the travel time between two vertices, the weight of an edge is modeled as a random variable and is approximated by a set of samples. We propose three novel types of probabilistic path queries using basic probability principles: (1) a probabilistic path query like "what are the paths from my hotel to the airport whose travel time is at most 30 minutes with a probability of at least 90%?"; (2) a weight-threshold top-k path query like "what are the top-3 paths from my hotel to the airport with the highest probabilities to take at most 30 minutes?"; and (3) a probability-threshold top-k path query like "what are the top-3 shortest paths from my hotel to the airport whose travel time is guaranteed by a probability of at least 90%?" To evaluate probabilistic path queries efficiently, we develop three efficient probability calculation methods: an exact algorithm, a constant factor approximation method and a sampling based approach. Moreover, we devise the P* algorithm, a best-first search method based on a novel hierarchical partition tree index and three effective heuristic evaluation functions. An extensive empirical study using real road networks and synthetic data sets shows the effectiveness of the proposed path queries and the efficiency of the query evaluation methods.