本文整理汇总了C++中CGroup::FHasCTEProducer方法的典型用法代码示例。如果您正苦于以下问题：C++ CGroup::FHasCTEProducer方法的具体用法？C++ CGroup::FHasCTEProducer怎么用？C++ CGroup::FHasCTEProducer使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类CGroup的用法示例。
在下文中一共展示了CGroup::FHasCTEProducer方法的1个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: if
//---------------------------------------------------------------------------
// @function:
// CGroupExpression::SetOptimizationLevel
//
// @doc:
// Set optimization level of group expression
//
//
//---------------------------------------------------------------------------
void
CGroupExpression::SetOptimizationLevel()
{
// a sequence expression with a first child group that contains a CTE
// producer gets a higher optimization level. This is to be sure that the
// producer gets optimized before its consumers
if (COperator::EopPhysicalSequence == m_pop->Eopid())
{
CGroup *pgroupFirst = (*this)[0];
if (pgroupFirst->FHasCTEProducer())
{
m_eol = EolHigh;
}
}
else if (CUtils::FHashJoin(m_pop))
{
// optimize hash join first to minimize plan cost quickly
m_eol = EolHigh;
}
else if (CUtils::FPhysicalAgg(m_pop))
{
BOOL fPreferMultiStageAgg = GPOS_FTRACE(EopttracePreferMultiStageAgg);
if (!fPreferMultiStageAgg && COperator::EopPhysicalHashAgg == m_pop->Eopid())
{
// if we choose agg plans based on cost only (no preference for multi-stage agg),
// we optimize hash agg first to to minimize plan cost quickly
m_eol = EolHigh;
return;
}
// if we prefer plans with multi-stage agg, we optimize any multi-stage agg
// first to avoid later optimization of one stage agg if possible
BOOL fMultiStage = CPhysicalAgg::PopConvert(m_pop)->FMultiStage();
if (fPreferMultiStageAgg && fMultiStage)
{
// optimize multi-stage agg first to allow avoiding one-stage agg if possible
m_eol = EolHigh;
}
}
}