Fg-index: Towards verification-free query processing on graph databases

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2007, Pages 857-872

  Cheng, James ^a   Ke, Yiping ^a   Ng, Wilfred ^a   Lu, An ^a  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

Frequent subgraphs; Graph databases; Graph indexing; Graph querying

Indexed keywords

DATA STORAGE EQUIPMENT; GRAPH THEORY; INDEXING (OF INFORMATION); INFORMATION RETRIEVAL; RELATIONAL DATABASE SYSTEMS;

FREQUENT SUBGRAPHS; GRAPH DATABASES; GRAPH INDEXING; GRAPH QUERYING;

QUERY PROCESSING;

EID: 35448982399     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1247480.1247574     Document Type: Conference Paper

References (24)

1. IBM Synthetic Data Generation Code for Associations and Sequential Patterns, http://www.almaden.ibm.com/cs/projects/iis/hdb/Projects/data_mining/ mining.shtml, 1996.
2. Daylight theory manual - daylight version 4.9. Daylight Chemical Information Systems, Inc. www.daylight.com, 2006.
3. Q. Chen, A. Lim, and K. W. Ong. D(k)-index: an adaptive structural summary for graph-structured data. In Proc. of SIGMOD, pages 134-144, 2003.
4. J. Cheng, Y. Ke, and W. Ng. δ-tolerance closed frequent itemsets. In Proc. of ICDM, pages 139-148, 2006.
5. C.-W. Chung, J.-K. Min, and K. Shim. Apex: an adaptive path index for xml data. In Proc. of SIGMOD, pages 121-132, 2002.
6. D. J. Cook and L. B. Holder. Substructure discovery using minimum description length and background knowledge. Journal of Artificial Intelligence Research, 1:231-255, 1994.
7. S. A. Cook. The complexity of theorem-proving procedures. In Proc. of STOC '71: Proceedings of the third annual ACM symposium on Theory of computing, pages 151-158, 1971.
8. B. Cooper, N. Sample, M. J. Franklin, G. R. Hjaltason, and M. Shadmon. A fast index for semistructured data. In Proc. of VLDB, pages 341-350, 2001.
9. R. H. Güting. GraphDB: Modeling and querying graphs in databases. In Proc. of VLDB, pages 297-308, 1994.
10. R. Goldman and J. Widom. DataGuides: Enabling query formulation and optimization in semistructured databases. In Proc. of VLDB, pages 436-445, 1997.
11. L. Holder, D. Cook, and S. Djoko. Substructure discovery in the subdue system. In Proc. of KDD, pages 169-180, 1994.
12. J. Huan, W. Wang, J. Prins, and J. Yang. Spin: mining maximal frequent subgraphs from graph databases. In Proc. of KDD, pages 581-586, 2004.
13. A. Inokuchi, T. Washio, and H. Motoda. An apriori-based algorithm for mining frequent substructures from graph data. In Proc. of PKDD, pages 13-23, 2000.
14. R. Kaushik, P. Bohannon, J. F. Naughton, and H. F. Korth. Covering indexes for branching path queries. In Proc. of SIGMOD, pages 133-144, 2002.
15. M. Kuramochi and G. Karypis. Frequent subgraph discovery. In Proc. of ICDM, pages 313-320, 2001.
16. T. Milo and D. Suciu. Index structures for path expressions. In Proc. of ICDT, pages 277-295, 1999.
17. D. Shasha, J. T. L. Wang, and R. Giugno. Algorithmics and applications of tree and graph searching. In Proc. of PODS, pages 39-52, 2002.
18. S. Srinivasa and S. Kumar. A platform based on the multi-dimensional data model for analysis of bio-molecular structures. In Proc. of VLDB, pages 975-986, 2003.
19. J. R. UIlmann. An algorithm for subgraph isomorphism. J. ACM, 23(1):31-42, 1976.
20. C. Wang, W. Wang, J. Pei, Y. Zhu, and B. Shi. Scalable mining of large disk-based graph databases. In Proc. of KDD, pages 316-325, 2004.
21. D. Xin, J. Han, X. Yan, and H. Cheng. Mining compressed frequent-pattern sets. In Proc. of VLDB, pages 709-720, 2005.
22. X. Yan and J. Han. gspan: Graph-based substructure pattern mining. In Proc. of ICDM, pages 721-724, 2002.
23. X. Yan and J. Han. Closegraph: mining closed frequent graph patterns. In Proc. of KDD, pages 286-295, 2003.
24. X. Yan, P. S. Yu, and J. Han. Graph indexing based on discriminative frequent structure analysis. ACM Trans. Database Syst., 30(4):960-993, 2005.