#5772. Grace: An Efficient Parallel SPARQL Query System over Large-Scale RDF Data

July 2026publication date
Proposal available till 12-05-2025
4 total number of authors per manuscript0 $

The title of the journal is available only for the authors who have already paid for
Journal’s subject area:
Computer Science (all);
Places in the authors’ list:
place 1place 2place 3place 4
FreeFreeFreeFree
2350 $1200 $1050 $900 $
Contract5772.1 Contract5772.2 Contract5772.3 Contract5772.4
1 place - free (for sale)
2 place - free (for sale)
3 place - free (for sale)
4 place - free (for sale)

Abstract:
As a markup language for describing web resources, RDF is often used to represent graph data. SPARQL is a standard query language for RDF data, which is convenient in querying RDF. As RDF data grows rapidly, how to deal with complex queries over large-scale data in a reasonable time still remains many challenges. The existing RDF query systems often fail to respond within a reasonable time when dealing with complex SPARQL queries. Therefore, we propose an efficient parallel SPARQL query system and novel in three aspects. First, the proposed design provides a dynamic selectivity estimation strategy and generates an optimal query plan for parallel query processing. Second, the new design proposes a parallel processing model to maximize the parallelism of the system. Finally, chunk-based task distribution strategy is implemented to assist the parallel processing model. Based on the proposed design, we implement an efficient parallel query system (Grace).
Keywords:
parallel processing; query optimization; query plan; RDF graph; SPARQL query

Contacts :
0