StarMR: An efficient star-decomposition based query processor for SPARQL basic graph patterns using MapReduce

No Thumbnail Available
File version
Author(s)
Xu, Qiang
Wang, Xin
Li, Jianxin
Gan, Ying
Chai, Lele
Wang, Junhu
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)

Cai, Y

Ishikawa, Y

Xu, J

Date
2018
Size
File type(s)
Location

Macau, China

License
Abstract

With the proliferation of knowledge graphs, large amounts of RDF graphs have been released, which raises the need for addressing the challenge of distributed SPARQL queries. In this paper, we propose an efficient distributed method, called Open image in new window, to answer the SPARQL basic graph pattern (BGP) queries on big RDF graphs using MapReduce. In our method, query graphs are decomposed into a set of stars that utilize the semantic and structural information embedded RDF graphs as heuristics. Two optimization techniques are proposed to further improve the efficiency of our algorithms. One filters out invalid input data, the other postpones the Cartesian product operations. The extensive experiments on both synthetic and real-world datasets show that our Open image in new window method outperforms the state-of-the-art method S2X by an order of magnitude.

Journal Title
Conference Title

Lecture Notes in Computer Science

Book Title
Edition
Volume

10987

Issue
Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
Item Access Status
Note
Access the data
Related item(s)
Subject

Information and computing sciences

Persistent link to this record
Citation