메뉴 건너뛰기




Volumn , Issue , 2011, Pages 112-117

A similarity skyline approach for handling graph queries - A preliminary report

Author keywords

[No Author keywords available]

Indexed keywords

ALTERNATIVE APPROACH; FUNDAMENTAL PROBLEM; GRAPH DATABASE; GRAPH QUERIES; GRAPH STRUCTURES; PARETO DOMINANCE; SIMILARITY MEASURE; SIMILARITY SEARCH; TARGET DATABASE;

EID: 79958043225     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDEW.2011.5767617     Document Type: Conference Paper
Times cited : (3)

References (27)
  • 1
    • 33846662155 scopus 로고    scopus 로고
    • Saga: A subgaph matching tool for biological graphs
    • Y. Tian, R. McEachin, C. Santos, D. J. States, and J. M. Patel, "Saga: a subgaph matching tool for biological graphs," Bioinformatics, vol. 23(2), pp. 232-239, 2007.
    • (2007) Bioinformatics , vol.23 , Issue.2 , pp. 232-239
    • Tian, Y.1    McEachin, R.2    Santos, C.3    States, D.J.4    Patel, J.M.5
  • 2
    • 79958045407 scopus 로고    scopus 로고
    • Mining coherent dense subgraphs across massive biological network for fonctional discovery
    • H. Hu, Y. Hang, J. Han, and X. Zhou, "Mining coherent dense subgraphs across massive biological network for fonctional discovery," Bioinformatics, vol. 1(1), pp. 1-9, 2005.
    • (2005) Bioinformatics , vol.1 , Issue.1 , pp. 1-9
    • Hu, H.1    Hang, Y.2    Han, J.3    Zhou, X.4
  • 5
    • 84887001072 scopus 로고    scopus 로고
    • Chemical similarity searching using a neural graph matcher
    • S. Klinger and J. Austin, "Chemical similarity searching using a neural graph matcher," in Proc. of ESANN, 2005, pp. 479-484.
    • Proc. of ESANN, 2005 , pp. 479-484
    • Klinger, S.1    Austin, J.2
  • 9
    • 3142736597 scopus 로고    scopus 로고
    • Graph indexing: A frequent structurebased approach
    • X. Yan, P. S. Yu, and J. Han, "Graph indexing: A frequent structurebased approach," in Proc. of ACM SIGMOD, 2004, pp. 335-346.
    • Proc. of ACM SIGMOD, 2004 , pp. 335-346
    • Yan, X.1    Yu, P.S.2    Han, J.3
  • 10
    • 70349160269 scopus 로고    scopus 로고
    • A novel approach for efficient supergraph query processing on graph databases
    • S. Zhang, J. Z. Li, H. Gao, and Z. Zou, "A novel approach for efficient supergraph query processing on graph databases," in Proc. of EDBT, march 24-26 2009, pp. 204-215.
    • Proc. of EDBT, March 24-26 2009 , pp. 204-215
    • Zhang, S.1    Li, J.Z.2    Gao, H.3    Zou, Z.4
  • 11
    • 34548731280 scopus 로고    scopus 로고
    • Treepi: A novel graph indexing method
    • S. Zhang, M. Hu, and J. Yang, "Treepi: A novel graph indexing method," in Proc. of ICDE, 2007, pp. 966-975.
    • Proc. of ICDE, 2007 , pp. 966-975
    • Zhang, S.1    Hu, M.2    Yang, J.3
  • 13
    • 0031141283 scopus 로고    scopus 로고
    • Similarity searching in medical image databases
    • May
    • E. Petrakis and C. Faloutsos, "Similarity searching in medical image databases," Proc. of TKDE, vol. 9 (3), pp. 435 -447, May 1997.
    • (1997) Proc. of TKDE , vol.9 , Issue.3 , pp. 435-447
    • Petrakis, E.1    Faloutsos, C.2
  • 14
    • 29844431949 scopus 로고    scopus 로고
    • Substructure similarity search in graph databases
    • X. Yan, P. S. Yu, and J. Han, "Substructure similarity search in graph databases," in Proc. of ACM SIGMOD, 2005, pp. 766-777.
    • Proc. of ACM SIGMOD, 2005 , pp. 766-777
    • Yan, X.1    Yu, P.S.2    Han, J.3
  • 15
    • 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 Proc. of ICDE, 2006, pp. 38-52.
    • Proc. of ICDE, 2006 , pp. 38-52
    • He, H.1    Singh, A.K.2
  • 19
    • 85011081868 scopus 로고    scopus 로고
    • Efficient processing of top-k dominating queries on multi-dimensional data
    • M. L. Yiu and N. Mamoulis, "Efficient processing of top-k dominating queries on multi-dimensional data," in Proc. of VLDB, 2007, pp. 483-494.
    • Proc. of VLDB, 2007 , pp. 483-494
    • Yiu, M.L.1    Mamoulis, N.2
  • 23
    • 0031198630 scopus 로고    scopus 로고
    • On a relation between graph edit distance and maximum common subgraph
    • August
    • H. Bunke, "On a relation between graph edit distance and maximum common subgraph," Pattern Recogn. Letters, vol. 18 (9), pp. 689-697, August 1997.
    • (1997) Pattern Recogn. Letters , vol.18 , Issue.9 , pp. 689-697
    • Bunke, H.1
  • 24
    • 0032024433 scopus 로고    scopus 로고
    • A graph distance metric based on the maximal common subgraph
    • March
    • H. Bunke and K. Shearer, "A graph distance metric based on the maximal common subgraph," Pattern Recogn. Letters, vol. 19 (3-4), pp. 255-259, March 1998.
    • (1998) Pattern Recogn. Letters , vol.19 , Issue.3-4 , pp. 255-259
    • Bunke, H.1    Shearer, K.2
  • 26
    • 84942791887 scopus 로고    scopus 로고
    • Diversity-conscious retrieval
    • Springer-Verlag
    • D. McSherry, "Diversity-conscious retrieval," in Proc. of ECCBR. Springer-Verlag, 2002, pp. 219-233.
    • (2002) Proc. of ECCBR , pp. 219-233
    • McSherry, D.1


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