Flexible query processing for SPARQL
Frosini, R. and Calì, Andrea and Poulovassilis, Alexandra and Wood, Peter T. (2017) Flexible query processing for SPARQL. Semantic Web – Interoperability, Usability, Applicability 8 (4), pp. 533-563. ISSN 1570-0844.
|
Text
main.pdf - Published Version of Record Available under License Creative Commons Attribution Non-commercial. Download (465kB) | Preview |
Abstract
Flexible querying techniques can enhance users' access to complex, heterogeneous datasets in settings such as Linked Data, where the user may not always know how a query should be formulated in order to retrieve the desired answers. This paper presents query processing algorithms for a fragment of SPARQL 1.1 incorporating regular path queries (property path queries), extended with query approximation and relaxation operators. Our flexible query processing approach is based on query rewriting and returns answers incrementally according to their ``distance'' from the exact form of the query. We formally show the soundness, completeness and termination properties of our query rewriting algorithm. We also present empirical results that show promising query processing performance for the extended language.
Metadata
| Item Type: | Article |
|---|---|
| Keyword(s) / Subject(s): | Semantic Web, SPARQL 1.1, path queries, query approximation, query relaxation |
| School: | Birkbeck Schools and Departments > School of Business, Economics & Informatics > Computer Science and Information Systems |
| Research Centres and Institutes: | Innovation Management Research, Birkbeck Centre for, Bioinformatics, Bloomsbury Centre for (Closed), Birkbeck Knowledge Lab, Data Analytics, Birkbeck Institute for |
| Depositing User: | Peter Wood |
| Date Deposited: | 09 Nov 2015 15:53 |
| Last Modified: | 25 Jun 2020 09:23 |
| URI: | http://eprints.bbk.ac.uk/id/eprint/13373 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
 |
Edit/View Item |