Beyond well-designed SPARQL

DOI10.4230/LIPICS.ICDT.2016.5MaRDI QIDQ5276183zbMATH OpenFDO

Authors Mark Kaminski, Egor V. Kostylev

Publication date 14 July 2017

Full work available at URL https://doi.org/10.4230/LIPICS.ICDT.2016.5

zbMATH Keywords

optional matchingquery languagesRDFSPARQL

Mathematics Subject Classification ID

Database theory (68P15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Complexity and expressive power of weakly 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

Cited in

(11)

• Complexity and expressive power of weakly well-designed SPARQL
• Characterizing tractability of simple well-designed pattern trees with projection
• On the primitivity of operators in SPARQL
• The challenge of optional matching in SPARQL
• On the satisfiability problem for SPARQL patterns
• SPARQL query containment under RDFS entailment regime
• Foundations of RDF Databases
• Federation and navigation in SPARQL 1.1
• scientific article; zbMATH DE number 7561480 (Why is no real title available?)
• On the complexity of enumerating the answers to well-designed pattern trees
• CONSTRUCT queries in SPARQL

This page was built for publication: Beyond well-designed SPARQL

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