메뉴 건너뛰기




Volumn 4947 LNCS, Issue , 2008, Pages 141-155

Summarization graph indexing: Beyond frequent structure-based approach

Author keywords

[No Author keywords available]

Indexed keywords

ARSENIC COMPOUNDS; CHEMICAL COMPOUNDS; DATA STRUCTURES; DATABASE SYSTEMS; FILE ORGANIZATION; INDEXING (OF INFORMATION); MARKUP LANGUAGES; SIGNAL FILTERING AND PREDICTION;

EID: 47249133278     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78568-2_13     Document Type: Conference Paper
Times cited : (12)

References (23)
  • 1
    • 47249084891 scopus 로고    scopus 로고
    • Available at
    • Available at: http://amalfi.dis.unina.it/graph
  • 3
    • 33646400809 scopus 로고    scopus 로고
    • Cai, D., Shao, Z., He, X., Yan, X., Han, J.: Community mining from multi-relational networks. In: Jorge, A.M., Torgo, L., Brazdil, P.B., Camacho, R., Gama, J. (eds.) PKDD 2005. LNCS (LNAI), 3721, Springer, Heidelberg (2005)
    • Cai, D., Shao, Z., He, X., Yan, X., Han, J.: Community mining from multi-relational networks. In: Jorge, A.M., Torgo, L., Brazdil, P.B., Camacho, R., Gama, J. (eds.) PKDD 2005. LNCS (LNAI), vol. 3721, Springer, Heidelberg (2005)
  • 4
    • 35448982399 scopus 로고    scopus 로고
    • Cheng, J., Ke, Y., Ng, W., Lu, A.: f g-index: Towards verification-free query processing on graph databases. In: SIGMOD (2007)
    • Cheng, J., Ke, Y., Ng, W., Lu, A.: f g-index: Towards verification-free query processing on graph databases. In: SIGMOD (2007)
  • 6
    • 34548740153 scopus 로고    scopus 로고
    • Huan, D.W.W.J., Wang, W.: Graph database indexing using structured graph decomposition. In: ICDE (2007)
    • Huan, D.W.W.J., Wang, W.: Graph database indexing using structured graph decomposition. In: ICDE (2007)
  • 7
    • 0008690083 scopus 로고    scopus 로고
    • Department of Computing Science, University of Alberta
    • Fortin, S.: The graph isomorphism problem. Department of Computing Science, University of Alberta (1996)
    • (1996) The graph isomorphism problem
    • Fortin, S.1
  • 8
    • 34548715799 scopus 로고    scopus 로고
    • Jiang, P.Y.H., Wang, H., Zhou, S.: Gstring: A novel approach for efficient search in graph databases. In: ICDE (2007)
    • Jiang, P.Y.H., Wang, H., Zhou, S.: Gstring: A novel approach for efficient search in graph databases. In: ICDE (2007)
  • 9
    • 33749602382 scopus 로고    scopus 로고
    • He, H., Singh, A.K.: Closure-tree: An index structure for graph queries. In: ICDE (2006)
    • He, H., Singh, A.K.: Closure-tree: An index structure for graph queries. In: ICDE (2006)
  • 10
    • 84974733299 scopus 로고    scopus 로고
    • Inokuchi, A., Washio, T., Motoda, H.: An apriori-based algorithm for mining frequent substructures from graph data. In: Zighed, A.D.A., Komorowski, J., Żytkow, J.M. (eds.) PKDD 2000. LNCS (LNAI), 1910, Springer, Heidelberg (2000)
    • Inokuchi, A., Washio, T., Motoda, H.: An apriori-based algorithm for mining frequent substructures from graph data. In: Zighed, A.D.A., Komorowski, J., Żytkow, J.M. (eds.) PKDD 2000. LNCS (LNAI), vol. 1910, Springer, Heidelberg (2000)
  • 12
    • 36849009202 scopus 로고    scopus 로고
    • Ke, Y., Cheng, J., Ng, W.: Correlation search in graph databases. In: SIGKDD (2007)
    • Ke, Y., Cheng, J., Ng, W.: Correlation search in graph databases. In: SIGKDD (2007)
  • 13
    • 78149312583 scopus 로고    scopus 로고
    • Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: ICDM (2001)
    • Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: ICDM (2001)
  • 14
    • 78149312583 scopus 로고    scopus 로고
    • Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: ICDM (2001)
    • Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: ICDM (2001)
  • 16
    • 0036040082 scopus 로고    scopus 로고
    • Shasha, D., Wang, J.T.-L., Giugno, R.: Algorithmics and applications of tree and graph searching. In: PODS (2002)
    • Shasha, D., Wang, J.T.-L., Giugno, R.: Algorithmics and applications of tree and graph searching. In: PODS (2002)
  • 17
    • 0036532845 scopus 로고    scopus 로고
    • Signature-based structures for objects with set-valued attributes
    • Tousidou, E., Bozanis, P., Manolopoulos, Y.: Signature-based structures for objects with set-valued attributes. Inf. Syst. 27(2) (2002)
    • (2002) Inf. Syst , vol.27 , Issue.2
    • Tousidou, E.1    Bozanis, P.2    Manolopoulos, Y.3
  • 18
    • 5344244908 scopus 로고    scopus 로고
    • Chemical similarity searching
    • Willett., P.: Chemical similarity searching. J. Chem. Inf. Comput. Sci. 38(6) (1998)
    • (1998) J. Chem. Inf. Comput. Sci , vol.38 , Issue.6
    • Willett, P.1
  • 20
    • 3142736597 scopus 로고    scopus 로고
    • Yan, X., Yu, P.S., Han, J.: Graph indexing: A frequent structure-based approach. In: SIGMOD (2004)
    • Yan, X., Yu, P.S., Han, J.: Graph indexing: A frequent structure-based approach. In: SIGMOD (2004)
  • 21
    • 85146199250 scopus 로고    scopus 로고
    • Zhang, N., Ö zsu, M.T., Ilyas, I.F., Aboulnaga, A.: Fix: Feature-based indexing technique for XML documents. In: VLDB (2006)
    • Zhang, N., Ö zsu, M.T., Ilyas, I.F., Aboulnaga, A.: Fix: Feature-based indexing technique for XML documents. In: VLDB (2006)
  • 22
    • 34548731280 scopus 로고    scopus 로고
    • Zhang, S., Hu, M., Yang, J.: Treepi: A novel graph indexing method. In: ICDE (2007)
    • Zhang, S., Hu, M., Yang, J.: Treepi: A novel graph indexing method. In: ICDE (2007)
  • 23
    • 85011066999 scopus 로고    scopus 로고
    • Graph Indexing: Tree + Delta >=Graph
    • VLDB 2007
    • Zhao, P., Yu, J.X., Yu, P.S.: Graph Indexing: Tree + Delta >=Graph. In: VLDB (2007)
    • Zhao, P.1    Yu, J.X.2    Yu, P.S.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.