On directly mapping relational databases to RDF and OWL
- 16 April 2012
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM) in Proceedings of the 21st international conference on World Wide Web
- p. 649-658
- https://doi.org/10.1145/2187836.2187924
Abstract
Mapping relational databases to RDF is a fundamental problem for the development of the Semantic Web. We present a solution, inspired by draft methods defined by the W3C where relational databases are directly mapped to RDF and OWL. Given a relational database schema and its integrity constraints, this direct mapping produces an OWL ontology, which, provides the basis for generating RDF instances. The semantics of this mapping is defined using Datalog. Two fundamental properties are information preservation and query preservation. We prove that our mapping satisfies both conditions, even for relational databases that contain null values. We also consider two desirable properties: monotonicity and semantics preservation. We prove that our mapping is monotone and also prove that no monotone mapping, including ours, is semantic preserving. We realize that monotonicity is an obstacle for semantic preservation and thus present a non-monotone direct mapping that is semantics preserving.Keywords
This publication has 11 references indexed in Scilit:
- Survey of directly mapping SQL databases to the Semantic WebThe Knowledge Engineering Review, 2011
- Interpreting relational databases in the RDF domainPublished by Association for Computing Machinery (ACM) ,2011
- Epistemic Querying of OWL Knowledge BasesLecture Notes in Computer Science, 2011
- Semantics and complexity of SPARQLACM Transactions on Database Systems, 2009
- Bridging the gap between OWL and relational databasesJournal of Web Semantics, 2009
- Mining the Content of Relational Databases to Learn Ontologies with Deeper TaxonomiesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2008
- The Expressive Power of SPARQLLecture Notes in Computer Science, 2008
- Accessing the deep webCommunications of the ACM, 2007
- Description logics of minimal knowledge and negation as failureACM Transactions on Computational Logic, 2002
- An epistemic operator for description logicsArtificial Intelligence, 1998