gSMat: A Scalable Sparse Matrix-based Join for SPARQL Query Processing
Abstract
Resource Description Framework (RDF) has been widely used to represent information on the web, while SPARQL is a standard query language to manipulate RDF data. Given a SPARQL query, there often exist many joins which are the bottlenecks of efficiency of query processing. Besides, the real RDF datasets often reveal strong data sparsity, which indicates that a resource often only relates to a few resources even the number of total resources is large. In this paper, we propose a sparse matrix-based (SM-based) SPARQL query processing approach over RDF datasets which con- siders both join optimization and data sparsity. Firstly, we present a SM-based storage for RDF datasets to lift the storage efficiency, where valid edges are stored only, and then introduce a predicate- based hash index on the storage. Secondly, we develop a scalable SM-based join algorithm for SPARQL query processing. Finally, we analyze the overall cost by accumulating all intermediate results and design a query plan generated algorithm. Besides, we extend our SM-based join algorithm on GPU for parallelizing SPARQL query processing. We have evaluated our approach compared with the state-of-the-art RDF engines over benchmark RDF datasets and the experimental results show that our proposal can significantly improve SPARQL query processing with high scalability.
Cite
@article{arxiv.1807.07691,
title = {gSMat: A Scalable Sparse Matrix-based Join for SPARQL Query Processing},
author = {Xiaowang Zhang and Mingyue Zhang and Peng Peng and Jiaming Song and Zhiyong Feng and Lei Zou},
journal= {arXiv preprint arXiv:1807.07691},
year = {2018}
}
Comments
13 pages