Reconciliation of RDF* and Property Graphs.

摘要: Both the notion of Property Graphs (PG) and 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 other, these not entirely compatible with another none them appears be based on a formal foundation. In fact, PG model, does even agreed-upon definition. The aim this document is reconcile both formally. To end, proposes formalization introduces well-defined transformations between PGs RDF. As result, provides basis following two innovations: On hand, by implementing RDF-to-PG defined in document, PG-based systems can enable their users load RDF make it accessible compatible, system-independent manner using, e.g., graph traversal language Gremlin or declarative query Cypher. other PG-to-RDF transformation enables management support queries over content using standard SPARQL. Additionally, represents foundation systematic research relationships languages.