최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기정보과학회. 컴퓨팅의 실제 논문지 = KIISE transactions on computing practices, v.24 no.5, 2018년, pp.245 - 250
하태욱 (한국과학기술원 전산학부) , 김명호 (한국과학기술원 전산학부)
Given a graph database which consists of small graphs or a single large graph, the subgraph isomorphism query processing finds all subgraphs isomorphic to a query graph from a user. The previous research proposed a query processing method using join operations between tables, which include path info...
T. Ha, J. Seo, and M. Kim, "Subgraph isomorphism query processing using join operations of paths," Proc. of the 43th KIISE Winter Conference, pp. 208-210, 2016. (in Korean)
H. He and A. K. Singh, "Graphs-at-a-time: query language and access methods for graphdatabases," Proc. of the ACM SIGMOD Conference, pp. 405-418, 2008.
P. Zhao and J. Han, "On graph query optimization in large networks," Proc. of the VLDB Endowment, pp. 340-351, 2010.
W. Han, J. Lee, and J. Lee, "TurboISO: towards ultrafast and robust subgraph isomorphism search in large graph databases," Proc. of the ACM SIGMOD, pp. 337-348, 2013.
P. Peng, L. Zou, L. Chen, X. Lin, and D. Zhao, "Answering subgraph queries over massive disk resident graphs," World Wide Web, pp. 417-448, 2016.
X. Yan and J. Han, "gSpan: Graph-based substructure pattern mining," ICDM, pp. 721-724, 2002.
J. Ullman, "An algorithm for subgraph isomorphism," Journal of the ACM, pp. 31-42, 1976.
K. Kim, B. Moon, H. Kim, "R3F: RDF triple filtering method for efficient SPARQL query processing," World Wide Web, pp. 317-357, 2015.
[Online] Available: http://www.hprd.org/download
[Online] Available: https://wiki.nci.nih.gov
*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.