On the formulation of performant SPARQL queries

  title={On the formulation of performant SPARQL queries},
  author={Antonis Loizou and Paul T. Groth},
  journal={J. Web Semant.},

Figures and Tables from this paper

Performance Analysis and Optimization of Semantic Queries
This work has developed SPARQL query patterns and evaluated their performance characteristics and provided eight recommendations for formulating SParQL queries, which can be easily used by everybody without a deeper knowledge about the implementation of the triplestore.
Automatic Query-Centric API for Routine Access to Linked Data
Despite the advatages of Linked Data as a data integration paradigm, accessing and consuming Linked Data is still a cumbersome task. Linked Data applications need to use technologies such as RDF and
A Benchmark Suite for Federated SPARQL Query Processing from Existing Workflows
A new benchmark suite for SPARQL query processors derived from workflows established by the pharmacology community and exploits the fact that these workflows are not only applied to voluminous data, but they are also equivalent to complex and challenging queries.
Scaling Out Federated Queries for Life Sciences Data in Production
Different state-of-the-art approaches for scaling out are compared, both in terms of their ability to execute the queries as in termsof performance.
Efficient Analytical Queries on Semantic Web Data Cubes
CQL (standing for Cube Query Language), a simple, high-level query language that operates over data cubes, is devised and query improvement strategies to produce efficient SParQL queries are proposed, adapting general-purpose SPARQL query optimization techniques.
Getting the best of Linked Data and Property Graphs: rdf2neo and the KnetMiner use case
Graph-based modelling is becoming more popular, in the sciences and elsewhere, as a flexible and powerful way to exploit data to power world-changing digital applications. Compared to the initial
grlc Makes GitHub Taste Like Linked Data APIs
Building Web APIs on top of SPARQL endpoints is becoming common practice. It enables universal access to the integration favorable data space of Linked Data. In the majority of use cases, users
Distributed Query Optimization Master’s Thesis
A distributed optimization approach that optimizes an individual query plan for each compute node while considering the stored data to improve the query performance by speeding up the processing of the query plan on all slave nodes is proposed and investigated.
Semantic Support for Tables using RDF Record Table
This work proposes the RDF (Resource Description Framework) Record Table vocabulary for semantically modelling tabular data, as a supplement to the existing RDF Data Cube standard, and demonstrates the Excel add-in for transforming data into the Record Table format.


Foundations of SPARQL query optimization
While studied in the context of a theoretically motivated set semantics, almost all results carry over to the official, bag-based semantics and therefore are of immediate practical relevance.
What are real SPARQL queries like?
The syntactical structure of queries in a log of about 3 million queries, harvested from the DBPedia SPARQL endpoint, is analyzed and it is shown that in 50% of the cases, these queries satisfy certain structural restrictions that imply tractable evaluation in theory.
Static analysis and optimization of semantic web queries
This article proposes a tree representation for SParQL queries, called pattern trees, which captures the class of well-designed SPARQL graph patterns and proposes several rules that can be used to transform pattern trees into a simple normal form, and studies equivalence and containment.
SP^2Bench: A SPARQL Performance Benchmark
SP^2Bench, a publicly available, language-specific SPARQL performance benchmark, which comprises both a data generator for creating arbitrarily large DBLP-like documents and a set of carefully designed benchmark queries.
Counting beyond a Yottabyte, or how SPARQL 1.1 property paths will prevent adoption of the standard
It is shown that any implementation that adheres to the SPARQL 1.1 specification is doomed to show the same behavior, the key issue being the need for counting solutions imposed by the current specification.
Heuristics-based query optimisation for SPARQL
A new Heuristic SParQL Planner (HSP) that is capable of exploiting the syntactic and the structural variations of the triple patterns in a SPARQL query in order to choose an execution plan without the need of any cost model is presented.
The Berlin SPARQL Benchmark
The Berlin SPARQL Benchmark (BSBM) is introduced, built around an e-commerce use case in which a set of products is offered by different vendors and consumers have posted reviews about products, and emulates the search and navigation pattern of a consumer looking for a product.
An Experimental Comparison of RDF Data Management Approaches in a SPARQL Benchmark Scenario
An experimental comparison of existing storage strategies on top of the SP2Bench SPARQL performance benchmark suite is presented and it is concluded that future research is necessary to further bring forward RDF data management.
Introducing RDF Graph Summary with Application to Assisted SPARQL Formulation
This paper presents a method to help users in formulating complex SPARQL queries across multiple heterogeneous data sources, based on a summary of the data graph and assists the user during an interactive query formulation by recommending possible structural query elements.
The SPARQL Query Graph Model for Query Optimization
This paper proposed the SPARQL query graph model (SQGM) supporting all phases of query processing, and defined transformations rules to simplify and to rewrite a query.