Top-K Possible Shortest Path Query over a Large Uncertain Graph

  • Lei Zou
  • Peng Peng
  • Dongyan Zhao
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6997)


This paper studies the top-k possible shortest path (kSP) queries in a large uncertain graph, specifically, given two vertices S and T, a kSP query reports the top-k possible shortest paths from S to T. Different from existing solutions for uncertain graph problems, we adopt the possible worlds semantics. Although possible worlds semantics have been studied widely in relational databases, the graph structure leads to more complexity in computational model. The main contribution of this paper lies in developing lower and upper bounds for the probability that one path is the shortest path in an uncertain graph, based on which, a filter-and-refine framework is proposed to answer kSP queries. We demonstrate the superiority of our method by extensive experiments.


Short Path Monte Carlo Common Edge Path Query World Semantic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Samet, H., Sankaranarayanan, J., Alborzi, H.: Scalable network distance browsing in spatial databases. In: SIGMOD Conference (2008)Google Scholar
  2. 2.
    Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. SIAM J. Comput. 32(5) (2003)Google Scholar
  3. 3.
    Chan, E.P.F., Lim, H.: Optimization and evaluation of shortest path queries. VLDB J 16(3), 343–369 (2007)CrossRefGoogle Scholar
  4. 4.
    Jing, N., Huang, Y.-W., Rundensteiner, E.A.: Hierarchical encoded path views for path query processing: An optimal model and its performance evaluation. IEEE Trans. Knowl. Data Eng. 10(3) (1998)Google Scholar
  5. 5.
    Suchanek, F.M., Kasneci, G., Weikum, G.: Yago: a core of semantic knowledge. In: WWW (2007)Google Scholar
  6. 6.
    Kasneci, G., Suchanek, F.M., Ifrim, G., Ramanath, M., Weikum, G.: Naga: Searching and ranking knowledge. In: ICDE (2008)Google Scholar
  7. 7.
    Frank, H.: Shortest paths in probabilistic graphs. Operations Research 17 (1969)Google Scholar
  8. 8.
    Soliman, M.A., Ilyas, I.F., Chang, K.C.-C.: Top-k query processing in uncertain databases. In: ICDE (2007)Google Scholar
  9. 9.
    Sigal, C.E., Pritsker, A.A.B., Solberg, J.J.Google Scholar
  10. 10.
    Hua, M., Pei, J.: Probabilistic path queries in road networks: traffic uncertainty aware path selection. In: EDBT (2010)Google Scholar
  11. 11.
  12. 12.
    Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to algorithms. The MIT Press, Cambridge (2001)zbMATHGoogle Scholar
  13. 13.
    Karp, R.M., Luby, M.: Monte-carlo algorithms for enumeration and reliability problems. In: FOCS (1983)Google Scholar
  14. 14.
    Yuan, Y., Chen, L., Wang, G.: Efficiently answering probability threshold-based shortest path queries over uncertain graphs. In: Kitagawa, H., Ishikawa, Y., Li, Q., Watanabe, C. (eds.) DASFAA 2010. LNCS, vol. 5981, pp. 155–170. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  15. 15.
    Albert, R., Barabási, A.-L.: Statistical mechanics of complex networks. Reviews of Mordern Physics 74, 47–97 (2002)MathSciNetzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Lei Zou
    • 1
  • Peng Peng
    • 1
  • Dongyan Zhao
    • 1
  1. 1.Peking UniversityBeijingChina

Personalised recommendations