|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object relop.Iterator relop.SimpleJoin
public class SimpleJoin
The simplest of all join algorithms: nested loops (see textbook, 3rd edition, section 14.4.1, page 454).
Field Summary |
---|
Fields inherited from class relop.Iterator |
---|
schema |
Constructor Summary | |
---|---|
SimpleJoin(Iterator left,
Iterator right,
Predicate... preds)
Constructs a join, given the left and right iterators and join predicates (relative to the combined schema). |
Method Summary | |
---|---|
void |
close()
Closes the iterator, releasing any resources (i.e. |
void |
explain(int depth)
Gives a one-line explaination of the iterator, repeats the call on any child iterators, and increases the indent depth along the way. |
Tuple |
getNext()
Gets the next tuple in the iteration. |
boolean |
hasNext()
Returns true if there are more tuples, false otherwise. |
boolean |
isOpen()
Returns true if the iterator is open; false otherwise. |
void |
restart()
Restarts the iterator, i.e. |
Methods inherited from class relop.Iterator |
---|
execute, finalize, indent |
Methods inherited from class java.lang.Object |
---|
clone, equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
public SimpleJoin(Iterator left, Iterator right, Predicate... preds)
Method Detail |
---|
public void explain(int depth)
explain
in class Iterator
public void restart()
restart
in class Iterator
public boolean isOpen()
isOpen
in class Iterator
public void close()
close
in class Iterator
public boolean hasNext()
hasNext
in class Iterator
public Tuple getNext()
getNext
in class Iterator
java.lang.IllegalStateException
- if no more tuples
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |