Abstract
The current buzzword in the Internet community is the Semantic Web initiative proposed by the W3C to yield a Web that is more flexible and self-adapting. However, for the Semantic Web initiative to become a reality, heterogeneous data sources need to be integrated in order to enable access to them in a homogeneous manner. Since a vast majority of data currently resides in relational databases, integrating relational data sources with semantic web technologies is at the top of the list of activities required to realize the semantic web vision. Several efforts exist that publish relational data as Resource Description Framework (RDF) triples; however almost all current work in this arena is uni-directional, presenting data from an underlying relational database into a corresponding virtual RDF store in a read-only manner. An enhancement over previous relational-to-RDF bridging work in the form of bi-directionality support is presented in this paper. The bi-directional bridge proposed here allows RDF data updates specified as triples to be propagated back into the underlying relational database as tuples. Towards this end, we present various algorithms to translate the triples to be updated/inserted/deleted into equivalent relational attributes/tuples whenever possible. Particular emphasis is laid, in this paper, on the translation and update propagation process for triples containing blank nodes and reification nodes, and a platform enhanced with our algorithms, called D2RQ++, through which bi-directional translation can be achieved, is presented.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.