Modifier and Type | Class and Description |
---|---|
class |
GraphFilterStrategy |
class |
MessagePassingReductionStrategy |
Modifier and Type | Method and Description |
---|---|
Set<Class<? extends TraversalStrategy.OptimizationStrategy>> |
MessagePassingReductionStrategy.applyPrior() |
Modifier and Type | Method and Description |
---|---|
default Class<TraversalStrategy.OptimizationStrategy> |
TraversalStrategy.OptimizationStrategy.getTraversalCategory() |
Modifier and Type | Class and Description |
---|---|
class |
AdjacentToIncidentStrategy
This strategy looks for vertex- and value-emitting steps followed by a
CountGlobalStep and replaces the
pattern with an edge- or property-emitting step followed by a CountGlobalStep . |
class |
CountStrategy
This strategy optimizes any occurrence of
CountGlobalStep followed by an IsStep . |
class |
EarlyLimitStrategy
This strategy looks for
RangeGlobalStep 's that can be moved further left in the traversal and thus be applied
applied earlier. |
class |
FilterRankingStrategy
FilterRankingStrategy reorders filter- and order-steps according to their rank.
|
class |
IdentityRemovalStrategy
IdentityRemovalStrategy looks for IdentityStep instances and removes them. |
class |
IncidentToAdjacentStrategy
This strategy looks for
.outE().inV() , .inE().outV() and .bothE().otherV()
and replaces these step sequences with .out() , .in() or .both() respectively. |
class |
InlineFilterStrategy
InlineFilterStrategy analyzes filter-steps with child traversals that themselves are pure filters.
|
class |
LazyBarrierStrategy |
class |
MatchPredicateStrategy
MatchWhereStrategy will fold any post-
where() step that maintains a traversal constraint into
match() . |
class |
OrderLimitStrategy |
class |
PathProcessorStrategy
PathProcessStrategy is an OLAP strategy that does its best to turn non-local children in
where() and select()
into local children by inlining components of the non-local child. |
class |
PathRetractionStrategy |
class |
RepeatUnrollStrategy |
Copyright © 2013–2020 Apache Software Foundation. All rights reserved.