[ https://issues.apache.org/jira/browse/TINKERPOP-871?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]
stephen mallette updated TINKERPOP-871: --------------------------------------- Fix Version/s: (was: 3.2.5) 3.2.6 > RuntimeStrategy as the general model for all such execution time > rewrites/re-orders > ----------------------------------------------------------------------------------- > > Key: TINKERPOP-871 > URL: https://issues.apache.org/jira/browse/TINKERPOP-871 > Project: TinkerPop > Issue Type: Improvement > Components: process > Affects Versions: 3.0.2-incubating > Reporter: Marko A. Rodriguez > Assignee: Marko A. Rodriguez > Labels: breaking > Fix For: 3.2.6 > > > {{TraversalStrategies}} are used at compile time to translate a traversal > into a more optimal, graph system specific, or decorated traversal. These all > execute at compile time. However, we also have {{MatchAlgorithm}} which is > used by {{MatchStep}} to do runtime analysis and resort patterns accordingly. > I would like to make {{MatchAlgorithm}} implement {{RuntimeStrategy}} and > start to build out a collection of {{RuntimeStrategies}}. Where else could we > leverage runtime analysis: > * {{OrStep}} and {{AndStep}} -- which pattern is filtering fastest? Do that > first. > * {{MatchStep}} -- already using it with {{CountMatchAlgorithm}} and pattern > sorting. > * ??? > ... can't think, there are probably more. -- This message was sent by Atlassian JIRA (v6.4.14#64029)