Connected substructure similarity search

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2010, Pages 903-914

  Shang, Haichuan ^a,c   Lin, Xuemin ^a,c   Zhang, Ying ^a   Yu, Jeffrey Xu ^b   Wang, Wei ^a,c  

^a UNIVERSITY OF NEW SOUTH WALES   (Australia)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^c CSIRO   (Australia)

Author keywords

graph database; similarity search

Indexed keywords

BOUNDING TECHNIQUES; DISTANCE-BASED; EFFICIENT ALGORITHM; EXISTING METHOD; FILTERING TECHNIQUE; GRAPH DATABASE; INDEXING TECHNIQUES; NP COMPLETE; QUERY GRAPH; REAL DATA SETS; SIMILARITY SEARCH; SIMILARITY THRESHOLD; SUBGRAPHS; TWO-GRAPHS; VERIFICATION FRAMEWORK; WHOLE PROCESS;

ALGORITHMS; CHEMICAL COMPOUNDS;

GRAPHIC METHODS;

EID: 77954710172     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1807167.1807264     Document Type: Conference Paper

References (28)

1. E. Balas and C. S. Yu. Finding a maximum clique in an arbitrary graph. SIAM J. Comput., 15(4):1054-1068, 1986.
2. I. M. Bomze, M. Budinich, M. Pelillo, and C. Rossi. Annealed replication: a new heuristic for the maximum clique problem. Discrete Applied Mathematics, 121(1-3):27-49, 2002.
3. C. Bron and J. Kerbosch. Algorithm 457: finding all cliques of an undirected graph. Commun. ACM, 16(9):575-577, September 1973.
4. H. Bunke, P. Foggia, C. Guidobaldi, C. Sansone, and M. Vento. A comparison of algorithms for maximum common subgraph on randomly connected graphs. In SSPR/SPR, pages 123-132, 2002.
5. C. Chen, X. Yan, P. S. Yu, J. Han, D.-Q. Zhang, and X. Gu. Towards graph containment search and indexing. In VLDB, pages 926-937, 2007.
6. 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.
7. D. Conte, C. Guidobaldi, and C. Sansone. A comparison of three maximum common subgraph algorithms on a large database of labeled graphs. In GbRPR, pages 130-141, 2003.
8. P. J. Durand, R. Pasari, J. W. Baker, and C. che Tsai. An efficient algorithm for similarity analysis of molecules. Internet Journal of Chemistry, 2, 1999.
9. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979.
10. R. Giugno and D. Shasha. Graphgrep: A fast and universal method for querying graphs. In ICPR, volume 2, pages 112-115 vol.2, 2002.
11. H. He and A. K. Singh. Closure-tree: An index structure for graph queries. In ICDE, pages 38-39, 2006.
12. J. Huan, W. Wang, and J. Prins. Efficient mining of frequent subgraphs in the presence of isomorphism. In ICDM, pages 549-552, 2003.
13. H. Jiang, H. Wang, P. S. Yu, and S. Zhou. Gstring: A novel approach for efficient search in graph databases. In ICDE, pages 566-575, 2007.
14. E. B. Krissinel and K. Henrick. Common subgraph isomorphism detection by backtracking search. Softw. Pract. Exper., 34(6):591-607, 2004.
15. M. Kuramochi and G. Karypis. Frequent subgraph discovery. In ICDM, pages 313-320, 2001.
16. G. Levi. A note on the derivation of maximal common subgraphs of two directed or undirected graphs. Calcolo, 9(4):341-352, September 1972.
17. J. J. McGregor. Backtrack search algorithms and the maximal common subgraph problem. Softw., Pract. Exper., 12(1):23-34, 1982.
18. S. Nijssen and J. N. Kok. A quickstart in frequent structure mining can make a difference. In SIGKDD, pages 647-652, 2004.
19. H. Shang, Y. Zhang, X. Lin, and J. X. Yu. Taming verification hardness: an efficient algorithm for testing subgraph isomorphism. In VLDB, pages 364-375, 2008.
20. H. Shang, K. Zhu, X. Lin, Y. Zhang, and R. Ichise. Similarity search on supergraph containment. In ICDE, pages 637-648, 2010.
21. D. W. Williams, J. Huan, and W. Wang. Graph database indexing using structured graph decomposition. In ICDE, pages 976-985, 2007.
22. X. Yan and J. Han. gspan: Graph-based substructure pattern mining. In ICDM, pages 721-724, 2002.
23. X. Yan, P. S. Yu, and J. Han. Graph indexing: a frequent structure-based approach. In SIGMOD, pages 335-346, 2004.
24. X. Yan, P. S. Yu, and J. Han. Substructure similarity search in graph databases. In SIGMOD, pages 766-777, 2005.
25. Z. Zeng, A. K. H. Tung, J. Wang, L. Zhou, and J. Feng. Comparing stars: On approximating graph edit distance. In VLDB, pages 25-36, 2009.
26. S. Zhang, M. Hu, and J. Yang. Treepi: A novel graph indexing method. In ICDE, pages 966-975, 2007.
27. P. Zhao, J. X. Yu, and P. S. Yu. Graph indexing: tree + delta <= graph. In VLDB, pages 938-949, 2007.
28. L. Zou, L. Chen, J. X. Yu, and Y. Lu. A novel spectral coding in a large graph database. In EDBT, pages 181-192, 2008.