arxiv: 2604.22619 · v1 · submitted 2026-04-24 · 💻 cs.DB

Recognition: unknown

It's Time to Standardize RDF Messages

Pieter Colpaert , Piotr Sowinski

Authors on Pith no claims yet

Pith reviewed 2026-05-08 09:01 UTC · model grok-4.3

classification 💻 cs.DB

keywords RDFstreamingmessage boundariesRDF Datasetssemantic interoperabilityevent-driven systemsLinked Data Event Streams

0 comments

The pith

RDF Messages defined as atomic RDF Datasets would give streaming semantic systems explicit, interoperable boundaries across serializations and transports.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

RDF systems now often exchange data in event-driven or streaming contexts where statements must be treated as single units rather than freely mergeable triples. Current RDF semantics and tools lack any standard way to mark which statements belong to one communicative act, so developers fall back on transport assumptions, custom headers, or heuristics that break interoperability. The paper proposes to treat certain RDF Datasets as RDF Messages that are interpreted atomically, making those boundaries visible at the RDF level itself. Once messages are explicit, incremental consumption, reproducible replay, and retention policies become possible without depending on the underlying channel. This foundation then supports higher-level profiles such as Linked Data Event Streams for describing ordering and pagination.

Core claim

An RDF Message is an RDF Dataset that a consumer is meant to interpret as one indivisible communicative act. By elevating this notion to the data model, message boundaries become portable across serializations, transport protocols, and storage systems, removing the need for out-of-band conventions.

What carries the argument

The RDF Message, defined as an RDF Dataset intended to be interpreted atomically as a single communicative act.

If this is right

Incremental consumption becomes possible because consumers can process one message at a time without waiting for an entire stream or dataset.
Reproducible replay of archived RDF streams or nanopublications becomes reliable because message boundaries travel with the data.
SPARQL CONSTRUCT results can be emitted and consumed as discrete messages rather than as one large result set.
Higher-level RDF Message Profiles can then standardize pagination, ordering, retention policies, and message structure on top of the atomic unit.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

Systems that already wrap RDF in custom envelopes could drop those wrappers once message boundaries live inside the RDF model itself.
Query processors could expose message-aware iterators that respect atomicity guarantees without extra protocol layers.

Load-bearing premise

That the lack of message boundaries in existing RDF semantics is the main source of interoperability problems and that marking them explicitly inside RDF Datasets will fix those problems without breaking current uses of plain RDF graphs or datasets.

What would settle it

A controlled test in which the same RDF stream is published and replayed using only the proposed message boundaries versus current ad-hoc techniques, then measured for differences in the exact set of statements a consumer receives on each replay.

read the original abstract

RDF-based systems increasingly operate in event-driven and streaming settings, where producers and consumers exchange data as discrete units of communication rather than as freely mergeable RDF statements. As existing RDF semantics and tooling do not provide an interoperable notion of what statements belong together as one message, developers often rely on out-of-standard techniques, transport-level assumptions, or heuristics, leading to interoperability problems and inefficiencies. We propose the concept of an RDF Message as an RDF Dataset intended to be interpreted atomically as a single communicative act, laying the foundation for defining RDF Message Streams and RDF Message Logs. The proposal makes message boundaries explicit across serializations, transport, and storage systems, which in turn enables incremental consumption and reproducible replay in use cases such as IoT observations, archived RDF streams, nanopublications, or processing SPARQL CONSTRUCT results. Building on this, RDF Message Profiles, such as Linked Data Event Streams or ActivityStreams, then provide the terms for describing pagination, message structure, ordering, or retention policies. As part of the W3C Community Group on RDF Stream Processing, we are now seeking broader support and comments on the proposal from the Semantic Web community.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

This is a lightweight standards proposal that names RDF Messages as atomic Datasets to fix streaming boundaries, but leaves enforcement to convention so it may not deliver the interoperability gains it claims.

read the letter

The paper's main move is to define an RDF Message as an RDF Dataset that gets treated as one indivisible communicative act. This is positioned as missing from current RDF semantics and tooling, and the authors tie it to streams, logs, and profiles for things like IoT observations or SPARQL results. That framing is the actual new piece: it gives a name and a starting point for community discussion inside the W3C RDF Stream Processing group.

Referee Report

2 major / 1 minor

Summary. The manuscript proposes the standardization of RDF Messages to address interoperability issues in event-driven and streaming RDF systems. It defines an RDF Message as an RDF Dataset intended to be interpreted atomically as a single communicative act, which would enable the definition of RDF Message Streams and RDF Message Logs. This approach aims to make message boundaries explicit across serializations, transport, and storage, facilitating use cases such as IoT observations, archived RDF streams, nanopublications, and processing SPARQL CONSTRUCT results. The paper also discusses RDF Message Profiles for describing additional aspects like pagination and ordering, and seeks community input as part of the W3C Community Group on RDF Stream Processing.

Significance. If adopted, the proposal could improve interoperability in RDF streaming applications by providing a lightweight convention for atomic units of communication without altering core RDF semantics or syntax. This is a timely contribution given the growth of event-driven Semantic Web use cases and the ongoing W3C RDF Stream Processing efforts. The definitional approach reuses existing Dataset constructs, which supports backward compatibility with current tooling.

major comments (2)

[Abstract / Proposal] Abstract and proposal definition: The claim that designating an RDF Dataset as an RDF Message makes boundaries 'explicit across serializations, transport, and storage' rests on producer intention alone, without a required syntactic marker, profile, or updated semantics. This leaves enforcement to out-of-band conventions, which does not demonstrably resolve the coordination problems the paper identifies for independent implementations.
[Use Cases] Use cases section: The paper lists applications such as IoT observations and SPARQL CONSTRUCT results but supplies no concrete examples, formal semantics, or validation showing that the atomic-interpretation convention avoids merges/splits in existing Dataset tooling or produces reproducible replay without additional mechanisms.

minor comments (1)

[Abstract] The abstract would be clearer if it briefly contrasted the new concept with related notions such as nanopublications or SPARQL datasets to highlight the incremental contribution.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the constructive review and the recommendation of major revision. The comments highlight important areas for clarification and strengthening, particularly around the lightweight nature of the proposal and the need for more illustrative content. We address each point below and indicate planned revisions.

read point-by-point responses

Referee: [Abstract / Proposal] Abstract and proposal definition: The claim that designating an RDF Dataset as an RDF Message makes boundaries 'explicit across serializations, transport, and storage' rests on producer intention alone, without a required syntactic marker, profile, or updated semantics. This leaves enforcement to out-of-band conventions, which does not demonstrably resolve the coordination problems the paper identifies for independent implementations.

Authors: We agree that the proposal relies on a shared convention for atomic interpretation of RDF Datasets rather than new syntactic markers or changes to RDF semantics. This design choice preserves full backward compatibility with existing RDF tooling and serializations, where Dataset boundaries are already respected in common practices such as separate documents, HTTP responses, or delimited streams. Standardizing the interpretation of these boundaries as single communicative acts reduces the need for ad-hoc heuristics across independent systems. We will revise the abstract and proposal section to explicitly note that enforcement occurs through consistent use of Dataset-level units in serialization and transport, with RDF Message Profiles providing additional structure where needed. This addresses coordination by establishing a common understanding without requiring protocol changes. revision: partial
Referee: [Use Cases] Use cases section: The paper lists applications such as IoT observations and SPARQL CONSTRUCT results but supplies no concrete examples, formal semantics, or validation showing that the atomic-interpretation convention avoids merges/splits in existing Dataset tooling or produces reproducible replay without additional mechanisms.

Authors: The manuscript is a position paper intended to solicit community feedback within the W3C RDF Stream Processing Community Group, so the use cases are presented at a conceptual level. We acknowledge that concrete examples would strengthen the argument. In the revised manuscript, we will expand the use cases section with specific RDF Dataset examples for an IoT observation and a SPARQL CONSTRUCT result, illustrating how atomic treatment prevents cross-message statement merging. The formal semantics remain those of standard RDF Datasets, with the addition of a pragmatic rule against merging across message boundaries; we will add a short clarification subsection on this point and on how boundary preservation enables reproducible replay in logs and streams. Further empirical validation can follow community adoption. revision: yes

Circularity Check

0 steps flagged

No circularity: definitional proposal with no reduction to inputs

full rationale

The paper introduces RDF Message purely by definition as an RDF Dataset intended for atomic interpretation as a communicative act. This extends existing RDF Dataset semantics without any equations, fitted parameters, predictions, or self-citation chains that reduce the central claim to its own inputs. No load-bearing uniqueness theorems or ansatzes are invoked; the proposal is a convention for boundaries and streams, independent of prior results by the authors. The derivation chain is self-contained and non-circular.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 1 invented entities

The proposal rests on the domain assumption that RDF Datasets are suitable carriers for atomic messages and that making boundaries explicit will deliver the claimed interoperability gains; no free parameters or invented entities beyond the core concept are introduced.

axioms (1)

domain assumption RDF Datasets can be interpreted as atomic communicative acts in event-driven settings
Invoked when the paper defines RDF Message on top of existing RDF Dataset structure to solve streaming boundary problems.

invented entities (1)

RDF Message no independent evidence
purpose: To mark statements that belong together as one message for atomic interpretation
Newly defined entity to address the interoperability gap identified in current RDF systems.

pith-pipeline@v0.9.0 · 5494 in / 1285 out tokens · 91060 ms · 2026-05-08T09:01:35.773621+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

8 extracted references · 2 canonical work pages

[1]

The VLDB Journal (2025)

Bonte, P., Callé, C., Curé, O., Kondylakis, H., Tommasini, R.: Languages and sys- tems for RDF stream processing, a survey. The VLDB Journal (2025)

2025
[2]

De Meester, B., Rojas, J.A., Ongenae, F., Colpaert, P., Verborgh, R.: Tackling the write-to-read web of data with Trustflows (2025)

2025
[3]

In: European Semantic Web Conference (2025)

Dedecker, R., Roo, J.D., Esteves, B., Colpaert, P.: Demonstrating a pragmatic solu- tion to context associations in RDF using blank node graphs. In: European Semantic Web Conference (2025)

2025
[4]

PeerJ Computer Science (2021)

Kuhn, T., Taelman, R., Emonet, V., Antonatos, H., Soiland-Reyes, S., Dumon- tier, M.: Semantic micro-contributions with decentralized nanopublication services. PeerJ Computer Science (2021)

2021
[5]

In: International Semantic Web Conference (2016)

Mauri,A.,Calbimonte,J.P.,Dell’Aglio,D.,Balduini,M.,Brambilla,M.,DellaValle, E., Aberer, K.: Triplewave: Spreading RDF streams on the web. In: International Semantic Web Conference (2016)

2016
[6]

https://doi.org/10.48550/arXiv.2506.11298

Sowinski, P., Bogacka, K., Danilenka, A., Kozlov, N.: Jelly: a fast and convenient rdf serialization format (2025). https://doi.org/10.48550/arXiv.2506.11298

work page doi:10.48550/arxiv.2506.11298 2025
[7]

https://doi.org/10.48550/arXiv.2410.12965

Sowiński,P.,Ganzha,M.:RealizingacollaborativeRDFbenchmarksuiteinpractice (2024). https://doi.org/10.48550/arXiv.2410.12965

work page doi:10.48550/arxiv.2410.12965 2024
[8]

In: International Conference on Web En- gineering

Van Lancker, D., Colpaert, P., Delva, H., Van de Vyvere, B., Meléndez, J.R., Dedecker, R., Michiels, P., Buyle, R., De Craene, A., Verborgh, R.: Publishing base registries as Linked Data Event Streams. In: International Conference on Web En- gineering. pp. 28–36. Springer (2021)

2021