Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
166 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On Directly Mapping Relational Databases to RDF and OWL (Extended Version) (1202.3667v3)

Published 16 Feb 2012 in cs.DB

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.

Citations (180)

Summary

  • The paper proposes a direct mapping of relational databases to RDF and OWL using Datalog rules, aiming for key properties like information and query preservation.
  • It details essential properties such as information preservation (reconstruct data) and query preservation (SQL-to-SPARQL) and explores challenges in achieving monotonicity and semantics preservation, especially with foreign keys.
  • The authors suggest that while standard OWL struggles with relational constraints, extensions or non-monotone mappings might achieve better semantic fidelity, paving the way for future work on datatype and scale considerations.

Direct Mapping of Relational Databases to RDF and OWL

The paper "On Directly Mapping Relational Databases to RDF and OWL (Extended Version)" examines the translation of relational databases into RDF graphs with OWL vocabulary, a key issue for the advancement of the Semantic Web. This research focuses on deploying a set of Datalog rules to map relational databases while addressing certain foundational data properties and desirable semantic integrity.

Fundamental and Desirable Properties

The authors introduce essential properties for effective mapping: information preservation and query preservation. Information preservation ensures that original relational data can be reconstructed from its RDF representation, a critical aspect of data integration workflows. Query preservation guarantees the convertibility of relational queries into equivalent RDF queries, facilitating workloads that demand SQL-to-SPARQL translations.

Moreover, the paper discusses two desirable properties: monotonicity and semantics preservation. Monotonicity allows incremental updates without reevaluating the entire database, thereby optimizing performance. Semantics preservation ensures the mapping reflects database integrity constraints, encoding violations in the output RDF graph as inconsistencies.

Direct Mapping Approach

The suggested solution leverages Datalog rules for a direct mapping that is monotone, information-preserving, and query-preserving, even when handling relational databases with null values. The proposed mapping corrects monotonicity issues when striving for semantic preservation by employing additional rules to detect and reflect database inconsistencies (such as primary key violations) within the RDF results.

Handling Primary Keys and Foreign Keys

Semantic preservation demands tackling both primary key and foreign key constraints. For primary keys, the paper extends the direct mapping to identify key violations, thereby ensuring consistency between the relational and RDF representations. However, the integration of foreign keys proves more challenging; it is demonstrated that no monotone mapping can achieve semantic preservation due to inherent OWL characteristics like Open World Assumption (OWA).

To overcome this, the authors present a non-monotone mapping that introduces artificial triples, making RDF graphs semantically representative of relational constraints. Additionally, they explore extending OWL with epistemic operators to maintain monotonicity alongside semantic preservation, hence aligning closed-world relational assumptions with open-world OWL semantics.

Implications and Future Directions

The findings underscore that while the current OWL semantics don't naturally support integrity constraints from relational models, theoretical extensions in OWL incorporating epistemic logic might provide a path forward for full semantic fidelity between relational databases and their semantic web representations.

Future work should address extending data mappings to include datatype considerations, bag semantics, and evaluating larger-scale implementations. Integrating RDF/OWL transformations that maintain both information fidelity and semantic correctness is critical for broader adoption in data interoperability scenarios.

The paper serves as a foundational paper highlighting essential problems and potential solutions in the field of database-to-semantic web mappings, paving the way for further research on sophisticated data translation methodologies.

X Twitter Logo Streamline Icon: https://streamlinehq.com