The Problem of Correlation and Substitution in SPARQL -- Extended Version

01/13/2018
by   Daniel Hernández, et al.
0

Implementations of a standard language are expected to give same outputs to identical queries. In this paper we study why different implementations of SPARQL (Fuseki, Virtuoso, Blazegraph and rdf4j) behave differently when evaluating queries with correlated variables. We show that at the core of this problem lies the historically troubling notion of logical substitution. We present a formal framework to study this issue based on Datalog that besides clarifying the problem, gives a solid base to define and implement nesting.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/13/2019

Snapshot Semantics for Temporal Multiset Relations (Extended Version)

Snapshot semantics is widely used for evaluating queries over temporal d...
research
12/14/2021

Answering Queries with Negation over Existential Rules

Ontology-based query answering with existential rules is well understood...
research
10/13/2022

Soundness and Completeness of SPARQL Query Containment Solver SpeCS

Tool SPECS implements an efficient automated approach for reasoning abou...
research
10/02/2020

All You Need Is CONSTRUCT

In SPARQL, the query forms SELECT and CONSTRUCT have been the subject of...
research
02/13/2022

Comparing Flexible Skylines And Top-k Queries: Which Is the Best Alternative?

The question of how to get the best results out of the data we have is a...
research
04/27/2018

Certified Graph View Maintenance with Regular Datalog

We employ the Coq proof assistant to develop a mechanically-certified fr...
research
05/28/2022

Travelling Salesman Problem: Parallel Implementations Analysis

The Traveling Salesman Problem (often called TSP) is a classic algorithm...

Please sign up or login with your details

Forgot password? Click here to reset