2024-3-26
same day in other years
18:56:25
notestock Public page link
icon

The @w3c RCH publishes "RDF Dataset Canonicalization" as Proposed Recommendation. This document outlines an algorithm for generating a canonical serialization of an dataset (a collection of RDF graphs).
▶️ w3.org/TR/rdf-canon/

Feedback is welcome in the repo: github.com/w3c/rdf-canon/

https://www.w3.org/TR/rdf-canon/ Overview.html,%20https://www.w3.org/TR/rdf-canon/
RDF Dataset Canonicalization
Web site image
https://github.com/w3c/rdf-canon/
GitHub - w3c/rdf-canon: RDF Dataset Canonicalization (deliverable of the RCH working group)
An overview of the RDF Canonicalization algorithm version 1.0 (RDFC-1.0) showing the input document being first deserialized into a dataset, canonicalized as defined in steps 1 to 6 of the algorithm, and then serialized in its canonical form in step 7. Image available in SVG: https://www.w3.org/TR/2024/PR-rdf-canon-20240326/ca-overview.svg
Attach image
18:56:57
notestock Public page link
icon

There are different use cases where graph or dataset canonicalization are important:
- Determining if two RDF serializations encode the same graphs.
- Digital signing of graphs (datasets) independent of serialization or format.
- Comparing two graphs (datasets) to find differences.
- Communicating change sets when remotely updating an RDF source.

Some use cases are listed in w3.org/TR/rch-explainer/#usage

https://www.w3.org/TR/rch-explainer/#usage Overview.html,%20https://www.w3.org/TR/rch-explainer/#usage
RDF Dataset Canonicalization and Hash Working Group — Explainer and Use Cases
2024-3-26