메뉴 건너뛰기




Volumn , Issue , 2009, Pages 204-215

A novel approach for efficient supergraph query processing on graph databases

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE ALGORITHMS; EXACT ALGORITHMS; FEATURE SETS; GRAPH DATA; GRAPH DATABASE; NOVEL ALGORITHM; NP COMPLETE; ORDERS OF MAGNITUDE; OVERALL COSTS; SUBGRAPH ISOMORPHISM; SUBGRAPHS; SUPERGRAPH;

EID: 70349160269     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1516360.1516385     Document Type: Conference Paper
Times cited : (45)

References (28)
  • 2
    • 2442483205 scopus 로고    scopus 로고
    • Mining Molecular Fragments: Finding Relevant Substructures of Molecules
    • C. Borgelt and M. R. Berthold. Mining Molecular Fragments: Finding Relevant Substructures of Molecules. in ICDM, 2002.
    • (2002) ICDM
    • Borgelt, C.1    Berthold, M.R.2
  • 3
    • 23844449054 scopus 로고    scopus 로고
    • Graph Matching: Theoretical Foundations, Algorithms, and Applications
    • H. Bunke. Graph Matching: Theoretical Foundations, Algorithms, and Applications. in Vision Interface, pages 82-88, 2000.
    • (2000) Vision Interface , pp. 82-88
    • Bunke, H.1
  • 5
    • 35448982399 scopus 로고    scopus 로고
    • J. Cheng, Y. Ke, W. Ng, and A. Lu. FG-Index: Towards Verification-Free Query Processing on Graph Databases. in SIGMOD, 2007.
    • J. Cheng, Y. Ke, W. Ng, and A. Lu. FG-Index: Towards Verification-Free Query Processing on Graph Databases. in SIGMOD, 2007.
  • 6
    • 3142716665 scopus 로고    scopus 로고
    • Thirty Years Of Graph Matching In Pattern Recognition
    • D. Conte, P. Foggia, C. Sansone, and M. Vento. Thirty Years Of Graph Matching In Pattern Recognition. IJPRAI, 18, 3 (2004), 265-298.
    • (2004) IJPRAI , vol.18 , Issue.3 , pp. 265-298
    • Conte, D.1    Foggia, P.2    Sansone, C.3    Vento, M.4
  • 10
    • 1142291593 scopus 로고    scopus 로고
    • Stream Processing of XPath Queries with Predicates
    • A. K. Gupta and D. Suciu. Stream Processing of XPath Queries with Predicates. in SIGMOD, 2003.
    • (2003) SIGMOD
    • Gupta, A.K.1    Suciu, D.2
  • 11
    • 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
  • 12
    • 34548715799 scopus 로고    scopus 로고
    • GString: A Novel Approach for Efficient Search in Graph Databases
    • H. Jiang, H. Wang, P. S. Yu, and S. Zhou. GString: A Novel Approach for Efficient Search in Graph Databases. in ICDE, 2007.
    • (2007) ICDE
    • Jiang, H.1    Wang, H.2    Yu, P.S.3    Zhou, S.4
  • 13
    • 78149312583 scopus 로고    scopus 로고
    • Frequent Subgraph Discovery
    • M. Kuramochi and G. Karypis. Frequent Subgraph Discovery, in ICDM, 2001.
    • (2001) ICDM
    • Kuramochi, M.1    Karypis, G.2
  • 14
    • 52649155498 scopus 로고    scopus 로고
    • Summarizing Graph Patterns
    • Y. Liu, J. Li, and H. Gao. Summarizing Graph Patterns. in ICDE, 2008.
    • (2008) ICDE
    • Liu, Y.1    Li, J.2    Gao, H.3
  • 15
    • 0032708360 scopus 로고    scopus 로고
    • A decision tree approach to graph and subgraph isomorphism detection
    • B. T. Messmer and H. Bunke. A decision tree approach to graph and subgraph isomorphism detection. Pattern Recognition, 32, 12 (1999), 1979-1998.
    • (1999) Pattern Recognition , vol.32 , Issue.12 , pp. 1979-1998
    • Messmer, B.T.1    Bunke, H.2
  • 16
    • 0033685860 scopus 로고    scopus 로고
    • Efficient Subgraph Isomorphism Detection: A Decomposition Approach
    • B. T. Messmer and H. Bunke. Efficient Subgraph Isomorphism Detection: A Decomposition Approach. IEEE Trans. Knowl. Data. Eng., 12, 2 (2000), 307-323.
    • (2000) IEEE Trans. Knowl. Data. Eng , vol.12 , Issue.2 , pp. 307-323
    • Messmer, B.T.1    Bunke, H.2
  • 17
    • 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. in VLDB, 2008.
    • (2008) VLDB
    • Shang, H.1    Zhang, Y.2    Lin, X.3    Yu, J.X.4
  • 18
    • 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, 2002.
    • (2002) PODS
    • Shasha, D.1    Wang, J.T.-L.2    Giugno, R.3
  • 19
    • 0016870630 scopus 로고
    • An Algorithm for Subgraph Isomorphism
    • J. R. Ullmann. An Algorithm for Subgraph Isomorphism. J. ACM, 23, 1 (1976), 31-42.
    • (1976) J. ACM , vol.23 , Issue.1 , pp. 31-42
    • Ullmann, J.R.1
  • 20
    • 12244307653 scopus 로고    scopus 로고
    • State of the art of graph-based data mining
    • T. Washio and H. Motoda. State of the art of graph-based data mining. SIGKDD Explorations, 5, 1 (2003), 59-68.
    • (2003) SIGKDD Explorations , vol.5 , Issue.1 , pp. 59-68
    • Washio, T.1    Motoda, H.2
  • 21
    • 34548740153 scopus 로고    scopus 로고
    • Graph Database Indexing Using Structured Graph Decomposition
    • D. W. Williams, J. Huan, and W. Wang. Graph Database Indexing Using Structured Graph Decomposition. in ICDE, 2007.
    • (2007) ICDE
    • Williams, D.W.1    Huan, J.2    Wang, W.3
  • 22
    • 70349129667 scopus 로고    scopus 로고
    • Extension and parallelization of a graph-mining- algorithm
    • M. Worlein, Extension and parallelization of a graph-mining- algorithm, in Friedrich-Alexander-Universität. 2006.
    • (2006) Friedrich-Alexander-Universität
    • Worlein, M.1
  • 23
    • 78149333073 scopus 로고    scopus 로고
    • gSpan: Graph-Based Substructure Pattern Mining
    • X. Yan and J. Han. gSpan: Graph-Based Substructure Pattern Mining. in ICDM, 2002.
    • (2002) ICDM
    • Yan, X.1    Han, J.2
  • 24
    • 77952334885 scopus 로고    scopus 로고
    • X. Yan and J. Han. CloseGraph: mining closed frequent graph patterns. in KDD, 2003.
    • X. Yan and J. Han. CloseGraph: mining closed frequent graph patterns. in KDD, 2003.
  • 25
    • 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
  • 26
    • 34548731280 scopus 로고    scopus 로고
    • TreePi: A Novel Graph Indexing Method
    • S. Zhang, M. Hu, and J. Yang. TreePi: A Novel Graph Indexing Method. in ICDE, 2007.
    • (2007) ICDE
    • Zhang, S.1    Hu, M.2    Yang, J.3
  • 27
    • 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
  • 28
    • 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가 분석하여 추출한 것입니다.