Efficient query processing on graph databases

ACM Transactions on Database Systems

Volumn 34, Issue 1, 2009, Pages

  Cheng, James ^a,d   Ke, Yiping ^b   Ng, Wilfred ^c  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

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

^d NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

Frequent subgraphs; Graph databases; Graph indexing; Graph query processing

Indexed keywords

ANSWER SET; FREQUENT SUBGRAPH; FREQUENT SUBGRAPHS; GRAPH DATABASE; GRAPH DATABASES; GRAPH INDEXING; GRAPH QUERY PROCESSING; MATCHING GRAPH; ORDERS OF MAGNITUDE; SUBGRAPH; SUPERGRAPH; THREE COMPONENT;

COSTS; INDEXING (OF INFORMATION); QUERY PROCESSING;

INDEXING (MATERIALS WORKING);

EID: 67649202530     PISSN: 03625915     EISSN: 15574644     Source Type: Journal    
DOI: 10.1145/1508857.1508859     Document Type: Article

References (39)

1. CHEN, Q., LIM, A., AND ONG, K. W. 2003. D(k)-index: An adaptive structural summary for graph-structured data. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 134-144.
2. CHENG, J., KE, Y., AND NG, W. 2006. Delta-Tolerance closed frequent itemsets. In Proceedings of the IEEE International Conference on Data Mining (ICDM'06), 139-148.
3. CHENG, J., KE, Y., AND NG, W. 2008a. Effective elimination of redundant association rules. Data Min. Knowl. Discov. 16, 2, 221-249.
4. CHENG, J., KE, Y., AND NG, W. 2008b. Maintaining frequent closed itemsets over a sliding window. J. Intell. Inf. Syst. 31, 3, 191-215.
5. CHENG, J., KE, Y., AND NG, W. 2008c. A survey on algorithms for mining frequent patterns over data streams. Knowl. Inf. Syst. J. 16, 1, 1-27.
6. CHENG, J., KE, Y., NG, W., AND LU, A. 2007. Fg-Index: Towards verification-free query processing on graph databases. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 857-872.
7. CHENG, J. AND NG, W. 2004. Xqzip: Querying compressed XML using structural indexing. In Proceedings of the International Conference on Extending Database Technology (EDBT'04), 219-236.
8. COOK, S. A. 1971. The complexity of theorem-proving procedures. In Proceedings of the Annual ACM Symposium on Theory of Computing (STOC'71), 151-158.
9. FALOUTSOS, C., MCCURLEY, K. S., AND TOMKINS, A. 2004. Fast discovery of connection sub- graphs. In Proceedings of the International SIGKDD Conference on Knowledge Discovery and Data Mining (KDD'04), 118-127.
10. GOLAB, L. AND OZSU, M. T. 2003. Issues in data stream management. SIGMOD Rec. 32, 2, 5-14.
11. GOLDMAN, R. AND WIDOM, J. 1997. Dataguides: Enabling query formulation and optimization in semistructured databases. In Proceedings of the International Conference on Very Large Databases (VLDB'97), 436-445.
12. GUTING, R. H. 1994. Graphdb: Modeling and querying graphs in databases. In Proceedings of the International Conference on Very Large Databases (VLDB'94), 297-308.
13. HE, H. AND SINGH, A. K. 2006. Closure-Tree: An index structure for graph queries. In Proceedings of the International Conference on Data Engineering (ICDE'06), 38.
14. HOLDER, L. B., COOK, D. J., AND DJOKO, S. 1994. Substucture discovery in the subdue system. In Proceedings of the Workshop at the International SIGKDD Conference on Knowledge Discovery and Data Mining (KDD'94), 169-180.
15. HUAN, J., WANG, W., BANDYOPADHYAY, D., SNOEYINK, J., PRINS, J., AND TROPSHA, A. 2004. Mining protein family specific residue packing patterns from protein structure graphs. In Proceedings of the Annual Conference on Research in Computational Molecular Biology (RECOMB'04), 308-315.
16. HUAN, J., WANG, W., PRINS, J., AND YANG, J. 2004. Spin: Mining maximal frequent subgraphs from graph databases. In Proceedings of the International SIGKDD Conference on Knowledge Discovery and Data Mining (KDD'04), 581-586.
17. INOKUCHI, A., WASHIO, T., AND MOTODA, H. 2000. An apriori-based algorithm for mining frequent substructures from graph data. In Proceedings of the European Conference on Principles of Data Mining and Knowledge Discovery (PKDD'00), 13-23.
18. JAMES, C. A., WEININGER, D., AND DELANY, J. 2003. Daylight theory manual daylight version 4.82. Daylight Chemical Information Systems, Inc.
19. JIANG, H., WANG, H., YU, P. S., AND ZHOU, S. 2007. Gstring: A novel approach for efficient search in graph databases. In Proceedings of the International Conference on Data Engineering (ICDE'07), 566-575.
20. KAUSHIK, R., BOHANNON, P., NAUGHTON, J. F., AND KORTH, H. F. 2002. Covering indexes for branching path queries. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 133-144.
21. KE, Y., CHENG, J., AND NG, W. 2007. Correlation search in graph databases. In Proceedings of the International SIGKDD Conference on Knowledge Discovery and Data Mining (KDD'07), 390-399.
22. KE, Y., CHENG, J., AND NG, W. 2008. Efficient correlation search from graph databases. IEEE Trans. Knowl. Data Eng. 20, 12, 1601-1615.
23. KOREN, Y., NORTH, S. C., AND VOLINSKY, C. 2006. Measuring and extracting proximity in networks. In Proceedings of the International SIGKDD Conference on Knowledge Discovery and Data Mining (KDD'06), 245-255.
24. MANKU, G. S. AND MOTWANI, R. 2002. Approximate frequency counts over data streams. In Proceedings of the International Conference on Very Large Databases (VLDB'02), 346-357.
25. MILO, T. AND SUCIU, D. 1999. Index structures for path expressions. In Proceedings of the International Conference on Database Theory (ICDT'99), 277-295.
26. NG, W. AND CHENG, J. 2007. An efficient index lattice for xml query evaluation. In Proceedings of the International Conference on Database Systems for Advanced Applications (DASFAA'07), 753-767.
27. SHASHA, D., WANG, J. T.-L., AND GIUGNO, R. 2002. Algorithmics and applications of tree and graph searching. In Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'02), 39-52.
28. 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 International Conference on Very Large Databases (VLDB'03), 975-986.
29. TONG, H. AND FALOUTSOS, C. 2006. Center-Piece subgraphs: Problem definition and fast solutions. In Proceedings of the International SIGKDD Conference on Knowledge Discovery and Data Mining (KDD'06), 404-413.
30. TONG, H., FALOUTSOS, C., GALLAGHER, B., AND ELIASSI-RAD, T. 2007. Fast best-effort pattern matching in large attributed graphs. In Proceedings of the International SIGKDD Conference on Knowledge Discovery and Data Mining (KDD'07), 737-746.
31. WILLIAMS, D. W., HUAN, J., AND WANG, W. 2007. Graph database indexing using structured graph decomposition. In Proceedings of the International Conference on Data Engineering (ICDE'07), 976-985.
32. YAN, X. AND HAN, J. 2002. Gspan: Graph-Based substructure pattern mining. In Proceedings of the IEEE International Conference on Data Mining (ICDM'02), 721-724.
33. YAN, X. AND HAN, J. 2003. Closegraph: Mining closed frequent graph patterns. In Proceedings of the International SIGKDD Conference on Knowledge Discovery and Data Mining (KDD'03), 286-295.
34. YAN, X., YU, P. S., AND HAN, J. 2005a. Graph indexing based on discriminative frequent structure analysis. ACM Trans. Database Syst. 30, 4, 960-993.
35. YAN, X., YU, P. S., AND HAN, J. 2005b. Substructure similarity search in graph databases. In Proceedings of the ACM SIGMOD International Conference on Management of Data, 766-777.
36. YU, J. X., CHONG, Z., LU, H., AND ZHOU, A. 2004. False positive or false negative: Mining frequent itemsets from high speed transactional data streams. In Proceedings of the International Conference on Very Large Databases (VLDB'04), 204-215.
37. ZHANG, N., OZSU, M. T., ILYAS, I. F., AND ABOULNAGA, A. 2006. Fix: Feature-Based indexing technique for XML documents. In Proceedings of the International Conference on Very Large Databases (VLDB'06), 259-270.
38. ZHANG, S., HU, M., AND YANG, J. 2007. Treepi: A novel graph indexing method. In Proceedings of the International Conference on Data Mining (ICDE'07), 966-975.
39. ZHAO, P., YU, J. X., AND YU, P. S. 2007. Graph indexing: Tree + delta >= graph. In Proceedings of the International Conference on Very Large Databases (VLDB'07), 938-949.