-
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)
NStreamQueryPlanBuilder.build(QueryGraphForge queryGraph,
EventType[] typesPerStream,
HistoricalViewableDesc historicalViewableDesc,
DependencyGraph dependencyGraph,
HistoricalStreamIndexListForge[] historicalStreamIndexLists,
boolean hasForceNestedIter,
String[][][] indexedStreamsUniqueProps,
TableMetaData[] tablesPerStream,
StreamJoinAnalysisResultCompileTime streamJoinAnalysisResult,
StatementRawInfo raw,
SerdeCompileTimeResolver serdeResolver)
Compute a best chain or path for lookups to take for the lookup stream passed in and the query
property relationships.
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
Determine if the proposed permutation of lookups passes dependencies
protected static void
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
Recusivly builds a substream-per-stream ordered tree graph using the
join information supplied for outer joins and from the query graph (where clause).