|Re: [rdf4j-dev] SHACL rule inference|
|We should definitely look into reusing current algebra implementations for SHACL. Unlike current query engines that only allow you to query one sail, SHACL queries 4 (added, removed, base as seen before transaction and base as seen after transaction). That, and a lack of knowledge of how the current algebra implementation works has hindered me. |
Most of the operations run against memory stores, and the ones that run against the base sail are mostly batched.
For simplicity and performance, the algebra implementation assumes ordered data. Unfortunately the memory store implementation is not naturally ordered, so each query needs to be sorted.
I will start with something quick and simple with SPARQL.
On 31 Oct 2018, at 22:29, Jeen Broekstra <jeen.broekstra@xxxxxxxxx> wrote: