CT-index: Fingerprint-based graph indexing combining cycles and trees

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2011, Pages 1115-1126

  Klein, Karsten ^a   Kriege, Nils ^a   Mutzel, Petra ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION AREA; AS GRAPH; BIOLOGICAL NETWORKS; EFFICIENT METHOD; EXPERIMENTAL COMPARISON; GRAPH INDEXING; LARGE DATABASE; NP-COMPLETENESS; QUERY PATTERNS; STATE-OF-THE-ART METHODS; SUBGRAPH ISOMORPHISM; SUBGRAPH ISOMORPHISM PROBLEM; SUBGRAPHS; VISUAL ANALYSIS; WILD CARDS;

CHEMICAL ANALYSIS; CHEMICAL COMPOUNDS; CHEMICALS; DATABASE SYSTEMS; HUMAN COMPUTER INTERACTION; PLANT EXTRACTS; SET THEORY;

TREES (MATHEMATICS);

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

References (29)

1. J. M. Barnard, "Substructure searching methods: Old and new," Journal of Chemical Information and Computer Sciences, vol. 33, no. 4, pp. 532-538, 1993.
2. K. Degtyarenko, J. Hastings, P. de Matos, and M. Ennis, "ChEBI: An open bioinformatics and cheminformatics resource." Curr Protoc Bioinformatics, vol. Chapter 14, no. 26, pp. 14.9.1-14.9.20, 2009.
3. "The PubChem project," http://pubchem.ncbi.nlm.nih.gov/.
4. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979.
5. M. Kuramochi and G. Karypis, "An efficient algorithm for discovering frequent subgraphs," IEEE Trans. Knowl. Data Eng., vol. 16, no. 9, pp. 1038-1051, 2004.
6. X. Yan, P. S. Yu, and J. Han, "Graph indexing based on discriminative frequent structure analysis," ACM Trans. Database Syst., vol. 30, no. 4, pp. 960-993, 2005.
7. R. Giugno and D. Shasha, "GraphGrep: A fast and universal method for querying graphs," in Pattern Recognition, 2002. Proceedings. 16th International Conference on, vol. 2, 2002, pp. 112-115 vol.2. (Pubitemid 44844693)
8. "Daylight theory manual v4.9," http://www.daylight.com, Jan. 2008.
9. S. Zhang, M. Hu, and J. Yang, "TreePi: A novel graph indexing method," in Data Engineering, 2007. ICDE 2007. IEEE 23rd International Conference on, 2007, pp. 966-975. (Pubitemid 47422100)
10. R. D. Natale, A. Ferro, R. Giugno, M. Mongiovì, A. Pulvirenti, and D. Shasha, "SING: Subgraph search in non-homogeneous graphs," BMC Bioinformatics, vol. 11, p. 96, 2010.
11. J. Cheng, Y. Ke, and W. Ng, "Efficient query processing on graph databases," ACM Trans. Database Syst., vol. 34, no. 1, pp. 1-48, 2009.
12. J. R. Ullmann, "An algorithm for subgraph isomorphism," J. ACM, vol. 23, no. 1, pp. 31-42, 1976.
13. H. He and A. K. Singh, "Closure-Tree: An index structure for graph queries," in ICDE '06: Proceedings of the 22nd International Conference on Data Engineering. IEEE Computer Society, 2006.
14. L. P. Cordella, P. Foggia, C. Sansone, and M. Vento, "A (sub)graph isomorphism algorithm for matching large graphs," IEEE Trans. Pattern Anal. Mach. Intell., vol. 26, no. 10, pp. 1367-1372, 2004.
15. V. Bonnici, A. Ferro, R. Giugno, A. Pulvirenti, and D. Shasha, "Enhancing graph database indexing by suffix tree structure," in Pattern Recognition in Bioinformatics, ser. Lecture Notes in Computer Science, T. Dijkstra, E. Tsivtsivadze, E. Marchiori, and T. Heskes, Eds. Springer Berlin / Heidelberg, 2010, vol. 6282, pp. 195-203.
16. R. Battiti and F. Mascia, "An algorithm portfolio for the sub-graph isomorphism problem," in SLS'07: Proceedings of the 2007 international conference on Engineering stochastic local search algorithms. Berlin, Heidelberg: Springer-Verlag, 2007, pp. 106-120.
17. G. V. Batz, M. Kroll, and R. Geiß, "A first experimental evaluation of search plan driven graph pattern matching," in AGTIVE, 2007, pp. 471-486.
18. L. Zou, L. Chen, J. X. Yu, and Y. Lu, "A novel spectral coding in a large graph database," in EDBT '08: Proceedings of the 11th international conference on Extending database technology. New York, NY, USA: ACM, 2008, pp. 181-192. (Pubitemid 351661701)
19. D. W. Williams, J. Huan, and W. Wang, "Graph database indexing using structured graph decomposition," Data Engineering, International Conference on, vol. 0, pp. 976-985, 2007. (Pubitemid 47422101)
20. P. Zhao, J. X. Yu, and P. S. Yu, "Graph indexing: tree + graph," in VLDB '07: Proceedings of the 33rd international conference on Very large data bases. VLDB Endowment, 2007, pp. 938-949.
21. H. Jiang, H. Wang, P. S. Yu, and S. Zhou, "GString: A novel approach for efficient search in graph databases," Data Engineering, International Conference on, vol. 0, pp. 566-575, 2007. (Pubitemid 47422060)
22. Y. Chi, R. Muntz, S. Nijssen, and J. Kok, "Frequent subtree mining-an overview," 2005.
23. D. Gusfield, Algorithms on Strings, Trees, and Sequences-Computer Science and Computational Biology. Cambridge University Press, 1997.
24. A. V. Aho and J. E. Hopcroft, The Design and Analysis of Computer Algorithms. Boston, MA, USA: Addison-Wesley Longman Publishing Co., Inc., 1974.
25. D. B. Johnson, "Finding all the elementary circuits of a directed graph," SIAM J. Comput., vol. 4, no. 1, pp. 77-84, 1975.
26. "National Cancer Institute-DTP AIDS antiviral screen dataset," http://dtp.nci.nih.gov/docs/aids/aids data.html, 1999.
27. J. Zobel, A. Moffat, and K. Ramamohanarao, "Inverted files versus signature files for text indexing," ACM Trans. Database Syst., vol. 23, no. 4, pp. 453-490, 1998.
28. S. Helmer and G. Moerkotte, "A performance study of four index structures for set-valued attributes of low cardinality," The VLDB Journal, vol. 12, no. 3, pp. 244-261, 2003. (Pubitemid 37334446)
29. S. Wetzel, K. Klein, S. Renner, D. Rauh, T. I. Oprea, P. Mutzel, and H. Waldmann, "Interactive exploration of chemical space with Scaffold Hunter," Nature Chemical Biology, vol. 5, no. 8, pp. 581-583, 2009.