Collaboration diagram for anonymous_namespace{BoundingBoxIntersectJoinHashTable.cpp}::BucketSizeTuner:

Public Member Functions
	BucketSizeTuner (const double bucket_threshold, const double step, const double min_threshold, const Data_Namespace::MemoryLevel effective_memory_level, const std::vector< ColumnsForDevice > &columns_per_device, const std::vector< InnerOuter > &inner_outer_pairs, const size_t table_tuple_count, const Executor *executor)

bool	tuneOneStep ()

bool	tuneOneStep (const TuningState::TuningDirection tuning_direction)

bool	tuneOneStep (const TuningState::TuningDirection tuning_direction, const double step_overide)

auto	getMinBucketSize () const

std::vector< double >	getInverseBucketSizes ()

Private Member Functions
bool	bucketThresholdsBelowMinThreshold () const

std::vector< double >	computeBucketSizes () const

bool	tuneSmallerOneStep (const double step_overide)

bool	tuneLargerOneStep (const double step_overide)

Private Attributes
size_t	num_dims_

std::vector< double >	bucket_thresholds_

size_t	num_steps_ {0}

const double	step_

const double	min_threshold_

const Data_Namespace::MemoryLevel	effective_memory_level_

const std::vector < ColumnsForDevice > &	columns_per_device_

const std::vector< InnerOuter > &	inner_outer_pairs_

const size_t	table_tuple_count_

const Executor *	executor_

std::vector< double >	current_bucket_sizes_

Friends
std::ostream &	operator<< (std::ostream &os, const BucketSizeTuner &tuner)

Detailed Description

Definition at line 397 of file BoundingBoxIntersectJoinHashTable.cpp.

Constructor & Destructor Documentation

anonymous_namespace{BoundingBoxIntersectJoinHashTable.cpp}::BucketSizeTuner::BucketSizeTuner	(	const double	bucket_threshold,
		const double	step,
		const double	min_threshold,
		const Data_Namespace::MemoryLevel	effective_memory_level,
		const std::vector< ColumnsForDevice > &	columns_per_device,
		const std::vector< InnerOuter > &	inner_outer_pairs,
		const size_t	table_tuple_count,
		const Executor *	executor
	)

inline

Definition at line 399 of file BoundingBoxIntersectJoinHashTable.cpp.

References CHECK.

       : num_dims_(2)  // Todo: allow varying number of dims
       , bucket_thresholds_(/*count=*/num_dims_, /*value=*/bucket_threshold)
       , step_(step)
       , min_threshold_(min_threshold)
       , effective_memory_level_(effective_memory_level)
       , columns_per_device_(columns_per_device)
       , inner_outer_pairs_(inner_outer_pairs)
       , table_tuple_count_(table_tuple_count)
       , executor_(executor) {
     CHECK(!columns_per_device_.empty());
   }

Member Function Documentation

bool anonymous_namespace{BoundingBoxIntersectJoinHashTable.cpp}::BucketSizeTuner::bucketThresholdsBelowMinThreshold ( ) const

inlineprivate

Definition at line 460 of file BoundingBoxIntersectJoinHashTable.cpp.

                                                  {
     for (const auto& t : bucket_thresholds_) {
       if (t < min_threshold_) {
         return true;
       }
     }
     return false;
   }

std::vector<double> anonymous_namespace{BoundingBoxIntersectJoinHashTable.cpp}::BucketSizeTuner::computeBucketSizes ( ) const

inlineprivate

Definition at line 469 of file BoundingBoxIntersectJoinHashTable.cpp.

References anonymous_namespace{BoundingBoxIntersectJoinHashTable.cpp}::compute_bucket_sizes(), and executor_().

                                                {
     if (table_tuple_count_ == 0) {
       return std::vector<double>(/*count=*/num_dims_, /*val=*/0);
     }
     return compute_bucket_sizes(bucket_thresholds_,
                                 effective_memory_level_,
                                 columns_per_device_.front().join_columns[0],
                                 columns_per_device_.front().join_column_types[0],
                                 inner_outer_pairs_,
                                 executor_);
   }

Here is the call graph for this function:

std::vector<double> anonymous_namespace{BoundingBoxIntersectJoinHashTable.cpp}::BucketSizeTuner::getInverseBucketSizes ( )

inline

Method to retrieve inverted bucket sizes, which are what are used elsewhere in the hash join framework for bounding box intersection

Returns: the inverted bucket sizes, i.e. a set of that will place a raw value in a bucket when multiplied by the raw value

Definition at line 446 of file BoundingBoxIntersectJoinHashTable.cpp.

References CHECK_EQ.

                                             {
     if (num_steps_ == 0) {
       CHECK_EQ(current_bucket_sizes_.size(), static_cast<size_t>(0));
       current_bucket_sizes_ = computeBucketSizes();
     }
     CHECK_EQ(current_bucket_sizes_.size(), num_dims_);
     std::vector<double> inverse_bucket_sizes;
     for (const auto s : current_bucket_sizes_) {
       inverse_bucket_sizes.emplace_back(1.0 / s);
     }
     return inverse_bucket_sizes;
   }

auto anonymous_namespace{BoundingBoxIntersectJoinHashTable.cpp}::BucketSizeTuner::getMinBucketSize ( ) const

inline

Definition at line 436 of file BoundingBoxIntersectJoinHashTable.cpp.

                                 {
     return *std::min_element(bucket_thresholds_.begin(), bucket_thresholds_.end());
   }

bool anonymous_namespace{BoundingBoxIntersectJoinHashTable.cpp}::BucketSizeTuner::tuneLargerOneStep ( const double step_overide )

inlineprivate

Definition at line 506 of file BoundingBoxIntersectJoinHashTable.cpp.

References CHECK_EQ.

                                                     {
     if (!current_bucket_sizes_.empty()) {
       CHECK_EQ(current_bucket_sizes_.size(), bucket_thresholds_.size());
       bucket_thresholds_ = current_bucket_sizes_;
     }
     // If current_bucket_sizes was empty, we will start from our initial threshold
     for (auto& t : bucket_thresholds_) {
       t *= step_overide;
     }
     // When tuning up, do not dynamically compute bucket_sizes, as compute_bucket_sizes as
     // written will pick the largest bin size below the threshold, meaning our bucket_size
     // will never increase beyond the size of the largest polygon. This could mean that we
     // can never make the bucket sizes large enough to get our hash table below the
     // maximum size Possible todo: enable templated version of compute_bucket_sizes that
     // allows for optionally finding smallest extent above threshold, to mirror default
     // behavior finding largest extent below threshold, and use former variant here
     current_bucket_sizes_ = bucket_thresholds_;
     num_steps_++;
     return true;
   }

bool anonymous_namespace{BoundingBoxIntersectJoinHashTable.cpp}::BucketSizeTuner::tuneOneStep ( )

inline

Definition at line 419 of file BoundingBoxIntersectJoinHashTable.cpp.

References tuneOneStep().

Referenced by tuneOneStep().

419 { return tuneOneStep(TuningState::TuningDirection::SMALLER, step_); }

anonymous_namespace{BoundingBoxIntersectJoinHashTable.cpp}::BucketSizeTuner::step_

const double step_

Definition: BoundingBoxIntersectJoinHashTable.cpp:530

anonymous_namespace{BoundingBoxIntersectJoinHashTable.cpp}::BucketSizeTuner::tuneOneStep

bool tuneOneStep()

Definition: BoundingBoxIntersectJoinHashTable.cpp:419

anonymous_namespace{BoundingBoxIntersectJoinHashTable.cpp}::TuningState::TuningDirection::SMALLER

Here is the call graph for this function:

Here is the caller graph for this function:

bool anonymous_namespace{BoundingBoxIntersectJoinHashTable.cpp}::BucketSizeTuner::tuneOneStep ( const TuningState::TuningDirection tuning_direction )

inline

Definition at line 421 of file BoundingBoxIntersectJoinHashTable.cpp.

                                                                       {
     return tuneOneStep(tuning_direction, step_);
   }

bool anonymous_namespace{BoundingBoxIntersectJoinHashTable.cpp}::BucketSizeTuner::tuneOneStep	(	const TuningState::TuningDirection	tuning_direction,
		const double	step_overide
	)

inline

Definition at line 425 of file BoundingBoxIntersectJoinHashTable.cpp.

                                               {
     if (table_tuple_count_ == 0) {
       return false;
     }
     if (tuning_direction == TuningState::TuningDirection::SMALLER) {
       return tuneSmallerOneStep(step_overide);
     }
     return tuneLargerOneStep(step_overide);
   }

bool anonymous_namespace{BoundingBoxIntersectJoinHashTable.cpp}::BucketSizeTuner::tuneSmallerOneStep ( const double step_overide )

inlineprivate

Definition at line 481 of file BoundingBoxIntersectJoinHashTable.cpp.

References CHECK_EQ, and VLOG.

                                                      {
     if (!current_bucket_sizes_.empty()) {
       CHECK_EQ(current_bucket_sizes_.size(), bucket_thresholds_.size());
       bucket_thresholds_ = current_bucket_sizes_;
       for (auto& t : bucket_thresholds_) {
         t /= step_overide;
       }
     }
     if (bucketThresholdsBelowMinThreshold()) {
       VLOG(1) << "Aborting tuning for bounding box intersection as at least one bucket "
                  "size is below min threshold";
       return false;
     }
     const auto next_bucket_sizes = computeBucketSizes();
     if (next_bucket_sizes == current_bucket_sizes_) {
       VLOG(1) << "Aborting tuning for bounding box intersection as bucket size is no "
                  "longer changing.";
       return false;
     }
 
     current_bucket_sizes_ = next_bucket_sizes;
     num_steps_++;
     return true;
   }

Friends And Related Function Documentation

std::ostream& operator<<	(	std::ostream &	os,
		const BucketSizeTuner &	tuner
	)

friend

Definition at line 543 of file BoundingBoxIntersectJoinHashTable.cpp.

                                                                      {
   os << "Step Num: " << tuner.num_steps_ << ", Threshold: " << std::fixed << "("
      << tuner.bucket_thresholds_[0] << ", " << tuner.bucket_thresholds_[1] << ")"
      << ", Step Size: " << std::fixed << tuner.step_ << ", Min: " << std::fixed
      << tuner.min_threshold_;
   return os;
 }

Member Data Documentation

std::vector<double> anonymous_namespace{BoundingBoxIntersectJoinHashTable.cpp}::BucketSizeTuner::bucket_thresholds_

private

Definition at line 528 of file BoundingBoxIntersectJoinHashTable.cpp.

Referenced by anonymous_namespace{BoundingBoxIntersectJoinHashTable.cpp}::operator<<().

const std::vector<ColumnsForDevice>& anonymous_namespace{BoundingBoxIntersectJoinHashTable.cpp}::BucketSizeTuner::columns_per_device_

private

Definition at line 533 of file BoundingBoxIntersectJoinHashTable.cpp.

std::vector<double> anonymous_namespace{BoundingBoxIntersectJoinHashTable.cpp}::BucketSizeTuner::current_bucket_sizes_

private

Definition at line 538 of file BoundingBoxIntersectJoinHashTable.cpp.

const Data_Namespace::MemoryLevel anonymous_namespace{BoundingBoxIntersectJoinHashTable.cpp}::BucketSizeTuner::effective_memory_level_

private

Definition at line 532 of file BoundingBoxIntersectJoinHashTable.cpp.

const Executor* anonymous_namespace{BoundingBoxIntersectJoinHashTable.cpp}::BucketSizeTuner::executor_

private

Definition at line 536 of file BoundingBoxIntersectJoinHashTable.cpp.

const std::vector<InnerOuter>& anonymous_namespace{BoundingBoxIntersectJoinHashTable.cpp}::BucketSizeTuner::inner_outer_pairs_

private

Definition at line 534 of file BoundingBoxIntersectJoinHashTable.cpp.

const double anonymous_namespace{BoundingBoxIntersectJoinHashTable.cpp}::BucketSizeTuner::min_threshold_

private

Definition at line 531 of file BoundingBoxIntersectJoinHashTable.cpp.

Referenced by anonymous_namespace{BoundingBoxIntersectJoinHashTable.cpp}::operator<<().

size_t anonymous_namespace{BoundingBoxIntersectJoinHashTable.cpp}::BucketSizeTuner::num_dims_

private

Definition at line 527 of file BoundingBoxIntersectJoinHashTable.cpp.

size_t anonymous_namespace{BoundingBoxIntersectJoinHashTable.cpp}::BucketSizeTuner::num_steps_ {0}

private

Definition at line 529 of file BoundingBoxIntersectJoinHashTable.cpp.

Referenced by anonymous_namespace{BoundingBoxIntersectJoinHashTable.cpp}::operator<<().

const double anonymous_namespace{BoundingBoxIntersectJoinHashTable.cpp}::BucketSizeTuner::step_

private

Definition at line 530 of file BoundingBoxIntersectJoinHashTable.cpp.

Referenced by anonymous_namespace{BoundingBoxIntersectJoinHashTable.cpp}::operator<<().

const size_t anonymous_namespace{BoundingBoxIntersectJoinHashTable.cpp}::BucketSizeTuner::table_tuple_count_

private

Definition at line 535 of file BoundingBoxIntersectJoinHashTable.cpp.

The documentation for this class was generated from the following file:

/home/jenkins-slave/workspace/core-os-doxygen/QueryEngine/JoinHashTable/BoundingBoxIntersectJoinHashTable.cpp

Public Member Functions

Private Member Functions

Private Attributes

Friends

Detailed Description

Constructor & Destructor Documentation

Member Function Documentation

Friends And Related Function Documentation

Member Data Documentation