Abstract
Graph has become a widely used structure to model data. Unfortunately, data are inherently with uncertainty because of the occurrence of noise and incompleteness in data collection. This is why uncertain graphs catch much attention of researchers. However, the uncertain graph models in existing works assume all edges in a graph are independent of each other, which dose not really make sense in real applications. Thus, we propose a new model for uncertain graphs considering the correlation among edges sharing the same vertex. Moreover, in this paper, we mainly solve the shortest path query, which is a funduemental but important query on graphs, using our new model. As the problem of calculating shortest path probability over correlated uncertain graphs is #P-hard, we propose different kinds of sampling methods to efficiently compute an approximate answer. The error is very small in our algorithm, which is proved and further verified in our experiments.
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
Adar, E., Ré, C.: Managing uncertainty in social networks. IEEE Data Eng. Bull. 30(2), 15–22 (2007)
Asthana, S., King, O.D., Gibbons, F.D., Roth, F.P.: Predicting protein complex membership using probabilistic network reliability. Genome Research 14(6), 1170–1175 (2004)
Bast, H., Funke, S., Matijevic, D.: Transitultrafast shortest-path queries with linear-time preprocessing. In: 9th DIMACS Implementation Challenge [1] (2006)
Cheng, J., Ke, Y., Chu, S., Cheng, C.: Efficient processing of distance queries in large graphs: A vertex cover approach. In: SIGMOD, pp. 457–468. ACM (2012)
Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. SIAM Journal on Comp 32(5), 1338–1355 (2003)
Fishman, G.S.: A monte carlo sampling plan based on product form estimation. In: Proceedings of the 23rd Conference on Winter Simulation, pp. 1012–1017. IEEE Computer Society (1991)
Fu, L., Sun, D., Rilett, L.R.: Heuristic shortest path algorithms for transportation applications: State of the art. Computers & Operations Research 33(11), 3324–3343 (2006)
Gao, J., Jin, R., Zhou, J., Yu, J.X., Jiang, X., Wang, T.: Relational approach for shortest path discovery over large graphs. PVLDB 5(4), 358–369 (2011)
Gubichev, A., Bedathur, S., Seufert, S., Weikum, G.: Fast and accurate estimation of shortest paths in large graphs. In: CIKM, pp. 499–508. ACM (2010)
Hua, M., Pei, J.: Probabilistic path queries in road networks: Traffic uncertainty aware path selection. In: EDBT, pp. 347–358. ACM (2010)
Jin, R., Liu, L., Ding, B., Wang, H.: Distance-constraint reachability computation in uncertain graphs. PVLDB 4(9), 551–562 (2011)
Jin, R., Ruan, N., Xiang, Y., Lee, V.: A highway-centric labeling approach for answering distance queries on large sparse graphs. In: SIGMOD, pp. 445–456. ACM (2012)
Jing, N., Huang, Y.W., Rundensteiner, E.A.: Hierarchical encoded path views for path query processing: An optimal model and its performance evaluation. TKDE 10(3), 409–432 (1998)
Thompson, S.K.: Sampling the Third Edition. Wiley Series In Probability And Statistics. Wiley (2012)
Lian, X., Chen, L.: Efficient query answering in probabilistic rdf graphs. In: SIGMOD, pp. 157–168. ACM (2011)
Loui, R.P.: Optimal paths in graphs with stochastic or multidimensional weights. CACM 26(9), 670–676 (1983)
Nierman, A., Jagadish, H.: Protdb: Probabilistic data in xml. In: Proceedings of the 28th International Conference on Very Large Data Bases, pp. 646–657. VLDB Endowment (2002)
Rice, M., Tsotras, V.J.: Graph indexing of road networks for shortest path queries with label restrictions. PVLDB 4(2), 69–80 (2010)
Samet, H., Sankaranarayanan, J., Alborzi, H.: Scalable network distance browsing in spatial databases. In: SIGMOD, pp. 43–54. ACM (2008)
Sankaranarayanan, J., Samet, H., Alborzi, H.: Path oracles for spatial networks. PVLDB 2(1), 1210–1221 (2009)
Tong, Y., Chen, L., Cheng, Y., Yu, P.S.: Mining frequent itemsets over uncertain databases. PVLDB 5(11), 1650–1661 (2012)
Tong, Y., Chen, L., Ding, B.: Discovering threshold-based frequent closed itemsets over probabilistic data. In: ICDE, pp. 270–281. IEEE (2012)
Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM Journal on Comp. 8(3), 410–421 (1979)
Wei, F.: Tedi: Efficient shortest path query answering on graphs. In: Proceedings of SIGMOD, pp. 99–110. ACM (2010)
Wu, L., Xiao, X., Deng, D., Cong, G., Zhu, A.D., Zhou, S.: Shortest path and distance queries on road networks: an experimental evaluation. PVLDB 5(5), 406–417 (2012)
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)
Yuan, Y., Wang, G., Chen, L., Wang, H.: Efficient keyword search on uncertain graph data. IEEE Transactions on Knowledge and Data Engineering 25(12), 2767–2779 (2013)
Yuan, Y., Wang, G., Wang, H., Chen, L.: Efficient subgraph search over large uncertain graphs. In: International Conference on Very Large Data Bases (2011)
Zhang, Z., Yu, J.X., Qin, L., Chang, L., Lin, X.: I/o efficient: Computing sccs in massive graphs. In: Proceedings of the 2013 International Conference on Management of Data, pp. 181–192. ACM (2013)
Zou, L., Peng, P., Zhao, D.: Top-k possible shortest path query over a large uncertain graph. In: Bouguettaya, A., Hauswirth, M., Liu, L. (eds.) WISE 2011. LNCS, vol. 6997, pp. 72–86. Springer, Heidelberg (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Cheng, Y., Yuan, Y., Wang, G., Qiao, B., Wang, Z. (2014). Efficient Sampling Methods for Shortest Path Query over Uncertain Graphs. In: Bhowmick, S.S., Dyreson, C.E., Jensen, C.S., Lee, M.L., Muliantara, A., Thalheim, B. (eds) Database Systems for Advanced Applications. DASFAA 2014. Lecture Notes in Computer Science, vol 8422. Springer, Cham. https://doi.org/10.1007/978-3-319-05813-9_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-05813-9_9
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-05812-2
Online ISBN: 978-3-319-05813-9
eBook Packages: Computer ScienceComputer Science (R0)