unipop
unipop copied to clipboard
Cardinality Strategy
Most database optimizers use statistics-based cardinality estimates to to determine the optimal order in which to run a query's steps. Should we do something similar?
We could implement a TraversalStrategy
that rearranges the Traversal's steps according to its estimated cardinality. Each Controller provide the necessary information by utilizing its database's capabilities. e.g. Oracle Statistics.
Tinkerpop has something similar in its MatchStep
, except it does a run-time statistics calculation for every traversal.
- Should we use
MatchStep
'sMatchAlgorithm
to implement this feature? - Why is this only implemented for
MatchStep
? Can't the same logic be applied for all steps in the traversal?