Complexity and expressive power of weakly well-designed SPARQL

DOI10.1007/S00224-017-9802-9MaRDI QIDQ1650913zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Mark Kaminski, Egor V. Kostylev

Publication date 16 July 2018

Published in Theory of Computing Systems (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s00224-017-9802-9

zbMATH Keywords

SPARQLRDF query languagesoptional matching

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Beyond well-designed SPARQL
• The challenge of optional matching in SPARQL
• Foundations of RDF Databases
• Querying incomplete information in RDF with SPARQL
• CONSTRUCT queries in SPARQL

Cites work

• Algebraic Structures for Capturing the Provenance of SPARQL Queries
• Beyond well-designed SPARQL
• CONSTRUCT queries in SPARQL
• On the primitivity of operators in SPARQL
• On the relation between SPARQL1.1 and Answer Set Programming
• On the satisfiability problem for SPARQL patterns
• SPARQL query containment under RDFS entailment regime
• Static analysis and optimization of semantic web queries

Cited in

(9)

• On the complexity of enumerating the answers to well-designed pattern trees
• CONSTRUCT queries in SPARQL
• Beyond well-designed SPARQL
• Characterizing tractability of simple well-designed pattern trees with projection
• On the satisfiability problem for SPARQL patterns
• The challenge of optional matching in SPARQL
• Federation and navigation in SPARQL 1.1
• Complexity and Expressiveness of ShEx for RDF
• On the primitivity of operators in SPARQL

Describes a project that uses

Uses Software

• SPARQL
• Ontop
• DBpedia

This page was built for publication: Complexity and expressive power of weakly well-designed SPARQL

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1650913)