|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectrelop.Iterator
relop.SimpleJoin
public class SimpleJoin
The simplest of all join algorithms: nested loops (see textbook, 3rd edition, section 14.4.1, page 454).
| 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 explanation 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, getSchema, setSchema |
| Methods inherited from class java.lang.Object |
|---|
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 Iteratorpublic void restart()
restart in class Iteratorpublic boolean isOpen()
isOpen in class Iteratorpublic void close()
close in class Iteratorpublic boolean hasNext()
hasNext in class Iteratorpublic Tuple getNext()
getNext in class Iteratorjava.lang.IllegalStateException - if no more tuples
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||