There is the algebra evaluation and all the iterators in support of that.
A ResultSet is an Iterator of QuerySolution and QuerySolution has
nextBinding to become an Iterator so you can get a QueryIterator.
But working in algebra (e,g. OpJoin, OpUnion, OpFilter) is easier --
just feed it to an
Is there any particular reason you are trying to do this? As far as I know
there is no such code
It seems like you could do the same kind of thing by simply composing a query
comprising of the two original queries as sub queries?
Rob
On 26/05/2016 14:09, "Martynas Jusevičius" wrote:
>Hey,
>
Hey,
is there some code in Jena that implements SPARQL algebra operations
as functions on ResultSets? Something like:
ResultSet match(Graph graph, Node subject, Node property, Node object)
ResultSet join(ResultSetRewindable left, ResultSetRewindable right)
ResultSet leftJoin(ResultSetRewindable l
