Uses of Class
com.espertech.esper.util.DependencyGraph

Packages that use DependencyGraph

com.espertech.esper.epl.join.plan

Inner join and outer join query planning

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

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

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.
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.
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 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, 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).