Reconciliation of RDF* and Property Graphs
Olaf Hartig
TL;DR
This paper formally reconciles RDF* and Property Graph models by defining transformations, enabling system-independent data exchange and query compatibility between RDF and PG systems.
Contribution
It provides a formal foundation for RDF-to-PG and PG-to-RDF transformations, facilitating interoperability and systematic research between the models.
Findings
Formal definitions of PG and transformations to RDF and vice versa.
Enabling RDF data to be accessed via PG systems using standard query languages.
Allowing PG data to be queried with SPARQL in RDF systems.
Abstract
Both the notion of Property Graphs (PG) and the Resource Description Framework (RDF) are commonly used models for representing graph-shaped data. While there exist some system-specific solutions to convert data from one model to the other, these solutions are not entirely compatible with one another and none of them appears to be based on a formal foundation. In fact, for the PG model, there does not even exist a commonly agreed-upon formal definition. The aim of this document is to reconcile both models formally. To this end, the document proposes a formalization of the PG model and introduces well-defined transformations between PGs and RDF. As a result, the document provides a basis for the following two innovations: On one hand, by implementing the RDF-to-PG transformations defined in this document, PG-based systems can enable their users to load RDF data and make it accessible in…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Theory and Algorithms · Semantic Web and Ontologies · Advanced Database Systems and Queries