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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
