Efficient subgraph similarity search on large probabilistic graph databases

Proceedings of the VLDB Endowment

Volumn 5, Issue 9, 2012, Pages 800-811

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

^a NORTHEASTERN UNIVERSITY   (China)

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

^c MICROSOFT RESEARCH ASIA   (China)

Author keywords

[No Author keywords available]

Indexed keywords

DATA INTEGRATION; DATA PRIVACY; GRAPHIC METHODS; MATRIX ALGEBRA;

EFFICIENT SAMPLING; LOWER AND UPPER BOUNDS; PRIVACY PRESERVING; PROBABILISTIC GRAPHS; RESOURCE DESCRIPTION FRAMEWORK; SIMILARITY SEARCH; SUBGRAPH ISOMORPHISM; UNCERTAIN GRAPHS;

INFORMATION MANAGEMENT;

EID: 84863773270     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/2311906.2311908     Document Type: Article

References (43)

1. D. J. Abadi, A. Marcus, S. R. Madden, and K. Hollenbach. Scalable semantic web data management using vertical partitioning. In Proc. of VLDB, pages 411-422, 2007.
2. E. Adar and C. Re. Managing uncertainty in social networks. IEEE Data Eng. Bull., 30(2):15-22, 2007.
3. C. Aggarwal. Managing and mining uncertain data. Springer, 2009.
4. C. Aggarwal and H. Wang. Managing and mining graph data. Springer, 2010.
5. S. Asthana, O. King, F. Gibbons, and F. Roth. Predicting protein complex membership using probabilistic network reliability. Genome Research, 14(6):1170-1175, 2004.
6. J. S. Bader, A. Chaudhuri, J. M. Rothberg, and J. Chant. Gaining confidence in high-throughput protein interaction networks. Nature Biotechnology, 22(1):78-85, 2003.
7. E. Balas and J. Xue. Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring. Algorithmica, 15:397-412, 1996.
8. S. Biswas and R. Morris. Exor: opportunistic multi-hop routing for wireless networks. In Proc. of SIGCOMM, pages 133-144, 2005.
9. H. Chui, W.-K. Sung, and L. Wong. Exploiting indirect neighbours and topological weight to predict protein function from protein-rotein interactions. Bioinformatics, 22(13):47-58, 2007.
10. L. P. Cordellaand, P. Foggia, and C. Sansone. A (sub)graph isomorphism algorithm for matching large graphs. IEEE Trans. Pattern Anal. Mach. Intell., 38(10):1367-1372, 2004.
11. N. N. Dalvi and D. Suciu. Management of probabilistic data: foundations and challenges. In Proc. of PODS, pages 1-12, 2007.
12. D. H. (ed.). Approximation algorithms for NP-Hard problems. PWS, 1997.
13. M. R. Garey and D. S. Johnson. Computers and intractability: a guide to the theory of NP-completeness. W.H.Freeman, 1979.
14. R. Guha, R. Kumar, and A. Tomkins. Propagation of trust and distrust. In Proc. of WWW, pages 403-412, 2004.
15. H. He and A. K. Singh. Closure-tree: an index structure for graph queries. In Proc. of ICDE, pages 27-38, 2006.
16. M. Hua and J. Pei. Probabilistic path queries in road networks: traffic uncertainty aware path selection. In Proc. of EDBT, pages 347-358, 2010.
17. C. Huang and A. Darwiche. Inference in belief networks: a procedural guide. International Journal of Approximate Reasoning, 15(3):225-263, 1996.
18. H. Huang and C. Liu. Query evaluation on probabilistic rdf databases. In Proc. of WISE, pages 307-320, 2009.
19. H. Jiang, H. Wang, P. S. Yu, and S. Zhou. Gstring: a novel approach for efficient search in graph databases. In Proc. of ICDE, pages 566-575, 2007.
20. R. Jiang, Z. Tu, T. Chen, and F. Sun. Network motif identification in stochastic networks. PNAS, 103(25):9404-9409, 2006.
21. R. Jin, L. Liu, B. Ding, and H. Wang. Distance-constraint reachability computation in uncertain graphs. In Proc. of VLDB, pages 551-562, 2011.
22. A. V. Karzanov and E. A. Timofeev. Efficient algorithm for finding all minimal edge cuts of a nonoriented graph. Cybernetics and Systems Analysis, 22(2):156-162, 1986.
23. M. Kozlov, S. Tarasov, and L. Hacijan. Polynomial solvability of convex quadratic programming. Mathematics Doklady, 20:1108-1111, 1979.
24. L.Chen and X. Lian. Efficient query answering in probabilistic rdf graphs. In Proc. of SIGMOD, pages 157-168, 2011.
25. D. Liben-Nowell and J. Kleinberg. The link prediction problem for social networks. In Proc. of CIKM, pages 556-569, 2003.
26. M. Mitzenmacher and E. Upfal. Probability and Computing: Randomized algorithms and probabilistic analysis. Cambridge University Press, 2005.
27. M. Potamias, F. Bonchi, A. Gionis, and G. Kollios. k-nearest neighbors in uncertain graphs. In Proc. of VLDB, pages 997-1008, 2010.
28. S. Rintaro, S. Harukazu, and H. Yoshihide. Interaction generality: a measurement to assess the reliability of a protein-protein interaction. Nucleic Acids Research, 30(5):1163-1168, 2002.
29. H. Shang, Y. Zhang, X. Lin, and J. X. Yu. Taming verification hardness: an efficient algorithm for testing subgraph isomorphism. In Proc. of VLDB, pages 364-375, 2008.
30. H. Shang, K. Zhu, X. Lin, Y. Zhang, and R. Ichise. Similarity search on supergraph containment. In Proc. of ICDE, pages 637-648, 2010.
31. D. Suciu and N. N. Dalvi. Foundations of probabilistic answers to queries. In Proc. of SIGMOD, page 963, 2005.
32. Z. Sun, H. Wang, B. Shao, H. Wang, and J. Li. Efficient subgraph matching on billion node graphs. In PVLDB, 2012.
33. S. Suthram, T. Shlomi, E. Ruppin, R. Sharan, and T. Ideker. A direct comparison of protein interaction confidence assignment schemes. Bioinformatics, 7(1):360, 2006.
34. X. Wang, X. Ding, A. K. H. Tung, S. Ying, and H. Jin. An efficient graph indexing method. In Proc. of ICDE, pages 805-916, 2012.
35. D. W. Williams, J. Huan, and W. Wang. Graph database indexing using structured graph decomposition. In Proc. of ICDE, pages 976-985, 2007.
36. X. Yan and J. Han. Closegraph: mining closed frequent graph patterns. In Proc. of KDD, pages 286-295, 2003.
37. X. Yan, P. S. Yu, and J. Han. Graph indexing: a frequent structurebased approach. In Proc. of SIGMOD, pages 335-346, 2004.
38. X. Yan, P. S. Yu, and J. Han. Substructure similarity search in graph databases. In Proc. of SIGMOD, pages 766-777, 2005.
39. Y. Yuan, L. Chen, and G. Wang. Efficiently answering probability threshold-based shortest path queries over uncertain graphs. In Proc. of DASFAA, pages 155-170, 2010.
40. Y. Yuan, G. Wang, H. Wang, and L. Chen. Efficient subgraph search over large uncertain graphs. In Proc. of VLDB, pages 876-886, 2011.
41. Z. Zeng, A. K. H. Tung, J. Wang, L. Zhou, and J. Feng. Comparing stars: On approximating graph edit distance. In Proc. of VLDB, pages 25-36, 2009.
42. Z. Zou, H. Gao, and J. Li. Discovering frequent subgraphs over uncertain graph databases under probabilistic semantics. In Proc. of KDD, pages 633-642, 2010.
43. Z. Zou, H. Gao, and J. Li. Mining frequent subgraph patterns from uncertain graph data. TKDE, 22(9):1203-1218, 2010.