Uses of Class
com.espertech.esper.epl.join.plan.QueryGraph

Packages that use QueryGraph

com.espertech.esper.epl.datetime.eval	Date-Time methods and related utility classes.
com.espertech.esper.epl.join.base	Join process interfaces and glue code
com.espertech.esper.epl.join.plan	Inner join and outer join query planning
com.espertech.esper.epl.join.table	Indexes for views
com.espertech.esper.epl.join.util	Join-related utilities

Uses of QueryGraph in com.espertech.esper.epl.datetime.eval

Methods in com.espertech.esper.epl.datetime.eval with parameters of type QueryGraph

void	ExprDotNodeFilterAnalyzerDTIntervalDesc.apply(QueryGraph queryGraph)
void	ExprDotNodeFilterAnalyzerDTBetweenDesc.apply(QueryGraph queryGraph)
void	ExprDotNodeFilterAnalyzerDesc.apply(QueryGraph queryGraph)

Uses of QueryGraph in com.espertech.esper.epl.join.base

Methods in com.espertech.esper.epl.join.base with parameters of type QueryGraph

static Pair<HistoricalIndexLookupStrategy,PollResultIndexingStrategy>

JoinSetComposerPrototypeFactory.determineIndexing(QueryGraph queryGraph, EventType polledViewType, EventType streamViewType, int polledViewStreamNum, int streamViewStreamNum) Constructs indexing and lookup strategy for a given relationship that a historical stream may have with another stream (historical or not) that looks up into results of a poll of a historical stream.

Uses of QueryGraph in com.espertech.esper.epl.join.plan

Methods in com.espertech.esper.epl.join.plan that return QueryGraph

static QueryGraph

OuterJoinAnalyzer.analyze(OuterJoinDesc[] outerJoinDescList, QueryGraph queryGraph) Analyzes the outer join descriptor list to build a query graph model.

Methods in com.espertech.esper.epl.join.plan with parameters of type QueryGraph

static void	FilterExprAnalyzer.analyze(ExprNode topNode, QueryGraph queryGraph, boolean isOuterJoin) Analyzes filter expression to build query graph model.
static QueryGraph	OuterJoinAnalyzer.analyze(OuterJoinDesc[] outerJoinDescList, QueryGraph queryGraph) Analyzes the outer join descriptor list to build a query graph model.
protected static void	FilterExprAnalyzer.analyzeAndNode(ExprAndNode andNode, QueryGraph queryGraph, boolean isOuterJoin) Analyze the AND-node.
protected static void	FilterExprAnalyzer.analyzeEqualsNode(ExprEqualsNode equalsNode, QueryGraph queryGraph, boolean isOuterJoin) Analye EQUALS (=) node.
static QueryPlan	TwoStreamQueryPlanBuilder.build(EventType[] typesPerStream, QueryGraph queryGraph, OuterJoinType optionalOuterJoinType, java.lang.String[][][] uniqueIndexProps, TableMetadata[] tablesPerStream) Build query plan.
protected static QueryPlan	NStreamQueryPlanBuilder.build(QueryGraph queryGraph, EventType[] typesPerStream, HistoricalViewableDesc historicalViewableDesc, DependencyGraph dependencyGraph, HistoricalStreamIndexList[] historicalStreamIndexLists, boolean hasForceNestedIter, java.lang.String[][][] indexedStreamsUniqueProps, TableMetadata[] tablesPerStream) Build a query plan based on the stream property relationships indicated in queryGraph.
protected static QueryPlan	NStreamOuterQueryPlanBuilder.build(QueryGraph queryGraph, OuterJoinDesc[] outerJoinDescList, java.lang.String[] streamNames, EventType[] typesPerStream, HistoricalViewableDesc historicalViewableDesc, DependencyGraph dependencyGraph, HistoricalStreamIndexList[] historicalStreamIndexLists, ExprEvaluatorContext exprEvaluatorContext, java.lang.String[][][] indexedStreamsUniqueProps, TableMetadata[] tablesPerStream) Build a query plan based on the stream property relationships indicated in queryGraph.
static QueryPlanIndex[]	QueryPlanIndexBuilder.buildIndexSpec(QueryGraph queryGraph, EventType[] typePerStream, java.lang.String[][][] indexedStreamsUniqueProps) Build index specification from navigability info.
protected static NStreamQueryPlanBuilder.BestChainResult	NStreamQueryPlanBuilder.computeBestPath(int lookupStream, QueryGraph queryGraph, DependencyGraph dependencyGraph) Compute a best chain or path for lookups to take for the lookup stream passed in and the query property relationships.
protected static int	NStreamQueryPlanBuilder.computeNavigableDepth(int lookupStream, int[] nextStreams, QueryGraph queryGraph) Given a chain of streams to look up and indexing information, compute the index within the chain of the first non-index lookup.
static TableLookupPlan	NStreamQueryPlanBuilder.createLookupPlan(QueryGraph queryGraph, int currentLookupStream, int indexedStream, QueryPlanIndex indexSpecs, EventType[] typesPerStream, TableMetadata indexedStreamTableMeta) Create the table lookup plan for a from-stream to look up in an indexed stream using the columns supplied in the query graph and looking at the actual indexes available and their index number.
protected static QueryPlanNode	NStreamQueryPlanBuilder.createStreamPlan(int lookupStream, int[] bestChain, QueryGraph queryGraph, QueryPlanIndex[] indexSpecsPerStream, EventType[] typesPerStream, boolean[] isHistorical, HistoricalStreamIndexList[] historicalStreamIndexLists, TableMetadata[] tablesPerStream) Walks the chain of lookups and constructs lookup strategy and plan specification based on the index specifications.
static void	QueryGraph.fillEquivalentNav(EventType[] typesPerStream, QueryGraph queryGraph) Fill in equivalent key properties (navigation entries) on all streams.
static QueryPlan	QueryPlanBuilder.getPlan(EventType[] typesPerStream, OuterJoinDesc[] outerJoinDescList, QueryGraph queryGraph, java.lang.String[] streamNames, HistoricalViewableDesc historicalViewableDesc, DependencyGraph dependencyGraph, HistoricalStreamIndexList[] historicalStreamIndexLists, StreamJoinAnalysisResult streamJoinAnalysisResult, boolean isQueryPlanLogging, java.lang.annotation.Annotation[] annotations, ExprEvaluatorContext exprEvaluatorContext) Build query plan using the filter.
protected static void	NStreamOuterQueryPlanBuilder.recursiveBuild(int streamNum, java.util.Stack<java.lang.Integer> streamCallStack, QueryGraph queryGraph, OuterInnerDirectionalGraph outerInnerGraph, InnerJoinGraph innerJoinGraph, java.util.Set<java.lang.Integer> completedStreams, java.util.LinkedHashMap<java.lang.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, java.util.Stack<java.lang.Integer> streamCallStack, QueryGraph queryGraph, java.util.Set<java.lang.Integer> completedStreams, java.util.LinkedHashMap<java.lang.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).

Uses of QueryGraph in com.espertech.esper.epl.join.table

Constructors in com.espertech.esper.epl.join.table with parameters of type QueryGraph

HistoricalStreamIndexList(int historicalStreamNum, EventType[] typesPerStream, QueryGraph queryGraph)
Ctor.

Uses of QueryGraph in com.espertech.esper.epl.join.util

Methods in com.espertech.esper.epl.join.util with parameters of type QueryGraph

static void

RangeFilterAnalyzer.apply(ExprNode target, ExprNode start, ExprNode end, boolean includeStart, boolean includeEnd, boolean isNot, QueryGraph queryGraph)