Extended Characteristic Sets: Graph Indexing for SPARQL Query Optimization

As the development of the semantic web, RDF data set has grown rapidly, thus causing the query problem of massive RDF. Using distributed technique to complete the SPARQL (Simple Protocol and RDF Query Language) Query is a new way of solving the large amounts of RDF query problem. At present, most of the RDF query strategies based on Hadoop have to use multiple MapReduce jobs to complete the task, resulting in waste of time. In order to overcome this drawback, MRQJ (using MapReduce to query and join) algorithm is proposed in the paper, which firstly uses a greedy strategy to generate join plan, then only one MapReduce job should be created to get the query results in SPARQL query execution. Finally, a contrast experiment on the LUBM (Lehigh University Benchmark) test data set is conducted, the results of which show that MRQJ method has a great advantage in the case that the query is more complicated.

Download Full-text

SPARQL Query Optimization on Top of DHTs

Lecture Notes in Computer Science - The Semantic Web – ISWC 2010 ◽

10.1007/978-3-642-17746-0_27 ◽

2010 ◽

pp. 418-435 ◽

Cited By ~ 23

Author(s):

Zoi Kaoudi ◽

Kostis Kyzirakos ◽

Manolis Koubarakis

Keyword(s):

Query Optimization ◽

Sparql Query

Download Full-text

Distance-Based Triple Reordering for SPARQL Query Optimization

2017 IEEE 33rd International Conference on Data Engineering (ICDE) ◽

10.1109/icde.2017.227 ◽

2017 ◽

Cited By ~ 3

Author(s):

Marios Meimaris ◽

George Papastefanatos

Keyword(s):

Query Optimization ◽

Sparql Query

Download Full-text

On the Expressivity of ASK Queries in SPARQL

Proceedings of the AAAI Conference on Artificial Intelligence ◽

10.1609/aaai.v34i03.5700 ◽

2020 ◽

Vol 34 (03) ◽

pp. 3057-3064

Author(s):

Xiaowang Zhang ◽

Jan Van den Bussche ◽

Kewen Wang ◽

Heng Zhang ◽

Xuanxing Yang ◽

...

Keyword(s):

Query Optimization ◽

Systematic Study ◽

Expressive Power ◽

Sparql Query ◽

Rich Picture ◽

Boolean Queries ◽

Query Type

As a major query type in SPARQL, ASK queries are boolean queries and have found applications in several domains such as semantic SPARQL optimization. This paper is a first systematic study of the relative expressive power of various fragments of ASK queries in SPARQL. Among many new results, a surprising one is that the operator UNION is redundant for ASK queries. The results in this paper as a whole paint a rich picture for the expressivity of fragments of ASK queries with the four basic operators of SPARQL 1.0 possibly together with a negation. The work in this paper provides a guideline for future SPARQL query optimization and implementation.

Download Full-text