Fast graph query processing with a low-cost index

VLDB Journal

Volumn 20, Issue 4, 2011, Pages 521-539

  Cheng, James ^a   Ke, Yiping ^b   Fu, Ada Wai Chee ^b   Yu, Jeffrey Xu ^b  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Graph indexing; Graph query processing; Supergraph queries

Indexed keywords

AS GRAPH; FAST INDEXING; FAST METHODS; FILTERING TECHNIQUE; GRAPH INDEXING; GRAPH QUERIES; INDEX CONSTRUCTION; KEY TECHNIQUES; LOW MAINTENANCE; PROJECTED DATABASE; QUERY GRAPH; QUERYING SYSTEMS; SUBGRAPH ISOMORPHISM; SUPERGRAPH;

INDEXING (OF INFORMATION); MAINTENANCE; QUERY LANGUAGES; QUERY PROCESSING;

INDEXING (MATERIALS WORKING);

EID: 79960442856     PISSN: 10668888     EISSN: 0949877X     Source Type: Journal    
DOI: 10.1007/s00778-010-0212-8     Document Type: Article

References (24)

1. Babcock, B., Babu, S., Datar, M., Motwani, R., Widom, J.: Models and issues in data stream systems. In: PODS, pp. 1-16. (2002).
2. Chen, C., Yan, X., Yu, P. S., Han, J., Zhang, D.-Q., Gu X.: Towards graph containment search and indexing. In: VLDB, pp. 926-937. (2007).
3. Cheng, J., Ke, Y., Ng, W., Lu, A.: Fg-index: towards verification-free query processing on graph databases. In: SIGMOD Conference, pp. 857-872. (2007).
4. Golab L., Özsu M. T.: Issues in data stream management. SIGMOD Rec. 32(2), 5-14 (2003).
5. He, H., Singh, A. K.: Closure-tree: an index structure for graph queries. In: ICDE, pp. 38. (2006).
6. Huan, J., Wang, W., Bandyopadhyay, D., Snoeyink, J., Prins, J., Tropsha A.: Mining protein family specific residue packing patterns from protein structure graphs. In: RECOMB, pp. 308-315. (2004).
7. Huan, J., Wang, W., Prins, J., Yang, J.: Spin: mining maximal frequent subgraphs from graph databases. In: KDD, pp. 581-586. (2004).
8. Inokuchi, A., Washio, T., Motoda, H.: An apriori-based algorithm for mining frequent substructures from graph data. In: PKDD, pp. 13-23. (2000).
9. James C. A., Weininger D., Delany J.: Daylight theory manual daylight version 4. 82. Daylight Chemical Information Systems Inc., Irvine, CA (2003).
10. Jiang, H., Wang, H., Yu, P. S., Zhou, S.: Gstring: a novel approach for efficient search in graph databases. In: ICDE, pp. 566-575. (2007).
11. Koren, Y., North, S. C., Volinsky, C.: Measuring and extracting proximity in networks. In: KDD, pp. 245-255. (2006).
12. Shang, H., Zhang, Y., Lin, X., Yu, J. X.: Taming verification hardness: an efficient algorithm for testing subgraph isomorphism. In: VLDB, (2008).
13. Shasha, D., Wang, J. T.-L., Giugno, R.: Algorithmics and applications of tree and graph searching. In: PODS, pp. 39-52. (2002).
14. Tong, H., Faloutsos, C.: Center-piece subgraphs: problem definition and fast solutions. In: KDD, pp. 404-413. (2006).
15. Urhan T., Franklin M. J.: Xjoin: a reactively-scheduled pipelined join operator. IEEE Data Eng. Bull. 23(2), 27-33 (2000).
16. Williams, D. W., Huan, J., Wang, W.: Graph database indexing using structured graph decomposition. In: ICDE, pp. 976-985. (2007).
17. Xin, D., Han, J., Yan, X., Cheng, H.: Mining compressed frequent-pattern sets. In: VLDB, pp. 709-720. (2005).
18. Yan, X., Han, J.: gspan: graph-based substructure pattern mining. In: ICDM, pp. 721-724. (2002).
19. Yan, X., Han, J.: Closegraph: mining closed frequent graph patterns. In: KDD, pp. 286-295. (2003).
20. Yan X., Yu P. S., Han J.: Graph indexing based on discriminative frequent structure analysis. ACM Trans. Database Syst. 30(4), 960-993 (2005).
21. Zhang, S., Hu, M., Yang, J.: Treepi: a novel graph indexing method. In: ICDE, pp. 966-975. (2007).
22. Zhang, S., Li, J., Gao, H., Zou, Z.: A novel approach for efficient supergraph query processing on graph databases. In: EDBT, pp. 204-215. (2009).
23. Zhao, P., Yu, J. X., Yu, P. S.: Graph indexing: tree + delta >= graph. In: VLDB, pp. 938-949. (2007).
24. Zou, L., 0002, L. C., Yu, J. X., Lu, Y.: A novel spectral coding in a large graph database. In: EDBT, pp. 181-192. (2008).