The challenge of optional matching in SPARQL

DOI10.1007/978-3-319-30024-5_10MaRDI QIDQ2807080zbMATHOpenAlexFDO

Authors Shqiponja Ahmetaj, Wolfgang Fischl, Markus Kröll, Reinhard Pichler, Mantas Šimkus, Sebastian Skritek

Publication date 19 May 2016

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-30024-5_10

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Database theory (68P15) Internet topics (68M11)

Recommendations

• Beyond well-designed SPARQL
• Complexity and expressive power of weakly well-designed SPARQL
• Querying incomplete information in RDF with SPARQL
• Static analysis and optimization of semantic web queries
• Foundations of RDF Databases

Cited in

(3)

• Beyond well-designed SPARQL
• Complexity and expressive power of weakly well-designed SPARQL
• On the primitivity of operators in SPARQL

This page was built for publication: The challenge of optional matching in SPARQL

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