Efficiently answering probability threshold-based sp queries over uncertain graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5981 LNCS, Issue PART 1, 2010, Pages 155-170

  Yuan, Ye ^a   Chen, Lei ^b   Wang, Guoren ^a  

^a NORTHEASTERN UNIVERSITY   (China)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION NETWORKS; EDGE WEIGHTS; EFFICIENT METHOD; INTELLIGENT TRANSPORTATION SYSTEMS; INTERNAL STRUCTURE; MULTI OBJECTIVE; PATH QUERIES; POSSIBLE WORLD SEMANTICS; PROBABILISTIC DATA; PROBABILISTIC MODELS; PROBABILITY THRESHOLD; REAL DATA SETS; REAL-WORLD APPLICATION; SHORTEST PATH; STOCHASTIC NETWORKS; WEIGHTED GRAPH;

DATABASE SYSTEMS; GRAPH THEORY; INDUSTRIAL RESEARCH; INTELLIGENT SYSTEMS; RANDOM VARIABLES; SEMANTICS;

REAL VARIABLES;

EID: 78650488240     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-12026-8_14     Document Type: Conference Paper

References (27)

1. Suciu, D., Dalvi, N.N.: Foundations of probabilistic answers to queries. In: SIGMOD Conference (2005)
2. Dalvi, N.N., Suciu, D.: Management of probabilistic data: foundations and challenges. In: ACM PODS (2007)
3. Khoussainova, N., Balazinska, M., Suciu, D.: Towards correcting input data errors probabilistically using integrity constraints. In: ACM MobiDE Workshop (2006)
4. 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)
5. Cormode, G., Garofalakis, M.: Sketching probabilistic data streams. In: ACM SIGMOD (2007)
6. Korzan, B.: Method of determining compromise paths in unreliable directed graphs. Bulletin of the Military University of Technology, Warsaw (1982)
7. Korzan, B.: Method of determining nondominated paths in unreliable directed graphs. Bulletin of the Military University of Technology, Warsaw (1983)
8. Sigal, C.E., Pritsker, A.A.B., Solberg, J.J.: The stochastic shortest route problem. Oper. Res. 28(5) (1980)
9. Cormode, G., McGregor, A.: Approximation algorithms for clustering uncertain data. In: ACM PODS (2008)
10. Zhang, Q., Li, F., Yi, K.: Finding frequent items in probabilistic data. In: ACM SIGMOD (2008)
11. Guerin, R.A., Orda, A.: QoS routing in networks with inaccurate information: Theory and algorithms. IEEE/ACM. Trans. (1999)
12. Lorenz, D.H., Orda, A.: QoS routing in networks with uncertain parameters. TON (1998)
13. Chen, S., Nahrstedt, K.: Distributed QoS routing in ad-hoc networks. In: IEEE JSAC (August 1999)
14. Fu, L., Rilett, L.R.: Expected shortest paths in dynamic and stochastic traffic networks. Transportation Research - part B (1998)
15. 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)
16. Papadimitriou, C.H., Yannakakis, M.: Shortest paths without a map. Theoretical Computer Science (1991)
17. Chabini, I.: Algorithms for k-shortest paths and other routing problems in time-dependent networks. Transportation Research Part B: Methodological (2002)
18. 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)
19. Valiant, L.G.: The Complexity of enumeration and reliability prblems. SIAM JL of Computing (August 1979)
20. Kerbache, L., Smith, J.: Multi-objective routing within large scale facilities using open finite queueing networks. Europ. J. Oper. Res. (2000)
21. 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)
22. Ljosa, V., Singh, A.K.: APLA: indexing arbitrary probability distributions. In: Proc. of ICDE (2007)
23. Soliman, M.A., Ilyas, I.F., Chang, K.C.: Top-k query processing in uncertain databases. In: Proc. of ICDE (2007)
24. Re, C., Dalvi, N., Suciu, D.: Efficient top-k query evaluation on probabilistic data. In: Proc. of ICDE (2007)
25. Cheng, R., Xia, Y., et al.: Efficient indexing methods for probabilistic threshold queries over uncertain data. In: Proc. VLDB (2004)
26. 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)
27. Pei, J., Jiang, B., Lin, X., Yuan, Y.: Probabilistic skylines on uncertain data. In: Proc. of VLDB (2007)