Efficient SPARQL evaluation on stratified RDF data with meta-data
|F. Ferrarotti. Efficient SPARQL evaluation on stratified RDF data with meta-data. volume 11019, pages 99-112, DOI 10.1007/978-3-319-98398-1_7, 9, 2018.|
|Buch||Advances in Databases and Information Systems - Proc. ADBIS 2018|
|Serie||Lecture Notes in Computer Science|
The Resource Description Framework (RDF) is a simple, but frequently used W3C standard, which uses triplets to define relationships between resources. In this paper the evaluation of queries in the query language SPARQL on RDF data with meta-data is investigated. We first show that if the data are stratified, i.e. a particular partial order can be defined on the meta-data labels, then a nesting procedure can be applied, which induces a rewriting of the query. Based on a specification by an Abstract State Machine we show that the result of the rewritten query equals the one that would have resulted from the evaluation of the original query. We further investigate the reduction of complexity by using data and query nesting.