.png){kind=icon}
返回
Morph-KGC: Scalable knowledge graph materialization with mapping partitions
.png){kind=icon}
OA
AI
DOI：10.3233/SW-223135.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Knowledge graphs are often constructed from heterogeneous data sources, using declarative rules that map them to a target ontology and materializing them into RDF. When these data sources are large, the materialization of the entire knowledge graph may be computationally expensive and not suitable for those cases where a rapid materialization is required. In this work, we propose an approach to overcome this limitation, based on the novel concept of mapping partitions. Mapping partitions are defined as groups of mapping rules that generate disjoint subsets of the knowledge graph. Each of these groups can be processed separately, reducing the total amount of memory and execution time required by the materialization process. We have included this optimization in our materialization engine Morph-KGC, and we have evaluated it over three different benchmarks. Our experimental results show that, compared with state-of-the-art techniques, the use of mapping partitions in Morph-KGC presents the following advantages: (i) it decreases significantly the time required for materialization, (ii) it reduces the maximum peak of memory used, and (iii) it scales to data sizes that other engines are not capable of processing currently.
Keyword:
Knowledge Graphs
R2RML
RML
Scalability
期刊
IF:
2.9
论文数:
609
被引数:
1.6K
机构
引用论文
An insight into the PB1F2 protein and its multifunctional role in enhancing the pathogenicity of the influenza A viruses.png)
Virology
OAAI
VirologyIF0
OAAI分享收藏Study on Factors Affecting Evacuation Capability of a Fire-protection Walk in Underground BuildingsOAAI
OAAI分享收藏分享收藏分享收藏分享收藏
查看更多内容