Neighborhood based fast graph search in large networks

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2011, Pages 901-912

  Khan, Arijit ^a   Li, Nan ^a   Yan, Xifeng ^a   Guan, Ziyu ^a   Chakraborty, Supriyo ^b   Tao, Shu ^c  

^a University of California   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

graph alignment; graph query; graph search; RDF

Indexed keywords

INDIUM COMPOUNDS; INFORMATION DISSEMINATION; INFORMATION SERVICES; RESOURCE DESCRIPTION FRAMEWORK (RDF);

COMPLEX SOCIAL NETWORKS; GRAPH ALIGNMENT; GRAPH QUERIES; GRAPH SEARCH; INFORMATION NETWORKS; LARGER NETWORKS; NEIGHBOURHOOD; QUERY GRAPH; RDF; SIMILARITY SEARCH;

OPTIMIZATION;

EID: 79959958172     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1989323.1989418     Document Type: Conference Paper

References (41)

1. D. Ajwani, U. Meyer, and V. Osipov. Improved external memory bfs implementation. In ALENEX, 2007.
2. L. Arge, G. S. Brodal, and L. Toma. On external-memory mst, sssp and multi-way planar graph separation. In Workshop on Algorithmic Theory, Vol. 1851 of LNCS, pages 433-447. Springer, 2000.
3. M. Bayati, M. Gerritsen, D. F. Gleich, A. Saberi, and Y. Wang. Algorithms for large, sparse network alignment problems. ICDM, 0:705-710, 2009.
4. P. Boldi and S. Vigna. The WebGraph framework I: Compression techniques. In WWW, pages 595-601, 2004.
5. K. M. Borgwardt and H.-P. Kriegel. Shortest-path kernels on graphs. In ICDM, pages 74-81, 2005.
6. M. Brocheler, A. Pugliese, and V. S. Subrahmanian. Cosi: Cloud oriented subgraph identification in massive social networks. ASONAM, 0:248-255, 2010.
7. S. Chaudhury, K. Ganjam, V.Ganti, and R. Motwani. Robust and efficient fuzzy match for online data cleaning. In SIGMOD, 2003.
8. J. Cheng, Y. Ke, W. Ng, and A. Lu. FG-Index: Towards verification-free query processing on graph databases. In SIGMOD, pages 857-872, 2007.
9. C. Chung, J. Min, and K. Shim. APEX: An adaptive path index for xml data. In SIGMOD, pages 121-132, 2002.
10. S. Cook. The complexity of theorem-proving procedures. In STOC, pages 151-158, 1971.
11. J. Edmonds and R. M. Karp. Theoretical improvements in algorithmic efficiency for network flow problems. Journal of the ACM, 19(2):248-264, 1972.
12. R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. In PODS, pages 102-113, 2001.
13. W. Fan, J. Li, S. Ma, N. Tang, Y. Wu, and Y. Wu. Graph pattern matching: From intractable to polynomial time. PVLDB, 3(1):264-275, 2010.
14. W. Fan, J. Li, S. Ma, H. Wang, and Y. Wu. Graph homomorphism revisited for graph matching. PVLDB, 3(1):1161-1172, 2010.
15. Freebase. http://www.freebase.com.
16. T. Gärtner, P. A. Flach, and S. Wrobel. On graph kernels: Hardness results and efficient alternatives. In COLT and the 7th Kernel Workshop, 2003.
17. H. He and A. Singh. Closure-tree: An index structure for graph queries. In ICDE, page 38, 2006.
18. H.Kashima and A.Inokuchi. Kernels for graph classification. ICDM Workshop on Active Mining, 2002.
19. T. Horváth, T. Gärtner, and S. Wrobel. Cyclic pattern kernels for predictive graph mining. In KDD, pages 158-167, 2004.
20. J. J. Ramon and T. Gärtner. Expressivity versus efficiency of graph kernels. In First Int. Workshop on Mining Graphs, Trees and Sequences, pages 65-74, 2003.
21. B. P. Kelley, B. Yuan, F. Lewitter, R. Sharan, B. R. Stockwell, and T. Ideker. Pathblast: a tool for alignment of protein interaction networks. Nucleic Acids Res, 32:83-88, 2004.
22. A. Khan, X. Yan, and K.-L.Wu. Towards proximity pattern mining in large graphs. In SIGMOD, 2010.
23. Z. Liang, M. Xu, M. Teng, and L. Niu. Netalign: a web-based tool for comparison of protein interaction networks. Bioinformatics, 22(17):2175-2177, 2006. (Pubitemid 44390916)
24. M. Mongiovì, R. D. Natale, R. Giugno, A. Pulvirenti, A. Ferro, and R. Sharan. Sigma: a set-cover-based inexact graph matching algorithm. J. Bioinformatics and Computational Biology, 8(2):199-218, 2010.
25. N. N. Shervashidze and K. M. Borgwardt. Fast subtree kernels on graphs. pages 1660-1668. Curran, 2010.
26. R. D. Natale, A. Ferro, R. Giugno, M. Mongiovì, A. Pulvirenti, and D. Shasha. Sing: Subgraph search in non-homogeneous graphs. BMC Bioinformatics, 11:96, 2010.
27. E. Prudhommeaux and A. Seaborne. Sparql query language for rdf. Technical report, W3C, 2007.
28. C. Qun, A. Lim, and K. Ong. D(k)-index: An adaptive structural summary for graph-structured data. In SIGMOD, pages 134-144, 2003.
29. H. Shang, Y. Zhang, X. Lin, and J. Yu. Taming verification hardness: An efficient algorithm for testing subgraph isomorphism. In VLDB, pages 364-375, 2008.
30. L. Shapiro and R. Haralick. Structural descriptions and inexact matching. IEEE Trans. on Pattern Analysis and Machine Intelligence, 3:504-519, 1981.
31. D. Shasha, J. T.-L.Wang, and R. Giugno. Algorithmics and applications of tree and graph searching. In PODS, pages 39-52, 2002.
32. R. Singh, J. Xu, and B. Berger. Global alignment of multiple protein interaction networks with application to functional orthology detection. PNAS, 105(35):12763-12768, 2008.
33. Y. Tian, R. McEachin, C. Santos, D. States, and J. Patel. SAGA: a subgraph matching tool for biological graphs. Bioinformatics, 23(2):232-239, 2006. (Pubitemid 46189614)
34. Y. Tian and J. M. Patel. Tale: A tool for approximate large graph matching. In ICDE, pages 963-972, 2008.
35. H. Tong, C. Faloutsos, B. Gallagher, and T. Eliassi-Rad. Fast best-effort pattern matching in large attributed graphs. In KDD, pages 737-746, 2007.
36. D. J. Watts, P. S. Dodds, and M. E. J. Newman. Identity and search in social networks. Sience, 296:1302-1305, 2002. (Pubitemid 34522782)
37. X. Yan, P. S. Yu, and J. Han. Graph indexing: A frequent structure-based approach. In SIGMOD, pages 335-346, 2004.
38. X. Yan, P. S. Yu, and J. Han. Substructure similarity search in graph databases. In SIGMOD, pages 766-777, 2005.
39. S. Zhang, J. Yang, and W. Jin. Sapper: Subgraph indexing and approximate matching in large graphs. PVLDB, 3(1):1185-1194, 2010.
40. P. Zhao, J. Yu, and P. Yu. Graph indexing: tree + delta >= graph. In VLDB, pages 938-949, 2007.
41. L. Zou, L. Chen, J. Yu, and Y. Lu. A novel spectral coding in a large graph database. In EDBT, pages 181-192, 2008.