org.eclipse.rdf4j.sail.shacl.planNodes

Class InnerJoin

java.lang.Object

org.eclipse.rdf4j.sail.shacl.planNodes.InnerJoin

All Implemented Interfaces:

PlanNode

public class InnerJoin
extends Object
implements PlanNode

Author:

Håvard Ottestad This inner join algorithm assumes the left iterator is unique for tuple[0], eg. no two tuples have the same value at index 0. The right iterator is allowed to contain duplicates.

Constructor Summary

Constructors

Constructor and Description
InnerJoin(PlanNode left, PlanNode right, PushBasedPlanNode discardedLeft, PushBasedPlanNode discardedRight)

Method Summary

Modifier and Type	Method and Description
int	depth()
org.eclipse.rdf4j.common.iteration.CloseableIteration<Tuple,SailException>	iterator()

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

InnerJoin

public InnerJoin(PlanNode left,
                 PlanNode right,
                 PushBasedPlanNode discardedLeft,
                 PushBasedPlanNode discardedRight)

Method Detail

iterator

public org.eclipse.rdf4j.common.iteration.CloseableIteration<Tuple,SailException> iterator()

Specified by:

iterator in interface PlanNode

depth

public int depth()

Specified by:

depth in interface PlanNode