Efficient subgraph search over large uncertain graphs

Proceedings of the VLDB Endowment

Volumn 4, Issue 11, 2011, Pages 876-886

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

^a NORTHEASTERN UNIVERSITY   (China)

^b MICROSOFT RESEARCH ASIA   (China)

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

^d WUHAN UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH DATABASES; GRAPHIC METHODS; PATTERN RECOGNITION; QUERY PROCESSING;

GRAPH DATABASE; GRAPH-BASED; LARGE GRAPHS; PREDICTION PATTERNS; PROBABILISTICS; PROTEIN COMPLEXES; QUERY GRAPH; STRUCTURAL PATTERN RECOGNITION; SUBGRAPHS; UNCERTAIN GRAPHS;

QUERY LANGUAGES;

EID: 84863753859     PISSN: None     EISSN: 21508097     Source Type: Journal    
DOI: 10.14778/3402707.3402726     Document Type: Conference Paper

References (36)

1. E. Adar and C. Re. Managing uncertainty in social networks. IEEE Data Eng. Bull., 30(2):15-22, 2007.
2. C. Aggarwal. Managing and mining uncertain data. Springer, 2009.
3. E. Balas and J. Xue. Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring. Algorithmica, 15:397-412, 1996.
4. S. Beretti, A. Bimbo, and E. Vicario. Efficient matching and indexing of graph models in content based retrieval. IEEE Trans. on Pattern Analysis and Machine Intelligence, 23:1089-1105, 2001.
5. S. Biswas and R. Morris. Exor: opportunistic multi-hop routing for wireless networks. In Proc. of SIGCOMM, pages 101-122, 2005.
6. C. Chen, X. Yan, P. S. YuE, J. Han, D.-Q. Zhang, and X. Gu. Towards graph containment search and indexing. In Proc. of VLDB, 2007.
7. J. Cheng, Y. Ke, and W. Ng. Efficient query processing on graph databases. ACM Trans. on Database Systems (TODS), 34(1), 2009.
8. 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.
9. 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.
10. C. Wang and L. Chen. Continuous subgraph pattern search over graph streams. In Proc. of ICDE, pages 872-883, 2009.
11. N. N. Dalvi and D. Suciu. Management of probabilistic data: foundations and challenges. In Proc. of PODS, pages 223-232, 2007.
12. P. Domingos and M. Richardson. Mining the network value of customers. In Proc. of KDD, pages 356-365, 2001.
13. M. R. Garey and D. S. Johnson. Computers and intractability: a guide to the theory of NP-completeness. W.H.Freeman, 1979.
14. J. Ghosh, H. Ngo, S. Yoon, and C. Qiao. On a routing problem within probabilistic graphs and its application to intermittently connected networks. In Proc. of INFOCOM, pages 1768-1779, 2007.
15. R. Giugno and D. Shasha. Graphgrep: a fast and universal method for querying graphs. In Proc. of the International Conference on Pattern Recognition, pages 112-115, 2002.
16. H. He and A. K. Singh. Closure-tree: an index structure for graph queries. In Proc. of ICDE, pages 426-437, 2006.
17. M. Hua and J. Pei. Probabilistic path queries in road networks: traffic uncertainty aware path selection. In Proc. of EDBT, pages 347-358, 2010.
18. 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.
19. B. KIMELFELD, Y. KOSHAROVSKY, and Y. SAGIV. Query efficiency in probabilistic xml models. In Proc. of SIGMOD, pages 776-787, 2008.
20. D. Liben-Nowell and J. Kleinberg. The link prediction problem for social networks. In Proc. of CIKM, pages 87-96, 2003.
21. B. Messmer and H. Bunke. A new algorithm for error-tolerant subgraph isomorphism detection. IEEE Trans. on Pattern Analysis and Machine Intelligence, 9(3):493-504, 1998.
22. M. Mitzenmacher and E. Upfal. Probability and Computing: Randomized algorithms and probabilistic analysis. Cambridge University Press, 2005.
23. A. Nierman and H. V. Jagadish. Protdb: probabilistic data in xml. In Proc. of VLDB, pages 1476-1487, 2002.
24. E. Petrakis and C. Faloutsos. Similarity searching in medical image databases. IEEE Trans. on Pattern Analysis and Machine Intelligence, 9(3):435-447, 1997.
25. M. Potamias, F. Bonchi, A. Gionis, and G. Kollios. k-nearest neighbors in uncertain graphs. In Proc. of VLDB, pages 863-874, 2010.
26. 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.
27. P. Senellart and S. Abiteboul. On the complexity of managing probabilistic xml data. In Proc. of PODS, pages 283-292, 2007.
28. P. Seshadri and A. N. Swami. Generalized partial indexes. In Proc. of ICDE, pages 375-386, 1995.
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. D. Suciu and N. N. Dalvi. Foundations of probabilistic answers to queries. In Proc. of SIGMOD, pages 274-285, 2005.
31. 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.
32. X. Yan and J. Han. gspan: Graph-based substructure pattern mining. In Proc. of ICDM, pages 721-724, 2002.
33. X. Yan, P. S. Yu, and J. Han. Graph indexing: a frequent structurebased approach. In Proc. of SIGMOD, pages 335-346, 2004.
34. R. Zass and A. Shashua. Probabilistic graph and hypergraph matching. In Proc. of CVPR, pages 34-41, 2008.
35. 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.
36. Z. Zou, H. Gao, and J. Li. Mining frequent subgraph patterns from uncertain graph data. TKDE, volume 22, pages 1203-1218, 2010.