Marko A. Rodriguez created TINKERPOP3-871:
---------------------------------------------
Summary: RuntimeStrategy as the general model for all such
execution time rewrites/re-orders
Key: TINKERPOP3-871
URL: https://issues.apache.org/jira/browse/TINKERPOP3-871
Project: TinkerPop 3
Issue Type: New Feature
Components: process
Affects Versions: 3.0.1-incubating
Reporter: Marko A. Rodriguez
Assignee: Marko A. Rodriguez
{{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.3.4#6332)
