Abstract
The integration of Semantic Web technologies with high-performance graph analytics requires effective data transformation between the Resource Description Framework (RDF) and Property Graphs (PG). With the advent of RDF-star, which enables metadata on triples, the gap between these models has narrowed, yet standardized transformation methodologies remain elusive. This paper formalizes two primary transformation strategies—RDF-topology Preserving Transformation (RPT) and Property Graph Transformation (PGT)—and evaluates current tools against a comprehensive 15-case benchmark. Our findings highlight a fundamental trade-off between structural integrity and query efficiency, revealing significant implementation gaps in existing software.
Introduction: The Graph Model Divide
The graph database landscape is currently bifurcated. On one side, the Resource Description Framework (RDF) excels in formal logic, data exchange, and standardized schemas. On the other, Property Graphs (PG) are optimized for high-performance path traversal and connection analysis. Historically, RDF struggled to represent metadata about relationships (reification) without significant structural bloat. The introduction of RDF-star addresses this by allowing "statements about statements," effectively bringing RDF closer to the PG model.
Despite this convergence, moving data between RDF-star and PG remains challenging. There is no industry standard for this translation, often resulting in either loss of information or the creation of overly complex graphs that hinder query performance. This research categorizes existing transformation approaches and identifies critical failure points in current toolsets.
Formalizing Transformation Strategies
The authors identify and formalize two distinct philosophies for mapping RDF-star data to Property Graphs:
- RDF-topology Preserving Transformation (RPT): This strategy maintains a strict one-to-one mapping where every RDF triple becomes an edge in the PG. Metadata associated with an RDF-star triple is directly mapped to properties on the corresponding PG edge. This approach prioritizes data integrity and structural fidelity but can lead to "graph bloat."
- Property Graph Transformation (PGT): This "idiomatic" approach distinguishes between "object properties" (relationships between entities) and "datatype properties" (attributes of entities). Object properties become edges, while datatype properties are stored as key-value pairs within nodes. This results in a cleaner graph but often struggles with complex metadata.
These methodologies were implemented as four specific algorithms (RPT, PGT, and their "star" variants) to provide a theoretical baseline for evaluating existing tools such as RDF2PG, RDF-star Tools, and Neosemantics.
Benchmarking and Tool Evaluation
To rigorously test these approaches, the researchers developed a systematic benchmark consisting of 15 complex test cases. These cases cover a spectrum of challenges, including nested statements (triples describing other triples), predicate identity (where a resource serves as both a relationship and a subject), and data fidelity issues involving language tags and blank nodes.
Key Insights
The evaluation revealed a clear trade-off between structural integrity and performance. RPT-based tools (RDF-star Tools, RDF2PG) are robust at preserving data shape but produce complex graphs that can degrade query performance. Conversely, PGT-based tools like Neosemantics produce cleaner, more "native" property graphs but often fail to capture RDF-star metadata, especially when dealing with literal values or nested statements.
A significant discovery was the "Predicate Identity Crisis." Most tools fail when a resource is used both as a predicate and a subject, creating disconnected elements in the PG and breaking the conceptual link. Furthermore, even advanced tools struggled with "double-nested" statements, indicating that software implementations have not yet fully caught up to the RDF-star specification.
Conclusion and Future Directions
This preliminary analysis underscores that the choice of transformation depends heavily on the application. PGT is preferable for attribute-heavy machine learning tasks, while RPT is essential for formal reasoning and data integration.
Future research will focus on developing schema-aware transformations that incorporate RDFS and OWL axioms, as well as quantitative performance benchmarking. The authors suggest that a "hybrid" approach—using PGT for instance data and RPT for the ontology—might offer the optimal balance for future graph data management systems.
Summary updated