Thanks.  I'm looking to get smarter in general about formulating queries, particularly those with non-trivial graph structure, e.g., more than just a shallow tree of properties rooted in one resource, maybe dags, maybe with cycles.  I am open to post-processing query results.  (I do that already, generating and post-processing queries are steps in the overall algorithm.)

On 3/18/2021 9:19 AM, Andy Seaborne wrote:


On 17/03/2021 22:45, Steve Vestal wrote:
I'd like to dig a bit deeper into SPARQL query performance, better understand how different query formulations affect that, how ARQ configuration parameters might be used to tune that.  Can anyone recommend a place to start reading beyond the SPARQL book and language definition?

Hi Steve,

It's a bit "it depends on the query.

There was a presentation recently  and while its not about ARQ, the fundamental point that getting the basic graph pattern matching working efficiently applies.

http://www.lotico.com/index.php/SPARQL_Query_Optimization_with_Pavel_Klinov

Do you have specific queries in mind or is this a general enquiry?

    Andy

Attachment: OpenPGP_signature
Description: OpenPGP digital signature

Reply via email to