Graph indexing based on discriminative frequent structure analysis

ACM Transactions on Database Systems

Volumn 30, Issue 4, 2005, Pages 960-993

  Yan, Xifeng ^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

Frequent pattern; Graph database; Index

Indexed keywords

DATA MINING; DATA STRUCTURES; GRAPH THEORY; MATHEMATICAL MODELS; PROTEINS; XML;

DATABASE INDEXING; FREQUENT PATTERN; GRAPH DATABASE; INDEX;

INDEXING (OF INFORMATION);

EID: 33745185086     PISSN: 03625915     EISSN: 03625915     Source Type: Journal    
DOI: 10.1145/1114244.1114248     Document Type: Conference Paper

References (29)

1. AGRAWAL, R. AND SRIKANT, R. 1994. Fast algorithms for mining association rules. In Proceedings of the 1994 International Conference on Very Large Data Bases (VLDB'94) (Santiago, Chile). 487-499.
2. ALON, N. AND SPENCER, J. 1992. The Probabilistic Method. Wiley, New York, NY.
3. BERETTI, S., BIMBO, A., AND VICARIO, E. 2001. Efficient matching and indexing of graph models in content-based retrieval. IEEE Trans. Patt. Anal. Mach. Intell. 23, 1089-1105.
4. BORGELT, C. AND BERTHOLD, M. 2002. Mining molecular fragments: Finding relevant substructures of molecules. In Proceedings of the 2002 International Conference on Data Mining (ICDM'02) (Maebashi, Japan). 211-218.
5. CHEN, Q., LIM, A., AND ONG, K. 2003. D(k)-index: An adaptive structural summary for graph-structured data. In Proceedings of the 2003 ACM-SIOMOD International Conference on Management of Data (SIGMOD'03) (San Diego, CA). ACM, New York, 134-144.
6. CHUNG, C., MIN, J., AND SHIM, K. 2002. Apex: An adaptive path index for XML data. In Proceedings of the 2002 ACM-SIGMOD International Conference on Management of Data (SIGMOD'02) (Madison, WI). ACM, New York, 121-132.
7. COOK, S. 1971. The complexity of theorem-proving procedures. In Proceedings of the 3rd ACM Symposium on Theory of Computing (STOC'71) (Shaker Heights, OH). ACM, New York.
8. COOPER, B., SAMPLE, N., FRANKLIN, M., HJALTASON, G., AND SHADMON, M. 2001. A fast index for semistructured data. In Proceedings of the 2001 International Conference on Very Large Data Bases (VLDB'Ol) (Roma, Italy). 341-350.
9. GOLDMAN, R. AND WIDOM, J. 1997. Dataguides: Enabling query formulation and optimization in semistructured databases. In Proceedings of the 1997 International Conference on Very Large Data Bases (VLDB'97) (Athens, Greece). 436-445.
10. 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) (Seattle, WA). 169-180.
11. INOKUCHI, A., WASHIO, T., AND MOTODA, H. 2000. An apriori-based algorithm for mining frequent substructures from graph data. In Proceedings of the 2000 European Symposium Principle of Data Mining and Knowledge Discovery (PKDD'00) (Lyon, France). 13-23.
12. JAMES, C., WEININGER, D., AND DELANY, J. 2003. Daylight theory manual daylight version 4.82. Daylight Chemical Information Systems, Inc.
13. KAUSHIK, R., SHENOY, P., BOHANNON, P., AND GUDES, E. 2002. Exploiting local similarity for efficient indexing of paths in graph structured data. In Proceedings of the 2000 International Conference on Data Engineering (ICDE'02) (San Jose, CA). 129-140.
14. KURAMOCHI, M. AND KARYPIS, G. 2001. Frequent subgraph discovery. In Proceedings of the 2001 International Conference on Data Mining (ICDM'01) (San Jose, CA). 313-320.
15. KURAMOCHI, M. AND KARYPIS, G. 2004. Finding frequent patterns in a large sparse graph. In Proceedings of the 2004 SIAM International Conference on Data Mining (SDM'04) (Orlando, FL).
16. MADEJ, T., GIBRAT, J., AND BRYANT, S. 1995. Threading a database of protein cores. Proteins 3-2, 289-306.
17. MILO, T. AND SUCIU, D. 1999. Index Structures for Path Expressions. Lecture Notes in Computer Science vol. 1540. Springer-Verlag, New York, 277-295.
18. PETRAKIS, E. AND FALOUTSOS, C. 1997. Similarity searching in medical image databases. Knowl. Data Eng. 9, 3, 435-447.
19. SAVASERE, A., OMIECINSKI, E., AND NAVATHE, S. 1995. An efficient algorithm for mining association rules in large databases. In Proceedings of the 1995 International Conference Very Large Data. Bases (VLDB'95) (Zurich, Switzerland). 432-443.
20. SHASHA, D., WANG, J., AND GIUGNO, R. 2002. Algorithmics and applications of tree and graph searching. In Proceedings of the 21th ACM Symposium on Principles of Database Systems (PODS'02) (Madison, WI). ACM, New York, 39-52.
21. SHOKOUFANDEH, A., DICKINSON, S., SIDDIQI, K., AND ZUCKER, S. 1999. Indexing using a spectral encoding of topological structure. In Proceedings of the IEEE International Conference on Computer Vision and Pattern Recognition (CVPR'99) (Fort Collins, CO). IEEE Computer Society Press, Los Alamitos, CA, 2491-2497.
22. SHINIVASA, S. AND KUMAR, S. 2003. A platform based on the multidimensional data model for analysis of bio-molecular structures. In Proceedings of the 2003 International Conference on Very Large Data Bases (VLDB'03) (Berlin, Germany). 975-986.
23. TOIVONEN, H. 1996. Sampling large databases for association rules. In Proceedings of the 1996 International Conference on Very Large Data Bases (VLDB'96) (Bombay, India). 134-145.
24. VANETIK, N., GUDES, E., AND SHIMONY, S. E. 2002. Computing frequent graph patterns from semistructured data. In Proceedings of the 2002 International Conference on Data Mining (ICDM'02) (Maebashi, Japan). 458-465.
25. WASHIO, T. AND MOTODA, H. 2003. State of the art of graph-based data mining. SIGKDD Explorations 5, 59-68.
26. WOLFSON, H. AND RIGOUTSOS, I. 1997. Geometric hashing: An introduction. IEEE Comput. Sci. Eng. 4, 10-21.
27. YAN, X. AND HAN, J. 2002. gSpan: Graph-based substructure pattern mining. In Proceedings of the 2002 International Conference on Data Mining (ICDM'02) (Maebashi, Japan). 721-724.
28. YAN, X. AND HAN, J. 2003. CloseGraph: Mining closed frequent graph patterns. In Proceedings of the 2003 International Conference on Knowledge Discovery and Data Mining (KDD'03) (Washington, DC). 286-295.
29. ZAKI, M. AND GOUDA, K. 2003. Fast vertical mining using diffsets. In Proceedings of the 2003 International Conference on Knowledge Discovery and Data Mining (KDD'03) (Washington, DC). 326-335.