Corpus ID: 29995011

On Expressibility of Non-Monotone Operators in SPARQL

@inproceedings{Kontchakov2016OnEO,
  title={On Expressibility of Non-Monotone Operators in SPARQL},
  author={R. Kontchakov and Egor V. Kostylev},
  booktitle={KR},
  year={2016}
}
SPARQL, a query language for RDF graphs, is one of the key technologies for the Semantic Web. The expressivity and complexity of various fragments of SPARQL have been studied extensively. It is usually assumed that the optional matching operator OPTIONAL has only two graph patterns as arguments. The specification of SPARQL, however, defines it as a ternary operator, with an additional filter condition. We address the problem of expressibility of the full ternary OPTIONAL via the simplified… Expand
On the Primitivity of SPARQL 1.1 Operators
TLDR
This paper shows that the six operators BIND, FILTER, GRAPH, property path, SELECT, and VALUES are primitive while the left five operators AND, EXISTS, MINUS, OPT, and UNION, are not primitive. Expand
Nested Constructs vs. Sub-Selects in SPARQL
TLDR
It is shown that it is indeed possible to unfold nested SParQL construct queries into subqueries in SPARQL 1.1; the transformation requires an exponential blowup in the nesting depth, which suggests that nested construct queries are indeed a useful syntactic feature inSPARQL that cannot compactly be replaced by subquerie. Expand
The Problem of Correlation and Substitution in SPARQL - Extended Version
TLDR
This paper presents a formal framework to study why different implementations of SPARQL behave differently when evaluating queries with correlated variables based on Datalog, and shows that at the core of this problem lies the historically troubling notion of logical substitution. Expand
Query Nesting, Assignment, and Aggregation in SPARQL 1.1
TLDR
An in-depth formal analysis of the semantics and expressive power of these new constructs as defined in the SPARQL 1.1 specification are provided, and hence lay the necessary foundations for the development of robust, scalable, and extensible query engines supporting complex numerical and analytics tasks. Expand
Expressivity issues in SPARQL: monotonicity and two-versus three-valued semantics
TLDR
A comparison among the expressivity of AND, OPT, OPT from well-designed patterns, under the two-valued and three-valued semantics via constraints, monotonicity, weak monotonic, and non-optionally monotonicism is conducted. Expand
Complexity and Expressive Power of Weakly Well-Designed SPARQL
TLDR
An intuitive normal form for weakly well-designed queries is provided and the fragment’s expressive power is strictly in-between well- designed and full SPARQL, which shows that the fragment captures over 99% of DBpedia queries with OPTIONAL. Expand
On the Satisfiability Problem of Patterns in SPARQL 1.1
TLDR
This paper provides a complete analysis of decidability/undecidability of satisfiability problems for SParQL 1.1 patterns and provides a guideline for future SPARQL query language design and implementation. Expand
The Multiset Semantics of SPARQL Patterns
TLDR
It is proved that the fragment formed by AND, UNION, OPTIONAL, FILTER, MINUS and SELECT corresponds precisely to both, the intuitive multiset relational algebra (projection, selection, natural join, arithmetic union and except), and the mult iset non-recursive Datalog with safe negation. Expand
A Comprehensive Study for Essentiality of Graph Based Distributed SPARQL Query Processing
TLDR
This study elaborate all popular existing frameworks for distributed query processing and organize a comparative study according to the facts and figures, identifying different limitations and discrepancies in all approaches. Expand
D B ] 1 4 O ct 2 01 6 The multiset semantics of SPARQL patterns ∗
The paper determines the algebraic and logic structure of the multiset semantics of the core patterns of SPARQL. We prove that the fragment formed by AND, UNION, OPTIONAL, FILTER, MINUS and SELECTExpand

References

SHOWING 1-10 OF 33 REFERENCES
Semantics and Complexity of SPARQL
TLDR
This paper addresses systematically the formal study of SPARQL, concentrating in its graph pattern facility, providing a compositional semantics, and proving there are normal forms, among others that the evaluation of SParQL patterns is PSPACE-complete. Expand
On the primitivity of operators in SPARQL
TLDR
The paper studies the primitivity of the basic operators UNION, AND, OPTIONAL, FILTER, and SELECT, as they are used in the SPARQL query language, finding only AND is non-primitive. Expand
Foundations of SPARQL query optimization
TLDR
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. Expand
On the Semantics of SPARQL Queries with Optional Matching under Entailment Regimes
TLDR
An extension of the SPARQL algebra is proposed that is compatible with any entailment regime satisfying the minimal requirements given in the normative specification and preserves the known properties of optional matching that are commonly exploited for static analysis and optimisation. Expand
The complexity of regular expressions and property paths in SPARQL
TLDR
This work formalizes the W3C semantics of property paths and investigates various query evaluation problems on graphs, proving that the membership problem for regular expressions with numerical occurrence indicators and negation is in polynomial time. Expand
Containment and equivalence of well-designed SPARQL
TLDR
A comprehensive complexity analysis of containment and equivalence for several fragments of SPARQL for basic extensions in the form of the UNION operator and/or projection results range from NP-completeness to undecidability. Expand
Algebraic structures for capturing the provenance of SPARQL queries
TLDR
Spm-semirings extend semirings, used for positive relational algebra queries on annotated relational data, with a new operator to capture the semantics of the non-monotone SPARQL operator OPTIONAL, and spm-semiring-based annotations ensure that desired SParQL query equivalences hold when querying annotated RDF. Expand
Semantics and Expressive Power of Subqueries and Aggregates in SPARQL 1.1
TLDR
An in-depth formal analysis of the semantics and expressive power of these new constructs as defined in the SPARQL 1.1 specification are provided, and hence lay the necessary foundations for the development of robust, scalable and extensible query engines supporting complex numerical and analytics tasks. Expand
Towards Reconciling SPARQL and Certain Answers
TLDR
This work presents algorithms for the evaluation of an interesting fragment of SPARQL and shows that the complexity of the most fundamental query analysis tasks is not negatively affected by the presence of OWL 2 QL entailment under the proposed semantics. Expand
The Expressive Power of SPARQL
TLDR
The main result is that SPARQL and non-recursive safe Datalog with negation have equivalent expressive power, and hence, by classical results, SParQL is equivalent from an expressiveness point of view to Relational Algebra. Expand
...
1
2
3
4
...