[PDF][PDF] D2RQ-treating non-RDF databases as virtual RDF graphs
C Bizer, A Seaborne - Proceedings of the 3rd international semantic …, 2004 - files.ifi.uzh.ch
C Bizer, A Seaborne
Proceedings of the 3rd international semantic web conference (ISWC2004), 2004•files.ifi.uzh.chAbstract As Semantic Web technologies are getting mature, there is a growing need for RDF
applications to access the content of huge, live, non-RDF, legacy databases without having
to replicate the whole database into RDF. In this poster, we present D2RQ, a declarative
language to describe mappings between application-specific relational database schemata
and RDF-S/OWL ontologies. D2RQ allows RDF applications to treat non-RDF relational
databases as virtual RDF graphs, which can be queried using RDQL.
applications to access the content of huge, live, non-RDF, legacy databases without having
to replicate the whole database into RDF. In this poster, we present D2RQ, a declarative
language to describe mappings between application-specific relational database schemata
and RDF-S/OWL ontologies. D2RQ allows RDF applications to treat non-RDF relational
databases as virtual RDF graphs, which can be queried using RDQL.
Abstract
As Semantic Web technologies are getting mature, there is a growing need for RDF applications to access the content of huge, live, non-RDF, legacy databases without having to replicate the whole database into RDF. In this poster, we present D2RQ, a declarative language to describe mappings between application-specific relational database schemata and RDF-S/OWL ontologies. D2RQ allows RDF applications to treat non-RDF relational databases as virtual RDF graphs, which can be queried using RDQL.
files.ifi.uzh.ch