4.5 Article

MuSe: a multi-level storage scheme for big RDF data using MapReduce

期刊

JOURNAL OF BIG DATA
卷 8, 期 1, 页码 -

出版社

SPRINGERNATURE
DOI: 10.1186/s40537-021-00519-6

关键词

RDF; SPARQL; Hadoop; HDFS; MapReduce; Storage

向作者/读者索取更多资源

The paper introduces an efficient distributed RDF storage scheme called MuSe for storing and querying RDF data with Hadoop MapReduce. MuSe optimizes RDF storage to answer frequently occurring triple patterns in minimum time and outperforms compared frameworks in terms of query execution time and scalability, as demonstrated by experiments on synthetic RDF datasets LUBM and WatDiv.
Resource Description Framework (RDF) model owing to its flexible structure is increasingly being used to represent Linked data. The rise in amount of Linked data and Knowledge graphs has resulted in an increase in the volume of RDF data. RDF is used to model metadata especially for social media domains where the data is linked. With the plethora of RDF data sources available on the Web, scalable RDF data management becomes a tedious task. In this paper, we present MuSe-an efficient distributed RDF storage scheme for storing and querying RDF data with Hadoop MapReduce. In MuSe, the Big RDF data is stored at two levels for answering the common triple patterns in SPARQL queries. MuSe considers the type of frequently occuring triple patterns and optimizes RDF storage to answer such triple patterns in minimum time. It accesses only the tables that are sufficient for answering a triple pattern instead of scanning the whole RDF dataset. The extensive experiments on two synthetic RDF datasets i.e. LUBM and WatDiv, show that MuSe outperforms the compared state-of-the art frameworks in terms of query execution time and scalability.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.5
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据