Enhancing graph database indexing by suffix tree structure

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6282 LNBI, Issue , 2010, Pages 195-203

  Bonnici, Vincenzo ^a   Ferro, Alfredo ^a   Giugno, Rosalba ^a   Pulvirenti, Alfredo ^a   Shasha, Dennis ^b  

^a UNIVERSITY OF CATANIA   (Italy)

^b NEW YORK UNIVERSITY   (United States)

Author keywords

graph database search; indexing; molecular database; subgraph isomorphism; suffix tree

Indexed keywords

GRAPH DATABASE; INDEXING; MOLECULAR DATABASE; SUBGRAPH ISOMORPHISM; SUFFIX-TREES; CHEMICAL DATABASE; FILTERING TECHNIQUE; GRAPH-SEARCHING ALGORITHMS; WEALTH OF INFORMATION;

BIOINFORMATICS; DATABASE SYSTEMS; INDEXING (OF INFORMATION); INFORMATION RETRIEVAL; PATTERN RECOGNITION; SEARCH ENGINES; SET THEORY; FORESTRY; QUERY PROCESSING;

TREES (MATHEMATICS);

EID: 78049453458     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-16001-1_17     Document Type: Conference Paper

References (16)

1. Cheng, J., Ke, Y., Ng, W., Lu, A.: Fg-index: towards verification-free query processing on graph databases. In: Proceedings of ACM SIGMOD International Conference on Management of Data, pp. 857-872 (2007)
2. Cohen, E., Datar, M., Fujiwara, S., Gionis, A., Indyk, P., Motwani, R., Ullman, J.D., Yang, C.: Finding interesting associations without support pruning. IEEE Transactions on Knowledge and Data Engineering 13(1), 64-78 (2001) (Pubitemid 32301044)
3. Cordella, L., Foggia, P., Sansone, C., Vento, M.: A (sub)graph isomorphism algorithm for matching large graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence 26(10), 1367-1372 (2004)
4. Daylight chemical information systems, http://www.daylight.com/
5. Di Natale, R., Ferro, A., Giugno, R., Mongiovi, M., Pulvirenti, A., Shasha, D.: Sing: Subgraph search in non-homogeneous graphs. BMC bioinformatics 11(1), 96 (2010)
6. Ferro, A., Giugno, R., Mongiovì, M., Pulvirenti, A., Skripin, D., Shasha, D.: Graphfind: enhancing graph searching by low support data mining techniques. BMC bioinformatics 9(suppl. 4), S10 (2008)
7. Frowns, http://frowns.sourceforge.net/
8. Giugno, R., Shasha, D.: Graphgrep: A fast and universal method for querying graphs. In: Proceeding of the International Conference in Pattern Recognition (ICPR), pp. 112-115 (2002)
9. He, H., Singh, A.K.: Closure-tree: An index structure for graph queries. In: Proceedings of the 22nd International Conference on Data Engineering, ICDE 2006, p. 38 (2006)
10. Messmer, B.T., Bunke, H.: Subgraph isomorphism detection in polynominal time on preprocessed model graphs. In: Proceedings of Asian Conference on Computer Vision, pp. 373-382 (1995)
11. National Cancer Institute. U.S. National Institute of Health, http://www.cancer.gov/
12. Shasha, D., Wang, J.T.-L., Giugno, R.: Algorithmics and applications of tree and graph searching. In: Proceeding of the ACM Symposium on Principles of Database Systems (PODS), pp. 39-52 (2002)
13. Ukkonen, E.: Approximate string-matching over suffix trees. In: Combinatorial Pattern Matching, pp. 228-242. Springer, Heidelberg (1993)
14. Yan, X., Yu, P.S., Han, J.: Graph indexing based on discriminative frequent structure analysis. ACM Transactions on Database Systems 30(4), 960-993 (2005) (Pubitemid 43909009)
15. Zhang, S., Hu, M., Yang, J.: Treepi: A novel graph indexing method. In: Proceedings of IEEE International Conference on Data Engineering, pp. 966-975 (2007)
16. Zou, L., Chen, L., Yu, J.X., Lu, Y.: A novel spectral coding in a large graph database. In: Proceedings of the 11th International Conference on Extending Database Technology: Advances in Database Technology, pp. 181-192. ACM, New York (2008)