Similarity search on supergraph containment

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2010, Pages 637-648

  Shang, Haichuan ^a   Zhu, Ke ^a   Lin, Xuemin ^a   Zhang, Ying ^a   Ichise, Ryutaro ^b  

^a UNIVERSITY OF NEW SOUTH WALES   (Australia)

^b NATIONAL INSTITUTE OF INFORMATICS   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BOTTOM-UP STRATEGY; DATA GRAPH; INDEX CONSTRUCTION; INDEXING TECHNIQUES; QUERY GRAPH; REAL DATA SETS; SIMILARITY SEARCH; SUPERGRAPH; TOPDOWN;

INDEXING (MATERIALS WORKING); QUERY PROCESSING;

GRAPHIC METHODS;

EID: 77952767693     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2010.5447846     Document Type: Conference Paper

References (25)

1. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979.
2. X. Yan, P. S. Yu, and J. Han, "Graph indexing: a frequent structure-based approach," in Proceedings of the ACM SIGMOD international conference on Management of data, 2004, pp. 335-346.
3. H. He and A. K. Singh, "Closure-tree: An index structure for graph queries," in Proceedings of the International Conference on Data Engineering, 2006, p. 38.
4. P. Zhao, J. X. Yu, and P. S. Yu, "Graph indexing: tree + delta <=graph," in Proceedings of the International Conference on Very Large Data Bases, 2007, pp. 938-949.
5. H. Shang, Y. Zhang, X. Lin, and J. X. Yu, "Taming verification hardness: an efficient algorithm for testing subgraph isomorphism," in Proceedings of the International Conference on Very Large Data Bases, 2008, pp. 364-375.
6. S. Zhang, M. Hu, and J. Yang, "Treepi: A novel graph indexing method," in Proceedings of the International Conference on Data Engineering, 2007, pp. 966-975.
7. J. Cheng, Y. Ke, W. Ng, and A. Lu, "Fg-index: towards verification-free query processing on graph databases," in Proceedings of the ACM SIGMOD international conference on Management of data, 2007, pp. 857-872.
8. C. Chen, X. Yan, P. S. Yu, J. Han, D.-Q. Zhang, and X. Gu, "Towards graph containment search and indexing," in Proceedings of the International Conference on Very Large Data Bases, 2007, pp. 926-937.
9. S. Zhang, J. Li, H. Gao, and Z. Zou, "A novel approach for efficient supergraph query processing on graph databases," in Proceedings of the International Conference on Extending Database Technology, 2009, pp. 204-215.
10. K. S. Fu, "A step towards unification of syntactic and statistical pattern recognition," in IEEE Trans. Pattern Anal. Mach. Intell., 1986.
11. X. Yan, P. S. Yu, and J. Han, "Substructure similarity search in graph databases," in Proceedings of the ACM SIGMOD international conference on Management of data, 2005, pp. 766-777.
12. J. W. Raymond and P. Willett, "Maximum common subgraph isomorphism algorithms for the matching of chemical structures." J Comput Aided Mol Des, vol. 16, no. 7, pp. 521-533, July 2002. [Online]. Available: http://view.ncbi.nlm.nih.gov/pubmed/12510884
13. C. Bron and J. Kerbosch, "Algorithm 457: finding all cliques of an undirected graph," Commun. ACM, vol. 16, no. 9, pp. 575-577, September 1973. [Online]. Available: http://dx.doi.org/10.1145/362342.362367
14. P. J. Durand, R. Pasari, J. W. Baker, and C. che Tsai, "An efficient algorithm for similarity analysis of molecules," Internet Journal of Chemistry, vol. 2, 1999.
15. G. Levi, "A note on the derivation of maximal common subgraphs of two directed or undirected graphs," Calcolo, vol. 9, no. 4, pp. 341-352, September 1972.
16. R. Giugno and D. Shasha, "Graphgrep: A fast and universal method for querying graphs," Proceedings of the International Conference on Pattern Recognition, vol. 2, pp. 112-115 vol.2, 2002.
17. H. Jiang, H. Wang, P. S. Yu, and S. Zhou, "Gstring: A novel approach for efficient search in graph databases," in Proceedings of the International Conference on Data Engineering, 2007, pp. 566-575.
18. L. Zou, L. Chen, J. X. Yu, and Y. Lu, "A novel spectral coding in a large graph database," in Proceedings of the International Conference on Extending Database Technology, 2008.
19. D. W. Williams, J. Huan, and W. Wang, "Graph database indexing using structured graph decomposition," in Proceedings of the International Conference on Data Engineering, 2007, pp. 976-985.
20. E. B. Krissinel and K. Henrick, "Common subgraph isomorphism detection by backtracking search," Softw. Pract. Exper., vol. 34, no. 6, pp. 591-607, 2004.
21. J. J. McGregor, "Backtrack search algorithms and the maximal common subgraph problem," Softw., Pract. Exper., vol. 12, no. 1, pp. 23-34, 1982.
22. I. M. Bomze, M. Budinich, M. Pelillo, and C. Rossi, "Annealed replication: a new heuristic for the maximum clique problem," Discrete Applied Mathematics, vol. 121, no. 1-3, pp. 27-49, 2002.
23. 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, 2002, pp. 123-132.
24. D. Conte, C. Guidobaldi, and C. Sansone, "A comparison of three maximum common subgraph algorithms on a large database of labeled graphs," in GbRPR, 2003, pp. 130-141.
25. E. Balas and C. S. Yu, "Finding a maximum clique in an arbitrary graph," SIAM J. Comput., vol. 15, no. 4, pp. 1054-1068, 1986.