메뉴 건너뛰기




Volumn , Issue , 2007, Pages 566-575

GString: A novel approach for efficient search in graph databases

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; DATA PROCESSING; DATABASE SYSTEMS; GRAPH THEORY; MULTIMEDIA SERVICES; PROBLEM SOLVING; PROTEINS; QUERY PROCESSING; SEMANTICS; XML;

EID: 34548715799     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2007.367902     Document Type: Conference Paper
Times cited : (120)

References (15)
  • 1
    • 0021615874 scopus 로고
    • A dynamic index structure for spatial searching
    • A.Guttman. R-trees: A dynamic index structure for spatial searching. In SIGMOD, pages 47-57, 1984.
    • (1984) SIGMOD , pp. 47-57
    • Guttman, A.1    R-trees2
  • 2
    • 0032024433 scopus 로고    scopus 로고
    • A graph distance metric based on the maximal common subgraph
    • H. Bunke and K. Shearer. A graph distance metric based on the maximal common subgraph. Pattern Recognition, 19:255-259, 1998.
    • (1998) Pattern Recognition , vol.19 , pp. 255-259
    • Bunke, H.1    Shearer, K.2
  • 4
    • 33749602382 scopus 로고    scopus 로고
    • Closure-tree: An index structure for graph queries
    • H. He and A. K. Singh. Closure-tree: An index structure for graph queries. In ICDE, page 38, 2006.
    • (2006) ICDE , pp. 38
    • He, H.1    Singh, A.K.2
  • 5
    • 23844484183 scopus 로고    scopus 로고
    • Comparing graph representation of protein structure for mining familiy-specific residue-based packing motifs
    • J. Huan, D. Bandyopadhyay, W. Wang, and J. Snoeyink. Comparing graph representation of protein structure for mining familiy-specific residue-based packing motifs. Journal of Computational Biology (JCB), 12(6):657-671, 2005.
    • (2005) Journal of Computational Biology (JCB) , vol.12 , Issue.6 , pp. 657-671
    • Huan, J.1    Bandyopadhyay, D.2    Wang, W.3    Snoeyink, J.4
  • 7
    • 0016870630 scopus 로고
    • An alogrithm for subgraph isomorphism
    • J.Ullman. An alogrithm for subgraph isomorphism. Journal of the ACM, 23:31-42, 1976.
    • (1976) Journal of the ACM , vol.23 , pp. 31-42
    • Ullman, J.1
  • 8
    • 0036211171 scopus 로고    scopus 로고
    • Exploting local similarity for efficient indexing of paths in graph structured data
    • R. Kaushik, P.Shenoy, P.Bohannon, and E. Gudes. Exploting local similarity for efficient indexing of paths in graph structured data. In ICDE, pages 129-140, 2002.
    • (2002) ICDE , pp. 129-140
    • Kaushik, R.1    Shenoy, P.2    Bohannon, P.3    Gudes, E.4
  • 9
    • 29844432035 scopus 로고    scopus 로고
    • Strg-index: Spatio-temporal region graph indexing for large video databases
    • J. Lee, J. Oh, and S. Hwang. Strg-index: Spatio-temporal region graph indexing for large video databases. In SIGMOD, pages 718-729, 2005.
    • (2005) SIGMOD , pp. 718-729
    • Lee, J.1    Oh, J.2    Hwang, S.3
  • 10
    • 84994092452 scopus 로고    scopus 로고
    • Dataguides: Enabling query formulation and optimization in semistructured databases
    • R.Goldman and J.Widom. Dataguides: Enabling query formulation and optimization in semistructured databases. In VLDB, pages 436-145, 1997.
    • (1997) VLDB , pp. 436-145
    • Goldman, R.1    Widom, J.2
  • 11
    • 0036040082 scopus 로고    scopus 로고
    • Algorithmics and applications of tree and graph searching
    • D. Shasha, J. T. Wang, and R. Giugno. Algorithmics and applications of tree and graph searching. In PODS, pages 39-52, 2002.
    • (2002) PODS , pp. 39-52
    • Shasha, D.1    Wang, J.T.2    Giugno, R.3
  • 12
    • 27344452252 scopus 로고    scopus 로고
    • On the sequencing of tree structures for XML indexing
    • H. Wang and X. Meng. On the sequencing of tree structures for XML indexing. In ICDE, pages 372-383, 2005.
    • (2005) ICDE , pp. 372-383
    • Wang, H.1    Meng, X.2
  • 13
    • 1142267353 scopus 로고    scopus 로고
    • ViST: A dynamic index method for querying XML data by tree structures
    • H. Wang, S. Park, W. Fan, and P. S. Yu. ViST: a dynamic index method for querying XML data by tree structures. In SIGMOD, 2003.
    • (2003) SIGMOD
    • Wang, H.1    Park, S.2    Fan, W.3    Yu, P.S.4
  • 14
    • 3142736597 scopus 로고    scopus 로고
    • Graph indexing: A frequent structure-based approach
    • X. Yan, P. S. Yu, and J. Han. Graph indexing: A frequent structure-based approach. In SIGMOD, pages 335-346, 2004.
    • (2004) SIGMOD , pp. 335-346
    • Yan, X.1    Yu, P.S.2    Han, J.3
  • 15
    • 29844431949 scopus 로고    scopus 로고
    • Substructure similarity search in graph databases
    • X. Yan, P. S. Yu, and J. Han. Substructure similarity search in graph databases. In SIGMOD, pages 766-777, 2005.
    • (2005) SIGMOD , pp. 766-777
    • Yan, X.1    Yu, P.S.2    Han, J.3


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