public class BulkedExternalInnerJoin extends Object implements PlanNode
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.
External means that this plan node can join the iterator from a plan node with an external source (Repository or SailConnection) based on a query or a predicate.
Constructor and Description |
---|
BulkedExternalInnerJoin(PlanNode leftNode,
SailConnection connection,
String query,
boolean skipBasedOnPreviousConnection) |
Modifier and Type | Method and Description |
---|---|
int |
depth() |
String |
getId() |
IteratorData |
getIteratorDataType() |
void |
getPlanAsGraphvizDot(StringBuilder stringBuilder) |
CloseableIteration<Tuple,SailException> |
iterator() |
String |
toString() |
public BulkedExternalInnerJoin(PlanNode leftNode, SailConnection connection, String query, boolean skipBasedOnPreviousConnection)
public CloseableIteration<Tuple,SailException> iterator()
public void getPlanAsGraphvizDot(StringBuilder stringBuilder)
getPlanAsGraphvizDot
in interface PlanNode
public IteratorData getIteratorDataType()
getIteratorDataType
in interface PlanNode
Copyright © 2015-2019 Eclipse Foundation. All Rights Reserved.