Taming verification hardness: An efficient algorithm for testing subgraph isomorphism

Proceedings of the VLDB Endowment

Volumn 1, Issue 1, 2008, Pages 364-375

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

^a UNIVERSITY OF NEW SOUTH WALES   (Australia)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHIC METHODS; SEMANTICS;

COMPUTATION COSTS; DATA SEMANTICS; FEATURE-BASED; NP-HARD; QUERY GRAPH; SUBGRAPH ISOMORPHISM; SYNTHETIC DATA;

SET THEORY;

EID: 84859197018     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1453856.1453899     Document Type: Article

References (21)

1. A. V. Aho, J. E. Hopcroft, and J. Ullman. Data Structures and Algorithms. 1983.
2. V. Arvind and J. Köbler. Graph isomorphism is low for zpp(np) and other lowness results. In STACS, pages 431-442, 2000.
3. S. Berretti, A. D. Bimbo, and E. Vicario. Efficient matching and indexing of graph models in content-based retrieval. IEEE Trans. Pattern Anal. Mach. Intell., 23(10):1089-1105, 2001.
4. 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, pages 857-872, 2007.
5. Y. Chi, Y. Yang, and R. R. Muntz. Canonical forms for labelled trees and their applications in frequent subtree mining. Knowl. Inf. Syst., 8(2):203-234, 2005
6. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. 2001.
7. M. R. Garey and D. S. Johnson. Computers and Intractability; A Guide to the Theory of NP-Completeness. New York, NY, USA, 1990.
8. R. Giugno and D. Shasha. Graphgrep: A fast and universal method for querying graphs. Proceedings of the International Conference on Pattern Recognition, 2:112-115 vol.2, 2002.
9. H. He and A. K. Singh. Closure-tree: An index structure for graph queries. In Proceedings of the International Conference on Data Engineering, page 38, 2006.
10. 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, pages 566-575, 2007.
11. A. H. Land and A. G. Doig. An automatic method of solving discrete programming problems. Econometrica, 28(3):497-520.
12. B. T. Messmer and H. Bunke. A decision tree approach to graph and subgraph isomorphism detection. Pattern Recognition, 32(12):1979-1998, 1999.
13. J. R. Ullmann. An algorithm for subgraph isomorphism. J. ACM, 23(1):31-42, 1976.
14. D. W. Williams, J. Huan, and W. Wang. Graph database indexing using structured graph decomposition. In Proceedings of the International Conference on Data Engineering, pages 976-985, 2007
15. X. Yan and J. Han. gspan: Graph-based substructure pattern mining. In Proceedings of the IEEE International Conference on Data Mining, page 721, 2002.
16. 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, pages 335-346, 2004.
17. 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, pages 766-777, 2005.
18. S. Zhang, M. Hu, and J. Yang. Treepi: A novel graph indexing method. In Proceedings of the International Conference on Data Engineering, pages 966-975, 2007
19. P. Zhao and J. X. Yu. Fast frequent free tree mining in graph databases. World Wide Web, 11(1):71-92, 2008
20. 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, pages 938-949, 2007.
21. 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.