KSC 2019
Current Result Document :
| 한글제목(Korean Title) |
An Efficient RDF Graph Summarization Framework |
| 영문제목(English Title) |
An Efficient RDF Graph Summarization Framework |
| 저자(Author) |
Van T.T. Duong
Muhammad Umair
Young-Koo Lee
|
| 원문수록처(Citation) |
VOL 46 NO. 02 PP. 0152 ~ 0154 (2019. 12) |
한글내용
(Korean Abstract) |
|
영문내용
(English Abstract) |
The growing volume of Resource Description Framework (RDF) data rises challenges in storage and querying large RDF datasets. The state of the art of RDF data management has shown that graph summarization and compression are efficient techniques to reduce the size of data but keep the essential data. In this paper, we propose a compressed representation of summary RDF graph that can be beneficial in both storage and SPARQL query performance. Our approach represents characteristic sets of super-nodes as sequences of bits, which allows finding candidates vertex set quickly. Moreover, by using our summary data structure, retrieving data of graph can be executed on small bounded dataset instead of all dataset that helps to reduce the query running time.
|
| 키워드(Keyword) |
|
| 파일첨부 |
PDF 다운로드
|
