Efficient SPARQL Query Processing in MapReduce through Data Partitioning and Indexing

Zhi Nie,Fang Du,Xiaoyong Du,Linhao Xu,Yueguo Chen

doi:10.1007/978-3-642-29253-8_58

Efficient SPARQL Query Processing in MapReduce through Data Partitioning and Indexing

Zhi Nie, Fang Du + Show 3 more

https://doi.org/10.1007/978-3-642-29253-8_58

Copy DOI

Publication Date: Jan 1, 2012

Citations: 21

Affiliation: Ministry of Education of the People's Republic of China, Renmin University of China, IBM Research - China

#SPARQL Query Processing #Efficient Query Processing + Show 8 more

Abstract
Full-Text PDF
Similar Papers

Abstract

Processing SPARQL queries on single node is obviously not scalable, considering the rapid growth of RDF knowledge bases. This calls for scalable solutions of SPARQL query processing over Web-scale RDF data. There have been attempts for applying SPARQL query processing techniques in MapReduce environments. However, no study has been conducted on finding optimal partitioning and indexing schemes for distributing RDF data in MapReduce. In this paper, we investigate RDF data partitioning technique that provides effective indexing schemes to support efficient SPARQL query processing in MapReduce. Our extensive experiments over a huge real-life RDF dataset show the performance of the proposed partitioning and indexing schemes for efficient SPARQL query processing.

Full Text