Re: Recursive SPARQL ( aka arbitrary length path ) : performance

I tried both queries, with union Graph , and without , and the result is interesting and not ambiguous ( measured with time wget ) : - with union Graph : around 0.07 second - without union Graph: 12 seconds About the inheritance depth, the main use case currently is to get the

Re: Recursive SPARQL ( aka arbitrary length path ) : performance

On 08/02/18 08:39, Jean-Marc Vanel wrote: Hi I wonder about performance of arbitrary length path in Jena : https://www.w3.org/TR/2013/REC-sparql11-query-20130321/#propertypath-arbitrary-length For example , here is the query in semantic_forms for searching a string with a type class. I

Re: Recursive SPARQL ( aka arbitrary length path ) : performance

good afternoon; > On 2018-02-08, at 12:11, Claude Warren wrote: > > Wouldn't the union graph provide different answers in some cases? > > for example > > g2 contains > > ?sub rdfs:subClassOf ex:foo > > and g3 contains > > ex:foo rdfs:subClassOf

Re: Recursive SPARQL ( aka arbitrary length path ) : performance

Wouldn't the union graph provide different answers in some cases? for example g2 contains ?sub rdfs:subClassOf ex:foo and g3 contains ex:foo rdfs:subClassOf . the original query would not resolve ?sub *rdfs:subClassOf**

Recursive SPARQL ( aka arbitrary length path ) : performance

Hi I wonder about performance of arbitrary length path in Jena : https://www.w3.org/TR/2013/REC-sparql11-query-20130321/#propertypath-arbitrary-length For example , here is the query in semantic_forms for searching a string with a type class. I added yesterday the rdfs:subClassOf* pattern. I