On the semantics of SPARQL queries with optional matching under entailment regimes
We study the semantics of SPARQL queries with optional matching features under entailment regimes. We argue that the normative semantics may lead to answers that are in conflict with the intuitive meaning of optional matching, where unbound variables naturally represent unknown information. We propo...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Conference item |
| Published: |
Springer
2014
|
| _version_ | 1797086533497389056 |
|---|---|
| author | Kostylev, E Grau, B |
| author2 | Mika, P |
| author_facet | Mika, P Kostylev, E Grau, B |
| author_sort | Kostylev, E |
| collection | OXFORD |
| description | We study the semantics of SPARQL queries with optional matching features under entailment regimes. We argue that the normative semantics may lead to answers that are in conflict with the intuitive meaning of optional matching, where unbound variables naturally represent unknown information. We propose an extension of the SPARQL algebra that addresses these issues and is compatible with any entailment regime satisfying the minimal requirements given in the normative specification. We then study the complexity of query evaluation and show that our extension comes at no cost for regimes with an entailment relation of reasonable complexity. Finally, we show that our semantics preserves the known properties of optional matching that are commonly exploited for static analysis and optimisation. |
| first_indexed | 2024-03-07T02:23:27Z |
| format | Conference item |
| id | oxford-uuid:a4c02625-e357-4389-a5fe-007c8943fa05 |
| institution | University of Oxford |
| last_indexed | 2024-03-07T02:23:27Z |
| publishDate | 2014 |
| publisher | Springer |
| record_format | dspace |
| spelling | oxford-uuid:a4c02625-e357-4389-a5fe-007c8943fa052022-03-27T02:35:57ZOn the semantics of SPARQL queries with optional matching under entailment regimesConference itemhttp://purl.org/coar/resource_type/c_5794uuid:a4c02625-e357-4389-a5fe-007c8943fa05Symplectic Elements at OxfordSpringer2014Kostylev, EGrau, BMika, PTudorache, TBernstein, AWelty, CKnoblock, CVrandecic, DGroth, PNoy, NJanowicz, KGoble, CWe study the semantics of SPARQL queries with optional matching features under entailment regimes. We argue that the normative semantics may lead to answers that are in conflict with the intuitive meaning of optional matching, where unbound variables naturally represent unknown information. We propose an extension of the SPARQL algebra that addresses these issues and is compatible with any entailment regime satisfying the minimal requirements given in the normative specification. We then study the complexity of query evaluation and show that our extension comes at no cost for regimes with an entailment relation of reasonable complexity. Finally, we show that our semantics preserves the known properties of optional matching that are commonly exploited for static analysis and optimisation. |
| spellingShingle | Kostylev, E Grau, B On the semantics of SPARQL queries with optional matching under entailment regimes |
| title | On the semantics of SPARQL queries with optional matching under entailment regimes |
| title_full | On the semantics of SPARQL queries with optional matching under entailment regimes |
| title_fullStr | On the semantics of SPARQL queries with optional matching under entailment regimes |
| title_full_unstemmed | On the semantics of SPARQL queries with optional matching under entailment regimes |
| title_short | On the semantics of SPARQL queries with optional matching under entailment regimes |
| title_sort | on the semantics of sparql queries with optional matching under entailment regimes |
| work_keys_str_mv | AT kostyleve onthesemanticsofsparqlquerieswithoptionalmatchingunderentailmentregimes AT graub onthesemanticsofsparqlquerieswithoptionalmatchingunderentailmentregimes |