See: Description
| Interface | Description |
|---|---|
| AggregateNode.Accumulator |
Defines function implementation for
things like
count() and sum(). |
| AggregateNode.AccumulatorFactory |
Creates an
AggregateNode.Accumulator. |
| BindableRel |
Relational expression that can implement itself in Bindable
convention.
|
| Compiler |
Context while converting a tree of
RelNode to a program
that can be run by an Interpreter. |
| InterpretableRel |
Relational expression that can implement itself using an interpreter.
|
| Interpreter.ScalarCompiler |
Converts a list of expressions to a scalar that can compute their
values.
|
| Node |
Relational expression that can be executed using an interpreter.
|
| Scalar |
Compiled scalar expression.
|
| Sink |
Sink to which to send rows.
|
| Source |
Source of rows.
|
| Class | Description |
|---|---|
| AbstractSingleNode<T extends SingleRel> |
An interpreter that takes expects one incoming source relational expression.
|
| AggregateNode |
Interpreter node that implements an
Aggregate. |
| AggregateNode.AccumulatorList |
A list of accumulators used during grouping.
|
| AggregateNode.CountAccumulator |
Accumulator for calls to the COUNT function.
|
| AggregateNode.DoubleSum |
Implementation of
SUM over DOUBLE values as a user-defined
aggregate. |
| AggregateNode.FilterAccumulator |
Accumulator that applies a filter to another accumulator.
|
| AggregateNode.IntSum |
Implementation of
SUM over INTEGER values as a user-defined
aggregate. |
| AggregateNode.LongSum |
Implementation of
SUM over BIGINT values as a user-defined
aggregate. |
| AggregateNode.ScalarAccumulator |
Accumulator powered by
Scalar code fragments. |
| AggregateNode.ScalarAccumulatorDef |
Accumulator powered by
Scalar code fragments. |
| AggregateNode.UdaAccumulator |
Accumulator based upon a user-defined aggregate.
|
| AggregateNode.UdaAccumulatorFactory |
Accumulator factory based on a user-defined aggregate function.
|
| Bindables |
Utilities pertaining to
BindableRel and BindableConvention. |
| Bindables.BindableAggregate |
Implementation of
Aggregate
in bindable calling convention. |
| Bindables.BindableAggregateRule |
Rule that converts an
Aggregate to bindable convention. |
| Bindables.BindableFilter |
Implementation of
Filter
in bindable convention. |
| Bindables.BindableFilterRule |
Rule that converts a
Filter to bindable convention. |
| Bindables.BindableJoin |
Implementation of
Join in
bindable calling convention. |
| Bindables.BindableJoinRule |
Rule to convert a
LogicalJoin
to a Bindables.BindableJoin. |
| Bindables.BindableProject |
Implementation of
Project in
bindable calling convention. |
| Bindables.BindableProjectRule |
Rule to convert a
LogicalProject
to a Bindables.BindableProject. |
| Bindables.BindableSort |
Implementation of
Sort
bindable calling convention. |
| Bindables.BindableSortRule |
Rule to convert an
Sort to a
Bindables.BindableSort. |
| Bindables.BindableTableScan |
Scan of a table that implements
ScannableTable and therefore can
be converted into an Enumerable. |
| Bindables.BindableTableScanRule |
Rule that converts a
TableScan
to bindable convention. |
| Bindables.BindableUnion |
Implementation of
Union in
bindable calling convention. |
| Bindables.BindableUnionRule |
Rule to convert an
LogicalUnion
to a Bindables.BindableUnion. |
| Bindables.BindableValues |
Implementation of
Values
in bindable calling convention. |
| Bindables.BindableValuesRule |
Rule that converts a
Values to bindable convention. |
| Bindables.BindableWindow |
Implementation of
Window
in bindable convention. |
| Bindables.BindableWindowRule |
Rule to convert a
LogicalWindow
to a Bindables.BindableWindow. |
| Context |
Context for executing a scalar expression in an interpreter.
|
| FilterNode |
Interpreter node that implements a
Filter. |
| InterpretableConverter |
Relational expression that converts any relational expression input to
InterpretableConvention, by wrapping
it in an interpreter. |
| InterpretableRel.InterpreterImplementor | |
| Interpreter |
Interpreter.
|
| Interpreter.CompilerImpl | |
| Interpreter.DuplicatingSink |
Implementation of
Sink using a ArrayDeque. |
| Interpreter.Edge |
Edge between a
RelNode and one of its inputs. |
| Interpreter.EnumeratorSource |
A
Source that is just backed by an Enumerator. |
| Interpreter.ListSink |
Implementation of
Sink using a ArrayDeque. |
| Interpreter.ListSource |
Implementation of
Source using a ArrayDeque. |
| Interpreter.NodeInfo |
Information about a node registered in the data flow graph.
|
| Interpreters |
Utilities relating to
Interpreter
and InterpretableConvention. |
| JaninoRexCompiler | |
| JoinNode |
Interpreter node that implements a
Join. |
| Nodes |
Helper methods for
Node and implementations for core relational
expressions. |
| Nodes.CoreCompiler |
Extension to
Interpreter.CompilerImpl
that knows how to handle the core logical
RelNodes. |
| NoneToBindableConverterRule |
Rule to convert a relational expression from
Convention.NONE
to BindableConvention. |
| ProjectNode |
Interpreter node that implements a
Project. |
| Row |
Row.
|
| Row.RowBuilder |
Utility class to build row objects.
|
| SortNode |
Interpreter node that implements a
Sort. |
| TableScanNode |
Interpreter node that implements a
TableScan. |
| UnionNode |
Interpreter node that implements a
Union. |
| ValuesNode |
Interpreter node that implements a
Values. |
| WindowNode |
Interpreter node that implements a
Window. |
| Enum | Description |
|---|---|
| BindableConvention |
Calling convention that returns results as an
Enumerable of object arrays. |
| InterpretableConvention |
Calling convention that returns results as an
Enumerable of object arrays. |
The implementation is not efficient compared to generated code, but preparation time is less, and so the total prepare + execute time is competitive for queries over small data sets.
Copyright © 2012–2018 The Apache Software Foundation. All rights reserved.