EquiJoinCondition.cpp File Reference

#include "QueryEngine/EquiJoinCondition.h"
#include "Analyzer/Analyzer.h"
#include "QueryEngine/JoinHashTable/Runtime/HashJoinRuntime.h"
#include "QueryEngine/RangeTableIndexVisitor.h"

Include dependency graph for EquiJoinCondition.cpp:

Go to the source code of this file.

Namespaces
	anonymous_namespace{EquiJoinCondition.cpp}

Functions
bool	anonymous_namespace{EquiJoinCondition.cpp}::can_combine_with (const Analyzer::Expr *crt, const Analyzer::Expr *prev)
std::list< std::shared_ptr < Analyzer::Expr > >	anonymous_namespace{EquiJoinCondition.cpp}::make_composite_equals_impl (const std::vector< std::shared_ptr< Analyzer::Expr >> &crt_coalesced_quals)
std::list< std::shared_ptr < Analyzer::Expr > >	anonymous_namespace{EquiJoinCondition.cpp}::make_composite_equals (const std::vector< std::shared_ptr< Analyzer::Expr >> &crt_coalesced_quals)
std::list< std::shared_ptr < Analyzer::Expr > >	combine_equi_join_conditions (const std::list< std::shared_ptr< Analyzer::Expr >> &join_quals)
std::list< std::shared_ptr < Analyzer::Expr > >	coalesce_singleton_equi_join (const std::shared_ptr< Analyzer::BinOper > &join_qual)

Function Documentation

std::list<std::shared_ptr<Analyzer::Expr> > coalesce_singleton_equi_join

(

const std::shared_ptr< Analyzer::BinOper > &

join_qual

)

Definition at line 156 of file EquiJoinCondition.cpp.

References anonymous_namespace{EquiJoinCondition.cpp}::make_composite_equals_impl().

Referenced by HashJoin::getInstance().

                                                     {
  std::vector<std::shared_ptr<Analyzer::Expr>> singleton_qual_list;
  singleton_qual_list.push_back(join_qual);
  return make_composite_equals_impl(singleton_qual_list);
}

Here is the call graph for this function:

Here is the caller graph for this function:

std::list<std::shared_ptr<Analyzer::Expr> > combine_equi_join_conditions

(

const std::list< std::shared_ptr< Analyzer::Expr >> &

join_quals

)

Definition at line 129 of file EquiJoinCondition.cpp.

References anonymous_namespace{EquiJoinCondition.cpp}::can_combine_with(), g_maximum_conditions_to_coalesce, and anonymous_namespace{EquiJoinCondition.cpp}::make_composite_equals().

Referenced by RelAlgExecutor::makeJoinQuals().

                                                            {
  if (join_quals.empty()) {
    return {};
  }
  std::list<std::shared_ptr<Analyzer::Expr>> coalesced_quals;
  std::vector<std::shared_ptr<Analyzer::Expr>> crt_coalesced_quals;
  for (const auto& simple_join_qual : join_quals) {
    if (crt_coalesced_quals.empty()) {
      crt_coalesced_quals.push_back(simple_join_qual);
      continue;
    }
    if (crt_coalesced_quals.size() >= g_maximum_conditions_to_coalesce ||
        !can_combine_with(simple_join_qual.get(), crt_coalesced_quals.back().get())) {
      coalesced_quals.splice(coalesced_quals.end(),
                             make_composite_equals(crt_coalesced_quals));
      crt_coalesced_quals.clear();
    }
    crt_coalesced_quals.push_back(simple_join_qual);
  }
  if (!crt_coalesced_quals.empty()) {
    coalesced_quals.splice(coalesced_quals.end(),
                           make_composite_equals(crt_coalesced_quals));
  }
  return coalesced_quals;
}

Here is the call graph for this function:

Here is the caller graph for this function: