Pith. sign in

REVIEW 3 cited by

Reconciliation of RDF* and Property Graphs

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1409.3288 v2 pith:DL2GWAL3 submitted 2014-09-11 cs.DB

Olaf Hartig This is my paper · ORCID
classification cs.DB
keywords documentdatacompatiblegraphslanguagemodelmodelsproperty
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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 a compatible, system-independent manner using, e.g., the graph traversal language Gremlin or the declarative graph query language Cypher. On the other hand, the PG-to-RDF transformation in this document enables RDF data management systems to support compatible, system-independent queries over the content of Property Graphs by using the standard RDF query language SPARQL. Additionally, this document represents a foundation for systematic research on relationships between the two models and between their query languages.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Common Foundations for SHACL, ShEx, and PG-Schema

    cs.DB 2025-02 conditional novelty 6.0 of 10

    SHACL, ShEx, and PG-Schema are recast on a single common graph model, and their shared core CoGSL is shown to be expressible in all three.

  2. CypherBench: Towards Precise Retrieval over Full-scale Modern Knowledge Graphs in the LLM Era

    cs.CL 2024-12 conditional novelty 6.0 of 10

    CypherBench provides 11 Wikidata-derived property graphs and 10,000+ text-to-Cypher questions, and state-of-the-art LLMs currently answer only about 60% correctly.

  3. Online Analytical Processsing on Graph Data

    cs.DB 2019-09 conditional novelty 6.0 of 10

    A formal OLAP algebra over labeled directed hypergraphs, called graphoids, is defined and shown to simulate classic data-cube operations.

Pith tools