Querying large graph databases

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5982 LNCS, Issue PART 2, 2010, Pages 487-488

  Ke, Yiping ^a   Cheng, James ^b   Yu, Jeffrey Xu ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION DOMAINS; APPROXIMATE MATCHING; AS GRAPH; COMPLEX DATA; DATABASE AND DATA MINING; FOOD WEBS; GRAPH DATA; GRAPH DATABASE; LARGE GRAPHS; P2P NETWORK; PROTEIN STRUCTURES; QUERY PROCESSING TECHNIQUES; RESEARCH EFFORTS; RESEARCH PROBLEMS; SOCIAL NETWORKS; STRUCTURAL SIMILARITY; SUBGRAPHS; SUPERGRAPH; WEB GRAPHS; WIDE SPECTRUM;

CHEMICAL COMPOUNDS; CHEMICAL CONTAMINATION; DISTRIBUTED COMPUTER SYSTEMS; ECOLOGY; INDUSTRIAL RESEARCH; PEER TO PEER NETWORKS; QUERY PROCESSING;

DATABASE SYSTEMS;

EID: 78650470451     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-12098-5_57     Document Type: Conference Paper

References (24)

1. Shasha, D., Wang, J.T.L., Giugno, R.: Algorithmics and applications of tree and graph searching. In: PODS, pp. 39-52 (2002).
2. Yan, X., Yu, P.S., Han, J.: Graph indexing based on discriminative frequent structure analysis. ACM Trans. Database Syst. 30(4), 960-993 (2005).
3. He, H., Singh, A.K.: Closure-tree: An index structure for graph queries. In: ICDE, p. 38 (2006).
4. Cheng, J., Ke, Y., Ng, W., Lu, A.: Fg-index: towards verification-free query processing on graph databases. In: SIGMOD, pp. 857-872 (2007).
5. Zhang, S., Hu, M., Yang, J.: Treepi: A novel graph indexing method. In: ICDE, pp. 966-975 (2007).
6. 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).
7. Williams, D.W., Huan, J., Wang, W.: Graph database indexing using structured graph decomposition. In: ICDE, pp. 976-985 (2007).
8. Zhao, P., Yu, J.X., Yu, P.S.: Graph Indexing: Tree + Delta >= Graph. In: VLDB, pp. 938-949 (2007).
9. Zou, L., Chen, L., Yu, J.X., Lu, Y.: A novel spectral coding in a large graph database. In: EDBT, pp. 181-192 (2008).
10. Shang, H., Zhang, Y., Lin, X., Yu, J.X.: Taming verification hardness: An efficient algorithm for testing subgraph isomorphism. In: VLDB, pp. 364-375 (2008).
11. 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).
12. 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).
13. Holder, L., Cook, D., Djoko, S.: Substucture Discovery in the SUBDUE System. In: KDD Workshop, pp. 169-180 (1994).
14. Raymond, J.W., Gardiner, E.J., Willett, P.: RASCAL: calculation of graph similarity using maximum common edge subgraphs. Comput. J. 45(6), 631-644 (2002).
15. Yan, X., Yu, P.S., Han, J.: Substructure similarity search in graph databases. In: SIGMOD Conference, pp. 766-777 (2005).
16. Ke, Y., Cheng, J., Ng, W.: Correlation search in graph databases. In: KDD, pp. 390-399 (2007).
17. Ke, Y., Cheng, J., Yu, J.X.: Top-k correlative graph mining. In: SDM, pp. 1038-1049 (2009).
18. Ke, Y., Cheng, J., Yu, J.X.: Efficient discovery of frequent correlated subgraph pairs. In: ICDM, pp. 239-248 (2009).
19. Faloutsos, C., McCurley, K.S., Tomkins, A.: Fast discovery of connection subgraphs. In: KDD, pp. 118-127 (2004).
20. Tong, H., Faloutsos, C.: Center-piece subgraphs: problem definition and fast solutions. In: KDD, pp. 404-413 (2006).
21. Koren, Y., North, S.C., Volinsky, C.: Measuring and extracting proximity in networks. In: KDD, pp. 245-255 (2006).
22. Cheng, J., Ke, Y., Ng, W., Yu, J.X.: Context-aware object connection discovery in large graphs. In: ICDE, pp. 856-867 (2009).
23. Tian, Y., Patel, J.M.: Tale: A tool for approximate large graph matching. In: ICDE, pp. 963-972 (2008).
24. Tong, H., Faloutsos, C., Gallagher, B., Eliassi-Rad, T.: Fast best-effort pattern matching in large attributed graphs. In: KDD, pp. 737-746 (2007).