Complexity and expressive power of weakly well-designed SPARQL

DOI10.1007/s00224-017-9802-9zbMath1392.68169OpenAlexW2745753813WikidataQ59613764 ScholiaQ59613764MaRDI QIDQ1650913

Egor V. Kostylev, Mark Kaminski

Publication date: 16 July 2018

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

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)

Uses Software

• SPARQL
• Ontop
• DBpedia

Cites Work

• Unnamed Item
• Unnamed Item
• On the primitivity of operators in SPARQL
• On the Satisfiability Problem for SPARQL Patterns
• SPARQL Query Containment under RDFS Entailment Regime
• Static analysis and optimization of semantic web queries
• Algebraic Structures for Capturing the Provenance of SPARQL Queries
• On the relation between SPARQL1.1 and Answer Set Programming

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