%0 Conference Paper %1 sml %A Stadler, Claus %A Unbehauen, Joerg %A Westphal, Patrick %A Sherif, Mohamed Ahmed %A Lehmann, Jens %B Proceedings of the 8th Workshop on Linked Data on the Web (LDOW2015), Florence, Italy %D 2015 %K 2015 MOLE dice geoknow group_aksw group_mole lehmann mole peer-reviewed sherif simba stadler westphal %T Simplified RDB2RDF Mapping %U http://svn.aksw.org/papers/2015/LDOW_SML/paper-camery-ready_public.pdf %X The combination of the advantages of widely used relational databases and semantic technologies has attracted significant research over the past decade. In particular, mapping languages for the conversion of databases to RDF knowledge bases have been developed and standardized in the form of R2RML. In this article, we first review those mapping languages and then devise work towards a unified formal model for them. Based on this, we present the Sparqlification Mapping Language (SML), which provides an intuitive way to declare mappings based on SQL VIEWS and SPARQL construct queries. We show that SML has the same expressivity as R2RML by enumerating the language features and show the correspondences, and we outline how one syntax can be converted into the other. A conducted user study for this paper juxtaposing SML and R2RML provides evidence that SML is a more compact syntax which is easier to understand and read and thus lowers the barrier to offer SPARQL access to relational databases.

@inproceedings{sml, abstract = {The combination of the advantages of widely used relational databases and semantic technologies has attracted significant research over the past decade. In particular, mapping languages for the conversion of databases to RDF knowledge bases have been developed and standardized in the form of R2RML. In this article, we first review those mapping languages and then devise work towards a unified formal model for them. Based on this, we present the Sparqlification Mapping Language (SML), which provides an intuitive way to declare mappings based on SQL VIEWS and SPARQL construct queries. We show that SML has the same expressivity as R2RML by enumerating the language features and show the correspondences, and we outline how one syntax can be converted into the other. A conducted user study for this paper juxtaposing SML and R2RML provides evidence that SML is a more compact syntax which is easier to understand and read and thus lowers the barrier to offer SPARQL access to relational databases.}, added-at = {2024-03-04T14:15:11.000+0100}, author = {Stadler, Claus and Unbehauen, Joerg and Westphal, Patrick and Sherif, Mohamed Ahmed and Lehmann, Jens}, bdsk-url-1 = {svn.aksw.org/papers/2015/LDOW_SML/paper-camery-ready_public.pdf}, biburl = {https://www.bibsonomy.org/bibtex/2ad1d4c68bdbb2c689505e5028f53c1b8/aksw}, booktitle = {Proceedings of the 8th Workshop on Linked Data on the Web (LDOW2015), Florence, Italy}, interhash = {c3136b2835a6d0dc5723565590571bd6}, intrahash = {ad1d4c68bdbb2c689505e5028f53c1b8}, keywords = {2015 MOLE dice geoknow group_aksw group_mole lehmann mole peer-reviewed sherif simba stadler westphal}, timestamp = {2024-03-04T14:15:11.000+0100}, title = {Simplified {RDB2RDF} Mapping}, url = {http://svn.aksw.org/papers/2015/LDOW_SML/paper-camery-ready_public.pdf}, year = 2015 }