Skip to main content

Probabilistic Path Queries on Road Networks

  • Chapter
  • First Online:
  • 557 Accesses

Part of the book series: Advances in Database Systems ((ADBS,volume 42))

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ming Hua .

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics