SAPPER: Subgraph indexing and approximate matching in large graphs

Proceedings of the VLDB Endowment

Volumn 3, Issue 1, 2010, Pages 1185-1194

  Zhang, Shijie ^a   Yang, Jiong ^a   Jin, Wei ^a  

^a CASE WESTERN RESERVE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION PROGRAMS; DATABASE SYSTEMS; INDEXING (OF INFORMATION); QUERY PROCESSING; SOCIAL SCIENCES COMPUTING; SOFTWARE ENGINEERING;

APPROXIMATE MATCHING; COMPUTATIONAL BIOLOGY; ENGINEERING TECHNIQUES; INDEXING METHODS; NEW APPLICATIONS; RANDOM SPANNING TREE; RESEARCH TOPICS; SYNTHETIC DATASETS;

TREES (MATHEMATICS);

EID: 79959936290     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1920841.1920988     Document Type: Article

References (25)

1. D. J. Aldous,The random walk construction of uniform spanning trees and uniform labelled trees, SIAM J. Discrete Math, 1990.
2. R. Agrawal and R. Srikant,Fast algorithms for mining association rules, Prof. of VLDB, 1994.
3. B. H. Bloom,Space/time trade-offs in hash coding with allowable errors, Communications of the ACM 13 (7), 1970.
4. J. Cheng, Y. Ke, W. Ng and A. Lu,FG-Index: towards verification-free query processing on graph databases. Proc. of SIGMOD, 2007.
5. B. Chazelle, J. Kilian, R. Rubinfeld and A. Tal,The bloomier filter: an efficient data structure for static support lookup tables, Proc. of 5th Annual ACM-SIAM Symposium on Discrete Algorithms, 2004.
6. L. Cordella, P. Foggia, C. Sansone and M. Vento,A (sub)graph isomorphism algorithm for matching large graphs. PAMI, 2004.
7. B. Dost, T. Shlomi, N. Gupta, E. Ruppin, V. Bafna and R. Sharan,QNet: a tool for querying protein interaction networks, Proc. of RECOMB , 2007.
8. T. Nguyen, H. Nguyen, N. Pham, J. AI-Kofahi and T. Nguyen,Graph-based mining of multiple object usage patterns, Proc. of the Joint Meeting of ESEC and ACM SIGSOFT, 2009.
9. R. Giugno and D. Shasha,GraphGrep: A fast and universal method for querying graphs. Proc. of ICPR, 2002.
10. J. Han, J. Pei and Y. Yin,Mining frequent patterns without candidate generation, Proc. of SIGMOD, 2000.
11. H. He and A. K. Singh,Closure-Tree: an index structure for graph queries. Proc. of ICDE, 2006.
12. H. Jiang, H. Wang, P. Yu and S. Zhou,GString: A novel approach for efficient search in graph databases. Proc. of ICDE, 2007.
13. M. Kanehisa and S. Goto,KEGG: Kyoto encyclopedia of genes and genomes, Nuc. Ac. Res, 2000, 28:27-30
14. M. Koyuturk, A. Grama and W. Szpankowski,Pairwise local alignment of protein interaction networks guided by models of evolution. Proc. of RECOMB, 2005.
15. F. Mandreoli, R. Martoglia, G. Villani and W. Penzo, Flexible query answering on graph-modeled data. Proc. of EDBT, 2009.
16. M. Mongiovi, R. Natale, R. Giugno, A, Pulvirenti, and A. Ferro.A set-cover-based approach for inexact graph matching. Proc. of CSB, 2009.
17. R. Pinter, O. Rokhlenko, E. Yeger-Lotem and M. Ziv-Ukelson,Alignment of metabolic pathways, Bioinformatics, 2005.
18. H. Shang, Y. Zhang, X. Lin, and J. Yu, Taming verification hardness: an efficient algorithm for testing subgraph isomorphism. PVLDB, 2008.
19. Y. Tian and J. Patel,TALE: a tool for approximate large graph matching, Proc. of ICDE, 2008.
20. J. Ullmann,An algorithm for subgraph isomorphism. J. ACM, 1976.
21. X. Wang, A. Smalter, J. Huan, and G. Lushington, G-Hash: towards fast kernel-based similarity search in large graph databases, Proc. of EDBT, 2009.
22. X. Yan, P. Yu and J. Han,Graph indexing, a frequent structure-based approach. Proc. of SIGMOD, 2004.
23. S. Zhang, M. Hu, and J. Yang,Treepi: a novel graph indexing method. Proc. of ICDE, 2007.
24. S. Zhang, S. Li, and J. Yang,Gaddi: distance index based subgraph matching in biological networks. Proc. of EDBT, 2009.
25. Gene Ontology. http://www.geneontology.org/.