Finding top-k similar graphs in graph databases

ACM International Conference Proceeding Series

Volumn , Issue , 2012, Pages 456-467

  Zhu, Yuanyuan ^a   Qin, Lu ^a   Yu, Jeffrey Xu ^a   Cheng, Hong ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

graph database; similarity search; top k

Indexed keywords

CHEMICAL COMPOUND STRUCTURE; COMMON SUBGRAPH; COMPUTATIONAL COSTS; CONNECTIVITY INFORMATION; CONSTRUCTION COSTS; DIFFERENT STRUCTURE; FEATURE-BASED; GRAPH DATABASE; GRAPH SIMILARITY; INDEXING METHODS; INDEXING TECHNIQUES; LOWER BOUNDS; NP-HARD; PERFORMANCE STUDY; QUERY GRAPH; REAL DATA SETS; SIMILARITY MEASURE; SIMILARITY SEARCH; SUBGRAPHS; SUPERGRAPH; TOP-K; TWO-GRAPHS;

CHEMICAL COMPOUNDS; DATA PROCESSING; GRAPHIC METHODS; INDEXING (OF INFORMATION); QUERY PROCESSING;

DATABASE SYSTEMS;

EID: 84863523829     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2247596.2247650     Document Type: Conference Paper

References (28)

1. F. N. Abu-Khzam, N. F. Samatova, M. A. Rizk, and M. A. Langston. The maximum common subgraph problem: Faster solutions via vertex cover. In AICCSA, pages 367-373, 2007.
2. E. Balas and C. S. Yu. Finding a maximum clique in an arbitrary graph. SIAM J. Comput., 15(4):1054-1068, 1986.
3. 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.
4. H. Bunke and K. Shearer. A graph distance metric based on the maximal common subgraph. Pattern Recognition Letters, 19(3-4):255-259, 1998.
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, A. W.-C. Fu, and J. X. Yu. Fast graph query processing with a low-cost index. The VLDB Journal, pages 1-19, 2010.
7. 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.
8. W. Han, J. Lee, M. Pham, and J. Yu. igraph: a framework for comparisons of disk-based graph indexing techniques. PVLDB, 3(1-2):449-459, 2010.
9. H. He and A. Singh. Closure-tree: An index structure for graph queries. In ICDE, pages 38-38, 2006.
10. T. Horváth, T. Gärtner, and S. Wrobel. Cyclic pattern kernels for predictive graph mining. In KDD, pages 158-167, 2004.
11. H. Kashima, K. Tsuda, and A. Inokuchi. Marginalized kernels between labeled graphs. In ICML, pages 321-328, 2003.
12. E. B. Krissinel and K. Henrick. Common subgraph isomorphism detection by backtracking search. Softw., Pract. Exper., 34(6):591-607, 2004.
13. J. McGregor. Backtrack search algorithms and the maximal common subgraph problem. Softw., Pract. Exper., 12(1):23-34, 1982.
14. J. Raymond, E. Gardiner, and P. Willett. Rascal: Calculation of graph similarity using maximum common edge subgraphs. The Computer Journal, 45(6):631, 2002.
15. H. Shang, X. Lin, Y. Zhang, J. X. Yu, and W. Wang. Connected substructure similarity search. In SIGMOD, pages 903-914, 2010.
16. H. Shang, Y. Zhang, X. Lin, and J. X. Yu. Taming verification hardness: an efficient algorithm for testing subgraph isomorphism. PVLDB, 1(1):364-375, 2008.
17. H. Shang, K. Zhu, X. Lin, Y. Zhang, and R. Ichise. Similarity search on supergraph containment. In ICDE, pages 637-648, 2010.
18. D. Shasha, J. T.-L. Wang, and R. Giugno. Algorithmics and applications of tree and graph searching. In PODS, pages 39-52, 2002.
19. W. Suters, F. Abu-Khzam, Y. Zhang, C. Symons, N. Samatova, and M. Langston. A new approach and faster exact methods for the maximum common subgraph problem. Computing and combinatorics, pages 717-727, 2005.
20. X. Wang, A. M. Smalter, J. Huan, and G. H. Lushington. G-hash: towards fast kernel-based similarity search in large graph databases. In EDBT, pages 472-480, 2009.
21. P. Willett, J. Barnard, and G. Downs. Chemical similarity searching. Journal of Chemical Information and Computer Sciences, 38(6):983-996, 1998.
22. D. W. Williams, J. Huan, and W. Wang. Graph database indexing using structured graph decomposition. In ICDE, pages 976-985, 2007.
23. X. Yan, P. Yu, and J. Han. Substructure similarity search in graph databases. In SIGMOD, pages 766-777, 2005.
24. X. Yan, P. S. Yu, and J. Han. Graph indexing: A frequent structure-based approach. In SIGMOD, pages 335-346, 2004.
25. S. Zhang, M. Hu, and J. Yang. Treepi: A novel graph indexing method. In ICDE, pages 966-975, 2007.
26. S. Zhang, J. Li, H. Gao, and Z. Zou. A novel approach for efficient supergraph query processing on graph databases. In EDBT, pages 204-215, 2009.
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.