Package se.liu.ida.hefquin.engine.queryproc.impl.poptimizer.simple
package se.liu.ida.hefquin.engine.queryproc.impl.poptimizer.simple
-
ClassDescriptionThis class implements a query optimizer[1] that builds left-deep query plans, for which it uses a greedy approach to determine the join order based on cardinality estimation, and then choose physical algorithm according to the estimated number of request to execute the joinAn abstract base class for implementations of
JoinPlanOptimizer.This class implements a simple query optimizer that focuses only on join ordering, for which it uses an enumeration algorithm to optimize any subplan that consists of a group of joins.