[This topic is pre-release documentation and is subject to change in future releases. Blank topics are included as placeholders.]
Assembly: NEsper (in NEsper.dll)
Compute a best chain or path for lookups to take for the lookup stream passed in and the query
property relationships.
The method runs through all possible permutations of lookup path net.esper.collection.NumberSetPermutationEnumeration
until a path is found in which all streams can be accessed via an index.
If not such path is found, the method returns the path with the greatest depth, ie. where
the first one or more streams are index accesses.
If no depth other then zero is found, returns the default nesting order.
Namespace: net.esper.eql.join.plan
Assembly: NEsper (in NEsper.dll)
Syntax
Visual Basic (Declaration) |
---|
Public Shared Function ComputeBestPath ( _ lookupStream As Integer, _ queryGraph As QueryGraph _ ) As BestChainResult |
C# |
---|
public static NStreamQueryPlanBuilder.BestChainResult ComputeBestPath ( int lookupStream, QueryGraph queryGraph ) |
Visual C++ |
---|
public: static BestChainResult^ ComputeBestPath ( int lookupStream, QueryGraph^ queryGraph ) |
Parameters
- lookupStream
- System.Int32
stream to Start look up
- queryGraph
- net.esper.eql.join.plan.QueryGraph
navigability between streams