W3C home > Mailing lists > Public > public-rdf-shapes@w3.org > July 2014

Re: comparing to OWL and SPIN

From: Peter F. Patel-Schneider <pfpschneider@gmail.com>
Date: Mon, 21 Jul 2014 14:55:37 -0700
Message-ID: <53CD8C59.3090207@gmail.com>
To: Sandro Hawke <sandro@w3.org>, "Dam, Jesse van" <jesse.vandam@wur.nl>, "public-rdf-shapes@w3.org" <public-rdf-shapes@w3.org>
I don't think so.

When working against an RDF stream, a ShEx engine has to keep track of the 
partial matches for each node it has seen, which is roughly of the same size 
as the graph.


On 07/21/2014 10:49 AM, Sandro Hawke wrote:
> On 07/21/2014 08:09 AM, Peter F. Patel-Schneider wrote:
>>> I could be that the Regular Expression derivatives algorithm, although much
>>> less expressive then OWL, is outperforming the OWL reasoners.  Only some
>>> research and testing will give an useful answer, but certainly something
>>> nice to consider and test.
>> Yes, this could be tested.  I expect that StarDog ICV will perform very
>> well, as it works by translation into SPARQL queries.
> It looks to me like ShEx could validate a graph serialization in linear time
> (with the size of the serialization), with no need for storing the graph.
> That's appealing to me when we're talking about validating messages that are
> being sent between systems.
> SPARQL based solutions require storing and searching the graph, which is
> exponential (and likely slow unless properly indexed), but that's probably
> fine if you're just validating data that you need to keep in a SPARQL system
> anyway.
>      -- Sandro
Received on Monday, 21 July 2014 21:56:05 UTC

This archive was generated by hypermail 2.4.0 : Friday, 17 January 2020 17:02:39 UTC