Towards graph containment search and indexing

33rd International Conference on Very Large Data Bases, VLDB 2007 - Conference Proceedings

Volumn , Issue , 2007, Pages 926-937

  Chen, Chen ^a   Yan, Xifeng ^b   Yu, Philip S ^b   Han, Jiawei ^a   Zhang, Dong Qing ^c   Gu, Xiaohui ^b  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

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

^c Thomson Research   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHIC METHODS; OPTIMIZATION;

GENERAL SOLUTIONS; GRAPH CONTAINMENT; GREEDY ALGORITHMS; HIERARCHICAL INDEXING; INDEX CONSTRUCTION; SAMPLING TECHNIQUE; STRUCTURE DIFFERENCE; TRANSITIVE RELATION;

INDEXING (OF INFORMATION);

EID: 85011024403     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. A. V. Aho and M. J. Corasick. Efficient string matching: an aid to bibliographic search. Commun. ACM, 18(6):333-340, 1975.
2. H. Bunke. Graph matching: Theoretical foundations, algorithms, and applications. In Vision Interface, pages 82-88, 2000.
3. Y. Chen, G. Dong, J. Han, B. W. Wah, and J. Wang. Multi-dimensional regression analysis of time-series data streams. In VLDB, pages 323-334, 2002.
4. D. Conte, P. Foggia, C. Sansone, and M. Vento. Thirty years of graph matching in pattern recognition. IJPRAI, 18(3):265-298, 2004.
5. G. Dong and J. Li. Efficient mining of emerging patterns: Discovering trends and differences. In KDD, pages 43-52, 1999.
6. Y. Fang, R. H. Katz, and T. V. Lakshman. Gigabit rate packet pattern-matching using tcam. In ICNP, pages 174-183, 2004.
7. K. S. Fu. A step towards unification of syntactic and statistical pattern recognition. IEEE Trans. Pattern, Anal Mach. Intell., 8(3):398-404, 1986.
8. S. Gold and A. Rangarajan. A graduated assignment algorithm for graph matching. IEEE Trans. Pattern Anal. Mach. Intell., 18(4):377-388, 1996.
9. R. Goldman and J. Widom. Dataguides: Enabling query formulation and optimization in semistructured databases. In VLDB, pages 436-445, 1997.
10. X. Gu, Z. Wen, C. Lin, and P. S. Yu. Vico: an adaptive distributed video correlation system. In ACM Multimedia, pages 559-568, 2006.
11. H. He and A. K. Singh. Closure-tree: An index structure for graph queries. In ICDE, page 38, 2006.
12. D. S. Hochbaum, editor. Approximation Algorithms for NP-Hard Problems. PWS Publishing, MA, 1997.
13. L. B. Holder, D. J. Cook, and S. Djoko. Substucture discovery in the subdue system. In KDD Workshop, pages 169-180, 1994.
14. T. Kadir and M. Brady. Saliency, scale and image description. International Journal of Computer Vision, 45(2):83-105, 2001.
15. M. Koyutiirk, A. Grama, and W. Szpankowski. Pairwise local alignment of protein interaction networks guided by models of evolution. In RECOMB, pages 48-65, 2005.
16. M. Kuramochi and G. Karypis. Frequent subgraph discovery. In ICDM, pages 313-320, 2001.
17. B. T. Messmer and H. Bunke. A decision tree approach to graph and subgraph isomorphism detection. Pattern, Recognition, 32(12):1979-1998, 1999.
18. S. Nijssen and J. N. Kok. A quickstart in frequent structure mining can make a difference. In KDD, pages 647-652, 2004.
19. M. Petrovic, H. Liu, and H.-A. Jacobsen. G-topss: fast filtering of graph-based metadata. In WWW, pages 539-547, 2005.
20. C. Qun, A. Lim, and K. W. Ong. D(k)-index: An adaptive structural summary for graph-structured data. In SIGMOD Conference, pages 134-144, 2003.
21. D. Shasha, J. T.-L. Wang, and R. Giugno. Algorithmics and applications of tree and graph searching. In PODS, pages 39-52, 2002.
22. Y. Tian, R. C. McEachin, C. Santos, D. J. States, and J. M. Patel. SAGA: a subgraph matching tool for biological graphs. Bioinformatics, pages 232-239, 2006.
23. R. M. H. Ting and J. Bailey. Mining minimal contrast subgraph patterns. In SDM, 2006.
24. X. Yan and J. Han. Closegraph: mining closed frequent graph patterns. In KDD, pages 286-295, 2003.
25. X. Yan, P. S. Yu, and J. Han. Graph indexing: A frequent structure-based approach. In SIGMOD Conference, pages 335-346, 2004.
26. X. Yan, P. S. Yu, and J. Han. Substructure similarity search in graph databases. In SIGMOD Conference, pages 766-777, 2005.
27. D. Zhang and S.-F. Chang. Detecting image near-duplicate by stochastic attributed relational graph matching with learning. In ACM Multimedia, pages 877-884, 2004.