Abstract
Path queries such as “find 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Hua, M., Pei, J. (2011). Probabilistic Path Queries on Road Networks. In: Ranking Queries on Uncertain Data. Advances in Database Systems, vol 42. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-9380-9_8
Download citation
DOI: https://doi.org/10.1007/978-1-4419-9380-9_8
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-9379-3
Online ISBN: 978-1-4419-9380-9
eBook Packages: Computer ScienceComputer Science (R0)