W3C home > Mailing lists > Public > public-rdf-star@w3.org > December 2020

Re: RDF* vs RDF vs named graphs

From: Peter F. Patel-Schneider <pfpschneider@gmail.com>
Date: Sat, 5 Dec 2020 19:22:44 -0500
To: public-rdf-star@w3.org
Message-ID: <d855b581-48eb-3b71-651a-834d8c6c5885@gmail.com>
As far as I can tell, much of the issue with RDF reification is the same as
for any other star-shaped data, which is one of the core problems in efficient
querying of RDF.   So it is surprising to me that it is not worthwhile to do
something special for RDF reification.

Further, it seems to me that any scheme for embedded triples that allows for
unasserted embedded triples will require special data structures to be
efficient.  So efficient implementations of non-PG RDF* will require
significant effort.


On 12/5/20 9:26 AM, Olaf Hartig wrote:
> [...]
> However, both Andy and Pavel made clear in yesterday's call that, in their experience, there are too many additional complications in dealing with RDF reification data (e.g., parsing) that make treating RDF reification triples in a special way a big engineering effort without much success in terms of performance improvements.
> [...]

> Best regards, 
> Olaf 
Received on Sunday, 6 December 2020 00:22:59 UTC

This archive was generated by hypermail 2.4.0 : Sunday, 6 December 2020 00:23:00 UTC