SPARQL-to-SQL Query Translation for Optional Graph Patterns

A poster presentation written by Hasan Jamil, Farshad Fotouhi, Artem Chebotko and Shiyong Lu. It was presented at the ESWC2007. It is about SQL, translation, query processing, SPARQL and algorithm

[edit] Abstract

The paper addresses the problem of translating queries in the emerging RDF standard query language SPARQL into equivalent SQL queries in order to access RDF data stored in a relational database. We present algorithm BGPtoSQL that translates basic graph patterns to its SQL equivalents for the simple case of the triple store. Although most RDF toolkits employ similar algorithms, BGPtoSQL serves as the systematically presented reference for such a translation algorithm. Most importantly, we propose the SPARQL-to-SQL translation strategy and algorithm SPARQLtoSQL that deal with arbitrary complex optional graph patterns. SPARQLtoSQL does not directly depend on a particular database schema as long as the BGPtoSQL stub for the database is provided. Our work is the first to show that the optional pattern semantics of SPARQL can be implemented correctly on top of a relational database. Finally, we conduct the experimental study and discuss its implications.

This data has been imported from the ESWC2007 RDF