Feature-based similarity search in graph structures

ACM Transactions on Database Systems

Volumn 31, Issue 4, 2006, Pages 1418-1453

  Yan, Xifeng ^a,c   Zhu, Feida ^a,c   Yu, Philip S ^b   Han, Jiawei ^a,c  

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

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

^c University of Illinois at Urbana Champaign ^*  (United States)

Author keywords

Complexity; Graph database; Index; Similarity search

Indexed keywords

FEATURE-BASED FILTERING; GRAPH DATABASES; GRAPH STRUCTURES; SIMILARITY SEARCH;

ALGORITHMS; COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; DATABASE SYSTEMS; GRAPH THEORY; INDEXING (OF INFORMATION);

ONLINE SEARCHING;

EID: 33846200039     PISSN: 03625915     EISSN: 15574644     Source Type: Journal    
DOI: 10.1145/1189769.1189777     Document Type: Conference Paper

References (29)

1. BERETTI, S., BIMBO, A., AND VICARIO, E. 2001. Efficient matching and indexing of graph models in content based retrieval. IEEE Trans. Patt. Analys. Mach. Intell. 23, 1089-1105.
2. BERMAN, H., WESTBROOK, J., FENG, Z., GILLILAND, G., BHAT, T., WEISSIG, H., SHINDYALOV, I., AND BOURNE, P. 2000. The protein data bank. Nucl. Acids Res. 28, 235-242.
3. BUNKE, H. AND SHEARER, K. 1998. A graph distance metric based on the maximal common subgraph. Patt. Recogn. Lett. 19, 255-259.
4. ERICKSON, J. 1996. Lower bounds for fundamental geometric problems. Ph.D. dissertation. University of California at Berkeley, Berkley, CA.
5. FEIGE, U. 1998. A threshold of ln n for approximating set cover. J. ACM 45, 634-652.
6. GAREY, M. AND JOHNSON, D. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman & Co., New York, NY.
7. GIUGNO, R. AND SHASHA, D. 2002. Graphgrep: A fast and universal method for querying graphs. Proceedings of the 2002 International Conference on Pattern Recognition (ICPR'02). 112-115.
8. GRAVANO, L., IPEIROTIS, P., JAGADISH, H., KOUDAS, N., MUTHUKRISHNAN, S., PIETARINEN, L., AND SRIVASTAVA, D. 2001. Using q-grams in a dbms for approximate string processing. Data Eng. Bull. 24, 28-37.
9. HAGADONE, T. 1992. Molecular substructure similarity searching: Efficient retrieval in two-dimensional structure databases. J. Chem. Inf. Comput. Sci. 32, 515-521.
10. HOCHBAUM, D. 1997. Approximation Algorithms for NP-Hard Problems. PWS Publishing, Boston, MA.
11. HOLDER, L., COOK, D., AND DJOKO, S. 1994. Substructure discovery in the subdue system. In Proceedings of the AAAI'94 Workshop on Knowledge Discovery in Databases (KDD'94). 169-180.
12. KAILING, K., KRIEGEL, H., SCHNAUER, S., AND SEIDL, T. 2004. Efficient similarity search for hierarchical data in large databases. In Proceedings of the 9th International Conference on Extending Database Technology (EDBT'04). 676-693.
13. KANEHISA, M. AND GOTO, S. 2000. KEGG: Kyoto encyclopedia of genes and genomes. Nucl. Acids Res. 28, 27-30.
14. KISLICYN, S. S. 1964. On the selection of the kth element of an ordered set by pairwise comparisons. Sibirskii Mat. Z. (in Russian) 5, 557-564.
15. KURAMOCHI, M. AND KARYPIS, G. 2001. Frequent subgraph discovery. In Proceedings of the 2001 International Conference on Data Mining (ICDM'01). 313-320.
16. MESSMER, B. AND BUNKE, H. 1998. A new algorithm for error-tolerant subgraph isomorphism detection. IEEE Trans. Patt. Analys. Mach. Intell. 20, 493-504.
17. NAVARRO, G. 2001. A guided tour to approximate string matching. ACM Comput. Surv. 33, 31-88.
18. NILSSON, N. 1980. Principles of Artificial Intelligence. Morgan Kaufmann, Palo Alto, CA.
19. PADBERG, M. 1995. Linear Optimization and Extensions. Springer-Verlag, Berlin, Germany.
20. PETRAKIS, E. AND FALOUTSOS, C. 1997. Similarity searching in medical image databases. Knowl. Data Eng. 9, 3, 435-447.
21. RAYMOND, J., GARDINER, E., AND WILLETT, P. 2002. Rascal: Calculation of graph similarity using maximum common edge subgraphs. Comput. J. 45, 631-644.
22. SHASHA, D., WANG, J., AND GIUGNO, R. 2002. Algorithmes and applications of tree and graph searching. In Proceedings of the 21th ACM Symposium on Principles of Database Systems (PODS'02). 39-52.
23. SRINIVASA, S. AND KUMAR, S. 2003. A platform based on the multi-dimensional data model for analysis of bio-molecular structures. In Proceedings of the 2003 International Conference on Very Large Data Bases (VLDB'03). 975-986.
24. UKKONEN, E. 1992. Approximate string matching with q-grams and maximal matches. Theoret. Comput. Sci. 191-211.
25. ULLMANN, J. 1977. Binary n-gram technique for automatic correction of substitution, deletion, insertion, and reversal errors in words. Comput. J. 20, 141-147.
26. WANG, J., ZHANG, K., JEONG, K., AND SHASHA, D. 1994. A system for approximate tree matching. IEEE Trans. Knowl. Data Eng. 6, 559-571.
27. WILLETT, P., BARNARD, J., AND DOWNS, G. 1998. Chemical similarity searching. J. Chem. Inf. Comput. Sci. 38, 983-996.
28. YAN, X., YU, P., AND HAN, J. 2004. Graph indexing: A frequent structure-based approach. In Proceedings of the 2004 ACM International Conference on Management of Data (SIGMOD'04). 335-346.
29. YAN, X., YU, P., AND HAN, J. 2005. Substructure similarity search in graph databases. In Proceedings of the 2005 ACM International Conference on Management of Data (SIGMOD'05). 766-777.