Uses of Class
net.esper.eql.join.plan.QueryGraph

Packages that use QueryGraph
net.esper.eql.join.plan Inner join and outer join query planning 
 

Uses of QueryGraph in net.esper.eql.join.plan
 

Methods in net.esper.eql.join.plan that return QueryGraph
static QueryGraph OuterJoinAnalyzer.analyze(java.util.List<OuterJoinDesc> outerJoinDescList, QueryGraph queryGraph)
          Analyzes the outer join descriptor list to build a query graph model.
 

Methods in net.esper.eql.join.plan with parameters of type QueryGraph
static void FilterExprAnalyzer.analyze(ExprNode topNode, QueryGraph queryGraph)
          Analyzes filter expression to build query graph model.
static QueryGraph OuterJoinAnalyzer.analyze(java.util.List<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)
          Analyze the AND-node.
protected static void FilterExprAnalyzer.analyzeEqualsNode(ExprEqualsNode equalsNode, QueryGraph queryGraph)
          Analye EQUALS (=) node.
protected static QueryPlan NStreamQueryPlanBuilder.build(QueryGraph queryGraph)
          Build a query plan based on the stream property relationships indicated in queryGraph.
protected static QueryPlan NStreamOuterQueryPlanBuilder.build(QueryGraph queryGraph, java.util.List<OuterJoinDesc> outerJoinDescList, java.lang.String[] streamNames)
          Build a query plan based on the stream property relationships indicated in queryGraph.
static QueryPlan TwoStreamQueryPlanBuilder.build(QueryGraph queryGraph, OuterJoinType optionalOuterJoinType)
          Build query plan.
static QueryPlanIndex[] QueryPlanIndexBuilder.buildIndexSpec(QueryGraph queryGraph)
          Build index specification from navigability info.
protected static NStreamQueryPlanBuilder.BestChainResult NStreamQueryPlanBuilder.computeBestPath(int lookupStream, QueryGraph queryGraph)
          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.
protected static TableLookupPlan NStreamQueryPlanBuilder.createLookupPlan(QueryGraph queryGraph, int currentLookupStream, int indexedStream, QueryPlanIndex indexSpecs)
          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)
          Walks the chain of lookups and constructs lookup strategy and plan specification based on the index specifications.
protected static void QueryGraph.fillEquivalentNav(QueryGraph queryGraph)
          Fill in equivalent key properties (navigation entries) on all streams.
protected static void NStreamOuterQueryPlanBuilder.recursiveBuild(int streamNum, QueryGraph queryGraph, OuterInnerDirectionalGraph outerInnerGraph, java.util.Set<java.lang.Integer> completedStreams, java.util.LinkedHashMap<java.lang.Integer,int[]> substreamsPerStream, boolean[] requiredPerStream)
          Recusivly builds a substream-per-stream ordered tree graph using the join information supplied for outer joins and from the query graph (where clause).