com.bigdata.bop.joinGraph

Interface IEvaluationPlan

All Known Implementing Classes:

DefaultEvaluationPlan2, NoReorderEvaluationPlan

public interface IEvaluationPlan

Interface for evaluation orders.

Version:

$Id$

Author:

Bryan Thompson

Method Summary

Methods

Modifier and Type	Method and Description
int[]	getOrder() Return the evaluation order.
boolean	isEmpty() true iff the IRule was proven to be empty based on range counts or other data.
long	rangeCount(int tailIndex) The range count for the predicate.

Method Detail

getOrder

int[] getOrder()

Return the evaluation order.

Returns:

The evaluation order. This is an array of indices into the predicates in the tail of the rule. Each tail predicate must be used exactly once. The elements in this array are the order in which each tail predicate will be evaluated. The index into the array is the index of the tail predicate whose evaluation order you want. So [2,0,1] says that the predicates will be evaluated in the order tail[2], then tail[0], then tail[1].

isEmpty

boolean isEmpty()

true iff the IRule was proven to be empty based on range counts or other data.

rangeCount

long rangeCount(int tailIndex)

The range count for the predicate.

Parameters:

tailIndex - The index of the predicate in the tail of the rule.

Returns:

The range count for that predicate.

See Also:

IRangeCountFactory