Distance-constraint reachability computation in uncertain graphs

Proceedings of the VLDB Endowment

Volumn 4, Issue 9, 2011, Pages 551-562

  Jin, Ruoming ^a   Liu, Lin ^a   Ding, Bolin ^b   Wang, Haixun ^c  

^a KENT STATE UNIVERSITY   (United States)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^c MICROSOFT RESEARCH ASIA   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL PROCEDURES; COMPUTATIONALLY EFFICIENT; DISTANCE CONSTRAINTS; NETWORK APPLICATIONS; PROBABILISTIC SAMPLING; SAMPLING PROCESS; SYNTHETIC DATASETS; UNCERTAIN GRAPHS;

EID: 80052652443     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/2002938.2002941     Document Type: Article

References (25)

1. C. C. Aggarwal, editor. Managing and Mining Uncertain Data. Advances in Database Systems. Springer, 2009.
2. M. O. Ball. Computational complexity of network reliability analysis: An overview. IEEE Transactions on Reliability, 35:230-239, 1986.
3. A. L. Barabasi and R. Albert. Emergence of scaling in random networks. Science, 286(5439):509-512, 1999.
4. I. Clarke, O. Sandberg, B. Wiley, and T. W. Hong. Freenet: a distributed anonymous information storage and retrieval system. In International workshop on Designing privacy enhancing technologies: design issues in anonymity and unobservability, pages 46-66, 2001.
5. C. J. Colbourn. The Combinatorics of Network Reliability. Oxford University Press, Inc., 1987.
6. G. S. Fishman. A comparison of four monte carlo methods for estimating the probability of s-t connectedness. IEEE Transactions on Reliability, 35(2):145-155, 1986.
7. M. Hua and J. Pei. Probabilistic path queries in road networks: traffic uncertainty aware path selection. In EDBT, pages 347-358, 2010.
8. R. Jin, Y. Xiang, N. Ruan, and D. Fuhry. 3-hop: a high-compression indexing scheme for reachability query. In SIGMOD Conference, pages 813-826, 2009.
9. R. M. Karp and M. G. Luby. A new monte-carlo method for estimating the failure probability of an n-component system. Technical report, Berkeley, CA, USA, 1983.
10. H. Kumamoto, K. Tanaka, I. Koichi, and H. E. J. Dagger-samplingmonte carlo for system unavailability evaluation. IEEE Transactions on Reliability, 29(2):122-125.
11. G. Pandurangan, P. Raghavan, and E. Upfal. Building low-diameter p2p networks. In FOCS, pages 492-499, 2001.
12. L. Petingi. Combinatorial and computational properties of a diameter constrained network reliability model. In Proceedings of the WSEAS International Conference on Applied Computing Conference, ACC'08, 2008.
13. M. Potamias, F. Bonchi, A. Gionis, and G. Kollios. k-nearest neighbors in uncertain graphs. PVLDB, 3(1):997-1008, 2010.
14. G. Rubino. Network reliability evaluation, pages 275-302. Gordon and Breach Science Publishers, Inc., Newark, NJ, USA, 1999.
15. S. J. Russell and P. Norvig. Artificial Intelligence: A Modern Approach. Pearson Education, 2003.
16. A. Satyanarayana and R. K. Wood. A linear-time algorithm for computing k-terminal reliability in series-parallel networks. SIAM Journal on Computing, 14(4):818-832, 1985.
17. G. Swamynathan, C. Wilson, B. Boe, K. Almeroth, and B. Y. Zhao. Do social networks improve e-commerce?: a study on social marketplaces. In WOSP '08.
18. S. Thompson. Sampling, Second Edition. New York: Wiley., 2002.
19. http://mips.helmholtz-muenchen.de/genre/proj/mpact/.
20. http://thebiogrid.org/.
21. L. G. Valiant. The complexity of enumeration and reliability problems. SIAM Journal on Computing, 8(3):410-421, 1979.
22. H. Yildirim, V. Chaoji, and M. J. Zaki. Grail: Scalable reachability index for large graphs. PVLDB, 3(1):276-284, 2010.
23. Y. Yuan, L. Chen, and G. Wang. Efficiently answering probability threshold-based shortest path queries over uncertain graphs. In DASFAA (1)'10, pages 155-170, 2010.
24. Z. Zou, H. Gao, and J. Li. Discovering frequent subgraphs over uncertain graph databases under probabilistic semantics. KDD '10, pages 633-642, 2010.
25. Z. Zou, J. Li, H. Gao, and S. Zhang. Finding top-k maximal cliques in an uncertain graph. In ICDE, pages 649-652, 2010.