Abstract
Efficiently processing shortest path (SP) queries over stochastic networks attracted a lot of research attention as such queries are very popular in the emerging real world applications such as Intelligent Transportation Systems and communication networks whose edge weights can be modeled as a random variable. Some pervious works aim at finding the most likely SP (the path with largest probability to be SP), and others search the least-expected-weight path. In all these works, the definitions of the shortest path query are based on simple probabilistic models which can be converted into the multi-objective optimal issues on a weighted graph. However, these simple definitions miss important information about the internal structure of the probabilistic paths and the interplay among all the uncertain paths. Thus, in this paper, we propose a new SP definition based on the possible world semantics that has been widely adopted for probabilistic data management, and develop efficient methods to find threshold-based SP path queries over an uncertain graph. Extensive experiments based on real data sets verified the effectiveness of the proposed methods.
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
Suciu, D., Dalvi, N.N.: Foundations of probabilistic answers to queries. In: SIGMOD Conference (2005)
Dalvi, N.N., Suciu, D.: Management of probabilistic data: foundations and challenges. In: ACM PODS (2007)
Khoussainova, N., Balazinska, M., Suciu, D.: Towards correcting input data errors probabilistically using integrity constraints. In: ACM MobiDE Workshop (2006)
Benjelloun, O., Sarma, A.D., Hayworth, C., Widomn, J.: An introduction to ULDBs and the Trio system. IEEE Data Engineering Bulletin 29(1), 5–16 (2006)
Cormode, G., Garofalakis, M.: Sketching probabilistic data streams. In: ACM SIGMOD (2007)
Korzan, B.: Method of determining compromise paths in unreliable directed graphs. Bulletin of the Military University of Technology, Warsaw (1982)
Korzan, B.: Method of determining nondominated paths in unreliable directed graphs. Bulletin of the Military University of Technology, Warsaw (1983)
Sigal, C.E., Pritsker, A.A.B., Solberg, J.J.: The stochastic shortest route problem. Oper. Res. 28(5) (1980)
Cormode, G., McGregor, A.: Approximation algorithms for clustering uncertain data. In: ACM PODS (2008)
Zhang, Q., Li, F., Yi, K.: Finding frequent items in probabilistic data. In: ACM SIGMOD (2008)
Guerin, R.A., Orda, A.: QoS routing in networks with inaccurate information: Theory and algorithms. IEEE/ACM. Trans. (1999)
Lorenz, D.H., Orda, A.: QoS routing in networks with uncertain parameters. TON (1998)
Chen, S., Nahrstedt, K.: Distributed QoS routing in ad-hoc networks. In: IEEE JSAC (August 1999)
Fu, L., Rilett, L.R.: Expected shortest paths in dynamic and stochastic traffic networks. Transportation Research - part B (1998)
Turner, S.M., Brydia Robert, E., Liu, J.C.: ITS Data Management System: Year One Activities, Report No. FHWA/TX-98/1752-2. Texas Department of Transportation, Texas Transportation Institute (September 1997)
Papadimitriou, C.H., Yannakakis, M.: Shortest paths without a map. Theoretical Computer Science (1991)
Chabini, I.: Algorithms for k-shortest paths and other routing problems in time-dependent networks. Transportation Research Part B: Methodological (2002)
Silva, R., Craveirinha, J.: An Overview of routing models for MPLS Networks. In: Proc. of 1st Workshop on Multicriteria Modelling in Telecommunication Network Planning and Design (2004)
Valiant, L.G.: The Complexity of enumeration and reliability prblems. SIAM JL of Computing (August 1979)
Kerbache, L., Smith, J.: Multi-objective routing within large scale facilities using open finite queueing networks. Europ. J. Oper. Res. (2000)
Hershberger, J., Suri, S., Bhosle, A.: On the difficulty of some shortest path problems. In: Proc. of Sympos. Theoret. Aspects Comput. Sci. LNCS. Springer, Heidelberg (2003)
Ljosa, V., Singh, A.K.: APLA: indexing arbitrary probability distributions. In: Proc. of ICDE (2007)
Soliman, M.A., Ilyas, I.F., Chang, K.C.: Top-k query processing in uncertain databases. In: Proc. of ICDE (2007)
Re, C., Dalvi, N., Suciu, D.: Efficient top-k query evaluation on probabilistic data. In: Proc. of ICDE (2007)
Cheng, R., Xia, Y., et al.: Efficient indexing methods for probabilistic threshold queries over uncertain data. In: Proc. VLDB (2004)
Kriegel, H.P., Kunath, P., Renz, M.: Probabilistic nearest-neighbor query on uncertain objects. In: Kotagiri, R., Radha Krishna, P., Mohania, M., Nantajeewarawat, E. (eds.) DASFAA 2007. LNCS, vol. 4443, pp. 337–348. Springer, Heidelberg (2007)
Pei, J., Jiang, B., Lin, X., Yuan, Y.: Probabilistic skylines on uncertain data. In: Proc. of VLDB (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yuan, Y., Chen, L., Wang, G. (2010). Efficiently Answering Probability Threshold-Based Shortest Path Queries over Uncertain Graphs. In: Kitagawa, H., Ishikawa, Y., Li, Q., Watanabe, C. (eds) Database Systems for Advanced Applications. DASFAA 2010. Lecture Notes in Computer Science, vol 5981. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12026-8_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-12026-8_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12025-1
Online ISBN: 978-3-642-12026-8
eBook Packages: Computer ScienceComputer Science (R0)