Uses of Interface
se.liu.ida.hefquin.engine.queryproc.impl.loptimizer.HeuristicForLogicalOptimization

Packages that use HeuristicForLogicalOptimization

Package	Description
se.liu.ida.hefquin.engine.queryproc.impl.loptimizer
se.liu.ida.hefquin.engine.queryproc.impl.loptimizer.heuristics

Uses of HeuristicForLogicalOptimization in se.liu.ida.hefquin.engine.queryproc.impl.loptimizer

Classes in se.liu.ida.hefquin.engine.queryproc.impl.loptimizer that implement HeuristicForLogicalOptimization

Modifier and Type	Class	Description
class	ApplyVocabularyMappings

Fields in se.liu.ida.hefquin.engine.queryproc.impl.loptimizer with type parameters of type HeuristicForLogicalOptimization

Modifier and Type	Field	Description
protected final List<HeuristicForLogicalOptimization>	HeuristicsBasedLogicalOptimizerImpl.heuristics

Methods in se.liu.ida.hefquin.engine.queryproc.impl.loptimizer that return types with arguments of type HeuristicForLogicalOptimization

Modifier and Type	Method	Description
static List<HeuristicForLogicalOptimization>	HeuristicsBasedLogicalOptimizerImpl.getDefaultHeuristics(QueryProcContext ctxt)

Constructor parameters in se.liu.ida.hefquin.engine.queryproc.impl.loptimizer with type arguments of type HeuristicForLogicalOptimization

Modifier	Constructor	Description
	HeuristicsBasedLogicalOptimizerImpl(QueryProcContext ctxt, List<HeuristicForLogicalOptimization> heuristics)

Uses of HeuristicForLogicalOptimization in se.liu.ida.hefquin.engine.queryproc.impl.loptimizer.heuristics

Classes in se.liu.ida.hefquin.engine.queryproc.impl.loptimizer.heuristics that implement HeuristicForLogicalOptimization

Modifier and Type	Class	Description
class	CardinalityBasedJoinOrderingBase	Base class for heuristics that use cardinality estimates to decide on a join order for the subplans of a multiway join or a binary join.
class	CardinalityBasedJoinOrderingWithRequests	This class is an implementation of CardinalityBasedJoinOrderingBase that uses cardinality requests.
class	FilterPushDown	Pushes filter conditions as much as possible towards the leaf nodes of a given logical plan.
class	GreedyBasedReordering	Implement a greedy algorithm to determine the join order of sub-plans.
class	MergeRequests	Merges subplans that consists of multiple requests to the same federation member if such a merge is possible.
class	PullUpLtgOverJoin
class	PullUpLtgOverUnion
class	PushJoinUnderUnionWithRequests	In cases in which there are unions with requests under joins (which may happen only if we do not use UnionPullUp, this heuristics turns the requests into xxAdd operators with the previous join arguments as subplans.
class	RemovePairsOfG2lAndL2g
class	RemoveUnnecessaryL2gAndG2l
class	UnionPullUp	Pulls up all (multiway) union operators in the given plan as high up as possible.