[Zurück]

S. Ahmetaj, W. Fischl, M. Kröll, R. Pichler, M. Simkus, S. Skritek:
"The Challenge of Optional Matching in SPARQL";
Hauptvortrag: Foundations of Information and Knowledge Systems - 9th International Symposium - FoIKS 2016, Linz (eingeladen); 07.03.2016 - 11.03.2016; in: "Foundations of Information and Knowledge Systems - 9th International Symposium, FoIKS 2016, Linz, Austria, March 7-11, 2016. Proceedings", M. Gyssens, G. Simari (Hrg.); Lecture Notes in Computer Science (LNCS) / Springer, 9616 (2016), ISBN: 978-3-319-30023-8; S. 169 - 190.

Conjunctive queries are arguably the most widely used querying mechanism in practice and the most intensively studied one in database theory. Answering a conjunctive query (CQ) comes down to matching all atoms of the CQ simultaneously into the database. As a consequence, a CQ fails to provide any answer if the pattern described by the query does not exactly match the data. CQs might thus be too restrictive as a querying mechanism for data on the web, which is considered as inherently incomplete. The semantic web query language SPARQL therefore contains the OPTIONAL operator as a crucial feature. It allows the user to formulate queries which try to match parts of the query over the data if available, but do not destroy answers of the remaining query otherwise. In this article, we have a closer look at this optional matching feature of SPARQL. More specifically, we will survey several results which have recently been obtained for an interesting fragment of SPARQL - the so-called well-designed SPARQL graph patterns.

http://dx.doi.org/10.1007/978-3-319-30024-5_10

http://link.springer.com/chapter/10.1007%2F978-3-319-30024-5_10

Projektleitung Reinhard Pichler:
Heterogene Information Integration

Projektleitung Reinhard Pichler:
SEE: SPARQL Evaluation and Extensions