Efficient subgraph matching on billion node graphs

Proceedings of the VLDB Endowment

Volumn 5, Issue 9, 2012, Pages 788-799

  Sun, Zhao ^a   Wang, Hongzhi ^b   Wang, Haixun ^c   Shao, Bin ^c   Li, Jianzhong ^b  

^a FUDAN UNIVERSITY   (China)

^b HARBIN INSTITUTE OF TECHNOLOGY   (China)

^c MICROSOFT RESEARCH ASIA   (China)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHIC METHODS; INDEXING (OF INFORMATION); PATTERN MATCHING; QUERY PROCESSING;

BASIC GRAPHS; DISTRIBUTED MEMORY; GRAPH EXPLORATION; LARGE GRAPHS; LINEAR APPROACH; NOVEL ALGORITHM; REGULAR-EXPRESSION MATCHING; SUBGRAPH MATCHING;

GRAPH THEORY;

EID: 84863746279     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/2311906.2311907     Document Type: Article

References (36)

1. http://neo4j.org/
2. http://www.facebook.com/press/info.php?statistics
3. http://www.infinitegraph.com/
4. C. C. Aggarwal and H. Wang, editors. Managing and Mining Graph Data, volume 40 of Advances in Database Systems. Springer, 2010.
5. M. Atre, V. Chaoji, M. J. Zaki, and J. A. Hendler. Matrix "bit" loaded: a scalable lightweight join query processor for rdf data. In WWW, pages 41-50, 2010.
6. V. C. Barbosa. An introduction to distributed algorithms. MIT Press, 1996.
7. R. Bramandia, B. Choi, and W. K. Ng. Incremental maintenance of 2-hop labeling of large graphs. IEEE Trans. Knowl. Data Eng., 22(5):682-698, 2010.
8. D. Chakrabarti, Y. Zhan, and C. Faloutsos. R-mat: A recursive model for graph mining. In SDM, 2004.
9. J. Cheng, J. X. Yu, B. Ding, P. S. Yu, and H. Wang. Fast graph pattern matching. In ICDE, pages 913-922, 2008.
10. T.-Y. Cheung. Graph traversal techniques and the maximum flow problem in distributed computation. IEEE Trans. Software Eng., 9(4):504-512, 1983.
11. L. P. Cordella, P. Foggia, C. Sansone, and M. Vento. A (sub)graph isomorphism algorithm for matching large graphs. IEEE Trans. Pattern Anal. Mach. Intell., 26(10):1367-1372, 2004.
12. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms, Second Edition. The MIT Press and McGraw-Hill Book Company, 2001.
13. B. Gallagher. Matching structure and semantics: A survey on graph-based pattern matching. In AAAI, 2006.
14. H. Garcia-Molina, J. D. Ullman, and J. Widom. Database System Implementation. Prentice-Hall, 2000.
15. H. He and A. K. Singh. Graphs-at-a-time: query language and access methods for graph databases. In SIGMOD, 2008.
16. L. B. Holder, D. J. Cook, and S. Djoko. Substucture discovery in the subdue system. In KDD Workshop, pages 169-180, 1994.
17. B. Iordanov. Hypergraphdb: A generalized graph database. In WAIM Workshops, pages 25-36, 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. G. Kasneci, F. M. Suchanek, G. Ifrim, M. Ramanath, and G. Weikum. Naga: Searching and ranking knowledge. In ICDE, pages 953-962, 2008.
20. V. Kumar, A. Grama, A. Gupta, and G. Karypis. Introduction to Parallel Computing. Benjamin/Cummings, 1994.
21. M. Levene and A. Poulovassilis. Web dynamics. Software Focus, 2(2):60-67, 2001.
22. G. Malewicz, M. H. Austern, A. J. C. Bik, J. C. Dehnert, I. Horn, N. Leiser, and G. Czajkowski. Pregel: a system for large-scale graph processing. In SIGMOD, 2010.
23. T. Neumann and G. Weikum. The rdf-3x engine for scalable management of rdf data. VLDB J., 19(1):91-113, 2010.
24. B. Shao, H. Wang, and Y. Li. The Trinity graph engine. Technical Report 161291, Microsoft Research, 2012.
25. B. Shao, H. Wang, and Y. Xiao. Managing and mining billion-scale graphs: Systems and implementations. In SIGMOD, 2012.
26. J. R. Ullmann. An algorithm for subgraph isomorphism. J. ACM, 23(1):31-42, 1976.
27. W.Wu, H. Li, H.Wang, and K. Zhu. Probase: A probabilistic taxonomy for text understanding. In SIGMOD, 2012.
28. X. Yan, P. S. Yu, and J. Han. Substructure similarity search in graph databases. In SIGMOD, 2005.
29. Y. Yuan, G. Wang, L. Chen, and H. Wang. Efficient subgraph similarity search on large probabilistic graph databases. In PVLDB, 2012.
30. Y. Yuan, G. Wang, H. Wang, and L. Chen. Efficient subgraph search over large uncertain graphs. In PVLDB, pages 876-886.
31. D. R. Zerbino and E. Birney. Velvet: algorithms for de novo short read assembly using de bruijn graphs. Genome Research, 18(5):821-9, 2008.
32. S. Zhang, S. Li, and J. Yang. Gaddi: distance index based subgraph matching in biological networks. In EDBT, 2009.
33. S. Zhang, J. Yang, and W. Jin. Sapper: Subgraph indexing and approximate matching in large graphs. PVLDB, 3(1):1185-1194, 2010.
34. P. Zhao and J. Han. On graph query optimization in large networks. PVLDB, 3(1):340-351, 2010.
35. F. Zhu, Q. Qu, D. Lo, X. Yan, J. Han, and P. S. Yu. Mining top-k large structural patterns in a massive network. PVLDB, 4(11):807-818, 2011.
36. L. Zou, L. Chen, and M. T. Ö zsu. Distancejoin: Pattern match query in a large graph database. PVLDB, 2(1):886-897, 2009.