Abstract
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.
This work was supported by NSFC under Grant No.61003009 and RFDP under Grant No. 20100001120029.
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.
Similar content being viewed by others
References
Samet, H., Sankaranarayanan, J., Alborzi, H.: Scalable network distance browsing in spatial databases. In: SIGMOD Conference (2008)
Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. SIAM J. Comput. 32(5) (2003)
Chan, E.P.F., Lim, H.: Optimization and evaluation of shortest path queries. VLDB J 16(3), 343–369 (2007)
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)
Suchanek, F.M., Kasneci, G., Weikum, G.: Yago: a core of semantic knowledge. In: WWW (2007)
Kasneci, G., Suchanek, F.M., Ifrim, G., Ramanath, M., Weikum, G.: Naga: Searching and ranking knowledge. In: ICDE (2008)
Frank, H.: Shortest paths in probabilistic graphs. Operations Research 17 (1969)
Soliman, M.A., Ilyas, I.F., Chang, K.C.-C.: Top-k query processing in uncertain databases. In: ICDE (2007)
Sigal, C.E., Pritsker, A.A.B., Solberg, J.J.
Hua, M., Pei, J.: Probabilistic path queries in road networks: traffic uncertainty aware path selection. In: EDBT (2010)
Yen, J.Y.
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to algorithms. The MIT Press, Cambridge (2001)
Karp, R.M., Luby, M.: Monte-carlo algorithms for enumeration and reliability problems. In: FOCS (1983)
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)
Albert, R., Barabási, A.-L.: Statistical mechanics of complex networks. Reviews of Mordern Physics 74, 47–97 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zou, L., Peng, P., Zhao, D. (2011). Top-K Possible Shortest Path Query over a Large Uncertain Graph. In: Bouguettaya, A., Hauswirth, M., Liu, L. (eds) Web Information System Engineering – WISE 2011. WISE 2011. Lecture Notes in Computer Science, vol 6997. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24434-6_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-24434-6_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24433-9
Online ISBN: 978-3-642-24434-6
eBook Packages: Computer ScienceComputer Science (R0)