| Title: |
To SCRY Linked Data: Extending SPARQL the Easy Way |
| Authors: |
Meroño-Peñuela, A.; Stringer, Bas; Loizou, Antonis; Abeln, Sanne |
| Contributors: |
d'Amato, Claudia; Lecue, Freddy; Mutharaju, Raghava; Narock, Tom; Wirth, Fabian |
| Source: |
Meroño-Peñuela, A, Stringer, B, Loizou, A & Abeln, S 2015, To SCRY Linked Data: Extending SPARQL the Easy Way. in C d'Amato, F Lecue, R Mutharaju, T Narock & F Wirth (eds), Diversity++ 2015 : Proceedings of the 1st International Diversity++ Workshop co-located with the 14th International Semantic Web Conference (ISWC 2015). vol. 1501, CEUR-WS.org, Diversity++ workshop, International Semantic Web Conference 2015 (ISWC 2015), Bethlehem, United States, 12/10/2015. < http://ceur-ws.org/Vol-1501/ > |
| Publisher Information: |
CEUR-WS.org |
| Publication Year: |
2015 |
| Collection: |
KNAW: Research Explorer (Koninklijke Nederlandse Akademie van Wetenschappen / Royal Netherlands Academy of Arts and Sciences) |
| Subject Terms: |
SPARQL; Custom services; Query-time RDF generatino |
| Description: |
More scientific communities are publishing datasets on the Web following the Linked Data principles, storing RDF graphs in triplestores and making them available for querying through SPARQL. Using these datasets to solve domain-specific problems often relies on information that cannot be included in such triplestores. For example, it is virtually impossible to foresee, and precompute, all statistical tests users will want to run on these datasets, especially if data from external triplestores is involved. A straightforward solution is to query the triplestore with SPARQL and compute the required information post-hoc. However, post-hoc scripting is laborious and typically not reusable, and the computed information is not accessible within the original query. Other solutions allow this computation to happen at query time, as with SPARQL Extensible Value Testing (EVT) and Linked Data APIs. However, such approaches can be difficult to apply, due to limited interoperability and poor extensibility. In this paper we present SCRY, the SPARQL compatible service layer, which is a lightweight SPARQL endpoint that interprets parts of basic graph patterns as calls to user defined services. SCRY allows users to incorporate algorithms of arbitrary complexity within standards-compliant SPARQL queries, and to use the generated outputs directly within these same queries. Unlike traditional SPARQL endpoints, the RDF graph against which SCRY resolves its queries is generated at query time, by executing services encoded in the basic graph patterns. SCRY's federation-oriented design allows for easy integration with existing SPARQL endpoints, effectively extending their functionality in a decoupled, tool independent way and allowing the power of Semantic Web technology to be more easily applied to domain-specific problems. |
| Document Type: |
book part |
| File Description: |
application/pdf |
| Language: |
English |
| Availability: |
https://pure.knaw.nl/portal/en/publications/f0a62114-52f0-4f20-a609-de61b3e5d724; https://hdl.handle.net/20.500.11755/f0a62114-52f0-4f20-a609-de61b3e5d724; https://pure.knaw.nl/ws/files/1698046/scry_linked_data_A.pdf; http://ceur-ws.org/Vol-1501/ |
| Rights: |
info:eu-repo/semantics/openAccess |
| Accession Number: |
edsbas.2DF83D43 |
| Database: |
BASE |