On-demand RDF to Relational Query Translation in Samizdat RDF Store
This paper presents an algorithm for on-demand translation of RDF queries that allows to map any relational data structure to RDF model, and to perform queries over a combination of mapped relational data and arbitrary RDF triples with a performance comparable to that of relational systems. Query capabilities implemented by the algorithm include optional and negative graph patterns, nested sub-patterns, and limited RDFS and OWL inference backed by database triggers.
Dmitry Borodaenko
Belarusian State University of Informatics and Radioelectronics 6 Brovki st.,Minsk,Belarus
国际会议
上海
英文
2228-2232
2009-11-20(万方平台首次上网日期,不代表论文的发表时间)