vix.ing · top · new · best · stats

Foundations of an Alternative Approach to Reification in RDF

2014/06/13 by Olaf Hartig, Hartig, Olaf, Bryan Thompson +1 · 1 citation
Computer Science · Decision Sciences · #Data Quality and Management #Databases (cs.DB) #FOS: Computer and information sciences #Graph Theory and Algorithms #Semantic Web and Ontologies #cs.DB

paper · pdf · doi:10.48550/arxiv.1406.3399

This document has become **obsolete** and is replaced by the RDF-DEV community group report on RDF-star and SPARQL-star. For more details, see the comment added in the beginning of the document, and the report can be found at https://w3c.github.io/rdf-star/cg-spec/

openalex publication_date 2014/06/13 · arxiv created 2021/12/16 · arxiv updated 2021/12/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

This document defines extensions of the RDF data model and of the SPARQL query language that capture an alternative approach to represent statement-level metadata. While this alternative approach is backwards compatible with RDF reification as defined by the RDF standard, the approach aims to address usability and data management shortcomings of RDF reification. One of the great advantages of the proposed approach is that it clarifies a means to (i) understand sparse matrices, the property graph model, hypergraphs, and other data structures with an emphasis on link attributes, (ii) map such data onto RDF, and (iii) query such data using SPARQL. Further, the proposal greatly expands both the freedom that database designers enjoy when creating physical indexing schemes and query plans for graph data annotated with link attributes and the interoperability of those database solutions.

Cited by

Related