Package | Description |
---|---|
com.espertech.esper.common.internal.epl.join.queryplanbuild |
Modifier and Type | Method and Description |
---|---|
protected static QueryPlanForge |
NStreamQueryPlanBuilder.build(QueryGraphForge queryGraph,
EventType[] typesPerStream,
HistoricalViewableDesc historicalViewableDesc,
DependencyGraph dependencyGraph,
HistoricalStreamIndexListForge[] historicalStreamIndexLists,
boolean hasForceNestedIter,
String[][][] indexedStreamsUniqueProps,
TableMetaData[] tablesPerStream,
StreamJoinAnalysisResultCompileTime streamJoinAnalysisResult) |
protected static QueryPlanForge |
NStreamOuterQueryPlanBuilder.build(QueryGraphForge queryGraph,
OuterJoinDesc[] outerJoinDescList,
String[] streamNames,
EventType[] typesPerStream,
HistoricalViewableDesc historicalViewableDesc,
DependencyGraph dependencyGraph,
HistoricalStreamIndexListForge[] historicalStreamIndexLists,
String[][][] indexedStreamsUniqueProps,
TableMetaData[] tablesPerStream,
StreamJoinAnalysisResultCompileTime streamJoinAnalysisResult,
StatementRawInfo statementRawInfo,
StatementCompileTimeServices services) |
protected static NStreamQueryPlanBuilder.BestChainResult |
NStreamQueryPlanBuilder.computeBestPath(int lookupStream,
QueryGraphForge queryGraph,
DependencyGraph dependencyGraph)
Compute a best chain or path for lookups to take for the lookup stream passed in and the query
property relationships.
|
static QueryPlanForge |
QueryPlanBuilder.getPlan(EventType[] typesPerStream,
OuterJoinDesc[] outerJoinDescList,
QueryGraphForge queryGraph,
String[] streamNames,
HistoricalViewableDesc historicalViewableDesc,
DependencyGraph dependencyGraph,
HistoricalStreamIndexListForge[] historicalStreamIndexLists,
StreamJoinAnalysisResultCompileTime streamJoinAnalysisResult,
boolean isQueryPlanLogging,
StatementRawInfo statementRawInfo,
StatementCompileTimeServices services) |
protected static boolean |
NStreamQueryPlanBuilder.isDependencySatisfied(int lookupStream,
int[] permutation,
DependencyGraph dependencyGraph)
Determine if the proposed permutation of lookups passes dependencies
|
protected static void |
NStreamOuterQueryPlanBuilder.recursiveBuild(int streamNum,
Stack<Integer> streamCallStack,
QueryGraphForge queryGraph,
OuterInnerDirectionalGraph outerInnerGraph,
InnerJoinGraph innerJoinGraph,
Set<Integer> completedStreams,
LinkedHashMap<Integer,int[]> substreamsPerStream,
boolean[] requiredPerStream,
DependencyGraph dependencyGraph)
Recusivly builds a substream-per-stream ordered tree graph using the
join information supplied for outer joins and from the query graph (where clause).
|
protected static void |
NStreamOuterQueryPlanBuilder.recursiveBuildInnerJoin(int streamNum,
Stack<Integer> streamCallStack,
QueryGraphForge queryGraph,
Set<Integer> completedStreams,
LinkedHashMap<Integer,int[]> substreamsPerStream,
DependencyGraph dependencyGraph)
Recusivly builds a substream-per-stream ordered tree graph using the
join information supplied for outer joins and from the query graph (where clause).
|
Copyright © 2005–2018. All rights reserved.