메뉴 건너뛰기




Volumn 3, Issue 1, 2010, Pages 449-459

iGraph: A framework for comparisons of disk based graph indexing techniques

Author keywords

[No Author keywords available]

Indexed keywords

CHEMICAL COMPOUNDS; QUERY PROCESSING; SET THEORY; VIRTUAL STORAGE;

EID: 79959985947     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1920841.1920901     Document Type: Article
Times cited : (108)

References (31)
  • 1
    • 85038454347 scopus 로고    scopus 로고
    • http://www.seagate.com.
  • 2
    • 85038455314 scopus 로고    scopus 로고
    • http://msdn.microsoft.com/enus/ library/cc644950(VS.85).aspx.
  • 3
    • 85038464840 scopus 로고    scopus 로고
    • Aids antiviral dataset used for gindex
    • Aids antiviral dataset used for gindex. http://www.xifengyan.net/software.htm.
  • 4
    • 85038463988 scopus 로고    scopus 로고
    • Gaston
    • Gaston. http://www.liacs.nl/ snijssen/gaston/iccs.html.
  • 5
    • 85038456766 scopus 로고    scopus 로고
    • gboost
    • gboost. http://www.kyb.mpg.de/bs/people/nowozin/gboost/.
  • 6
    • 85038454414 scopus 로고    scopus 로고
    • Graphgen-a synthetic graph data generator
    • Graphgen-a synthetic graph data generator. http://www.cse.ust.hk/graphgen/.
  • 8
    • 85038465764 scopus 로고    scopus 로고
    • The pubchem project
    • The pubchem project. pubchem.ncbi.nlm.nih.gov.
  • 9
    • 85038476848 scopus 로고    scopus 로고
    • Vf2 library
    • Vf2 library. http://amalfi.dis.unina.it/graph/db/vflib-2.0/.
  • 12
    • 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, pages 857-872, 2007.
    • (2007) SIGMOD , pp. 857-872
    • Cheng, J.1    Ke, Y.2    Ng, W.3    Lu, A.4
  • 14
    • 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, pages 38-49, 2006.
    • (2006) ICDE , pp. 38-49
    • He, H.1    Singh, A.K.2
  • 15
    • 78149328300 scopus 로고    scopus 로고
    • Efficient mining of frequent subgraphs in the presence of isomorphism
    • J. Huan, W. Wang, and J. Prins. Efficient mining of frequent subgraphs in the presence of isomorphism. In ICDM, page 549, 2003.
    • (2003) ICDM , pp. 549
    • Huan, J.1    Wang, W.2    Prins, J.3
  • 16
    • 32344442835 scopus 로고    scopus 로고
    • Sober: statistical model-based bug localization
    • C. Liu, X. Yan, L. Fei, J. Han, and S. P. Midkiff. Sober: statistical model-based bug localization. In ESEC/FSE, pages 286-295, 2005.
    • (2005) ESEC/FSE , pp. 286-295
    • Liu, C.1    Yan, X.2    Fei, L.3    Han, J.4    Midkiff, S.P.5
  • 17
    • 0031141283 scopus 로고    scopus 로고
    • Similarity searching in medical image databases
    • E. G. M. Petrakis and C. Faloutsos. Similarity searching in medical image databases. TKDE, 9(3), 1997.
    • (1997) TKDE , vol.9 , Issue.3
    • Petrakis, E.G.M.1    Faloutsos, C.2
  • 20
    • 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):364-375, 2008.
    • (2008) PVLDB , vol.1 , Issue.1 , pp. 364-375
    • Shang, H.1    Zhang, Y.2    Lin, X.3    Yu, J.X.4
  • 21
    • 0036040082 scopus 로고    scopus 로고
    • Algorithmics and applications of tree and graph searching
    • D. Shasha, J. T.-L. 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.-L.2    Giugno, R.3
  • 22
    • 52649126146 scopus 로고    scopus 로고
    • Tale: A tool for approximate large graph matching
    • Y. Tian and J. M. Patel. Tale: A tool for approximate large graph matching. In ICDE, pages 963-972, 2008.
    • (2008) ICDE , pp. 963-972
    • Tian, Y.1    Patel, J.M.2
  • 23
    • 0016870630 scopus 로고
    • An algorithm for subgraph isomorphism
    • J. R. Ullmann. An algorithm for subgraph isomorphism. J. ACM, 23(1):31-42, 1976.
    • (1976) J. ACM , vol.23 , Issue.1 , pp. 31-42
    • Ullmann, J.R.1
  • 24
    • 33646435063 scopus 로고    scopus 로고
    • A quantitative comparison of the subgraph miners mofa, gspan, ffsm, and gaston
    • M. Wörlein, T. Meinl, I. Fischer, and M. Philippsen. A quantitative comparison of the subgraph miners mofa, gspan, ffsm, and gaston. In PKDD, pages 392-403, 2005.
    • (2005) PKDD , pp. 392-403
    • Wörlein, M.1    Meinl, T.2    Fischer, I.3    Philippsen, M.4
  • 25
    • 78149333073 scopus 로고    scopus 로고
    • gspan: Graph-based substructure pattern mining
    • X. Yan and J. Han. gspan: Graph-based substructure pattern mining. In ICDM, pages 721-724, 2002.
    • (2002) ICDM , pp. 721-724
    • Yan, X.1    Han, J.2
  • 26
    • 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
  • 27
    • 33745185086 scopus 로고    scopus 로고
    • Graph indexing based on discriminative frequent structure analysis
    • X. Yan, P. S. Yu, and J. Han. Graph indexing based on discriminative frequent structure analysis. ACM Trans. Database Syst., 30(4):960-993, 2005.
    • (2005) ACM Trans. Database Syst. , vol.30 , Issue.4 , pp. 960-993
    • Yan, X.1    Yu, P.S.2    Han, J.3
  • 28
    • 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
  • 29
    • 34548731280 scopus 로고    scopus 로고
    • Treepi: A novel graph indexing method
    • S. Zhang, M. Hu, and J. Yang. Treepi: A novel graph indexing method. In ICDE, pages 966-975, 2007.
    • (2007) ICDE , pp. 966-975
    • Zhang, S.1    Hu, M.2    Yang, J.3
  • 30
    • 85011066999 scopus 로고    scopus 로고
    • Graph indexing: Tree + delta >= graph
    • P. Zhao, J. X. Yu, and P. S. Yu. Graph indexing: Tree + delta >= graph. In VLDB, pages 938-949, 2007.
    • (2007) VLDB , pp. 938-949
    • Zhao, P.1    Yu, J.X.2    Yu, P.S.3
  • 31
    • 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, pages 181-192, 2008.
    • (2008) EDBT , pp. 181-192
    • Zou, L.1    Chen, L.2    Yu, J.X.3    Lu, Y.4


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