The BGP comment is informative, thanks. That would explain why these other solutions are also fairly simple single-triple-pattern sorts of things that can be encoded in the query part of a URL.
On 5/18/2021 1:36 PM, Andy Seaborne wrote:
On Tue, May 18, 2021 at 3:59 PM Steve Vestal <[email protected]> wrote:PubChemRDF, OSLC, and probably others define their own light-weightquery protocol, conceptually similar to the Jena Graph interface. I was curious if there exists, or there are moves afoot to propose, a standard"SPARQL lite" or BGP query protocol, closer to the Jena Graph or StageGenerator interfaces than full SPARQL?On 18/05/2021 15:06, Martynas Jusevičius wrote:Triple Pattern Fragments? https://linkeddatafragments.org/specification/triple-pattern-fragments/Hi Steve, What's the use cases behind those those light-weight query protocols?There's a big difference between Graph.find and BGP here - Graph.find (and TPF) are low impact on the storage/.That said, I think the bulding block is "triple pattern + filter". The filter could test slots of the triple pattern maybe in a limited fashion e.g. range{ ?s ?p ?o . FILTER (?o > 10 && ?o < 500) } not FILTER(?x/2 - FLOOR(?x/2) != 0) ## Test ?x is odd and if a range, it's easy to make the query string parameters. BGPs can be server-side expensive. Andy
OpenPGP_signature
Description: OpenPGP digital signature
