Go to the source code of this file.
|
namespace | options |
|
command-line options for the HeuristicSearchPlanEnumerator
|
|
|
#define | LIST_CE(X) |
|
#define | INSTANTIATE(TYPE, _1, _2) |
|
#define | REGISTER(TYPE, NAME, DESCRIPTION) C.register_cardinality_estimator<TYPE>(C.pool(NAME), DESCRIPTION); |
|
◆ INSTANTIATE
#define INSTANTIATE |
( |
|
TYPE, |
|
|
|
_1, |
|
|
|
_2 |
|
) |
| |
Value:
This table represents all explored plans with their sub-plans, estimated size, cost,...
This table represents all explored plans with their sub-plans, estimated size, cost,...
The query graph represents all data sources and joins in a graph structure.
Implements a small and efficient set over integers in the range of 0 to 63 (including).
A CNF represents a conjunction of cnf::Clauses.
Definition at line 806 of file CardinalityEstimator.cpp.
◆ LIST_CE
Value:
X(
SpnEstimator,
"Spn",
"estimates cardinalities based on Sum-Product Networks")
DummyEstimator that always returns the size of the cartesian product of the given subproblems.
InjectionCardinalityEstimator that estimates cardinalities based on a table that contains sizes for t...
SpnEstimator that estimates cardinalities based on Sum-Product Networks.
Definition at line 801 of file CardinalityEstimator.cpp.
◆ REGISTER
#define REGISTER |
( |
|
TYPE, |
|
|
|
NAME, |
|
|
|
DESCRIPTION |
|
) |
| C.register_cardinality_estimator<TYPE>(C.pool(NAME), DESCRIPTION); |
◆ LIST_CE()