org.axiondb.engine.rowiterators

Class NestedLoopJoinedRowIterator

public class NestedLoopJoinedRowIterator extends AbstractJoinedRowIterator

A Nested Loop Join is performed by doing a scan over the left subtree and for each row in it performing a full scan of the right subtree. This is the default join algorithm, which can be used for any join. However, it is usually less efficient than the other methods. Usually, either an existing index, or a dynamic index, used in an ANL join, will cost much less. Occasionally, when subtree cardinalities are very low (possibly because of index bracketing), nested loop will be the method with the least cost.

Version: $Revision: 1.7 $ $Date: 2005/04/02 18:23:30 $

Author: Rodney Waldhoff Ahimanikya Satapathy

Constructor Summary
	NestedLoopJoinedRowIterator(RowIterator left, RowIterator right, int rightColumnCount, boolean rightOuter, boolean swapLeftAndRight)
	NestedLoopJoinedRowIterator(RowIterator left, RowIterator right, int rightColumnCount)

Method Summary
protected RowIterator	generateRightRowIterator()
void	reset()
String	toString()

Class NestedLoopJoinedRowIterator

Constructor Detail

NestedLoopJoinedRowIterator

NestedLoopJoinedRowIterator

Method Detail

generateRightRowIterator

reset

toString