메뉴 건너뛰기




Volumn , Issue , 2011, Pages 1241-1242

iGraph in action: Performance analysis of disk-based graph indexing techniques

Author keywords

graph indexing techniques; performance analysis; visualization

Indexed keywords

GRAPH THEORY; INDEXING (OF INFORMATION);

EID: 79960009791     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1989323.1989464     Document Type: Conference Paper
Times cited : (10)

References (11)
  • 3
    • 79959952721 scopus 로고    scopus 로고
    • Jchempaint. http://http://sourceforge.net/projects/cdk.
    • Jchempaint
  • 4
    • 79959947080 scopus 로고    scopus 로고
    • The pubchem project. pubchem.ncbi.nlm.nih.gov
    • The pubchem project. pubchem.ncbi.nlm.nih.gov.
  • 5
    • 35448982399 scopus 로고    scopus 로고
    • Fg-index: Towards verification-free query processing on graph databases
    • J. Cheng, Y. Ke, W. Ng, and A. Lu. Fg-index: towards verification-free query processing on graph databases. In SIGMOD, 2007.
    • (2007) SIGMOD
    • Cheng, J.1    Ke, Y.2    Ng, W.3    Lu, A.4
  • 6
    • 79959985947 scopus 로고    scopus 로고
    • igraph: A framework for comparisons of disk-based graph indexing techniques
    • W.-S. Han, J. Lee, M.-D. Pham, and J. X. Yu. igraph: A framework for comparisons of disk-based graph indexing techniques. PVLDB, 3(1), 2010.
    • (2010) PVLDB , vol.3 , Issue.1
    • Han, W.-S.1    Lee, J.2    Pham, M.-D.3    Yu, J.X.4
  • 7
    • 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, 2006.
    • (2006) ICDE
    • He, H.1    Singh, A.K.2
  • 8
    • 84859197018 scopus 로고    scopus 로고
    • Taming verification hardness: An efficient algorithm for testing subgraph isomorphism
    • H. Shang, Y. Zhang, X. Lin, and J. X. Yu. Taming verification hardness: an efficient algorithm for testing subgraph isomorphism. PVLDB, 1(1), 2008.
    • (2008) PVLDB , vol.1 , Issue.1
    • Shang, H.1    Zhang, Y.2    Lin, X.3    Yu, J.X.4
  • 9
    • 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, 2004.
    • (2004) SIGMOD
    • Yan, X.1    Yu, P.S.2    Han, J.3
  • 10
    • 85011066999 scopus 로고    scopus 로고
    • Graph indexing: Tree + delta >= graph
    • P. Zhao, J. X. Yu, and P. S. Yu. Graph indexing: Tree + delta >= graph. In VLDB, 2007.
    • (2007) VLDB
    • Zhao, P.1    Yu, J.X.2    Yu, P.S.3
  • 11
    • 43349090276 scopus 로고    scopus 로고
    • A novel spectral coding in a large graph database
    • L. Zou, L. Chen, J. X. Yu, and Y. Lu. A novel spectral coding in a large graph database. In EDBT, 2008.
    • (2008) EDBT
    • Zou, L.1    Chen, L.2    Yu, J.X.3    Lu, Y.4


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