OmniSciDB  c0231cc57d
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
anonymous_namespace{OverlapsJoinHashTable.cpp}::BucketSizeTuner Class Reference
+ Collaboration diagram for anonymous_namespace{OverlapsJoinHashTable.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 Executorexecutor_
 
std::vector< double > current_bucket_sizes_
 

Friends

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

Detailed Description

Definition at line 380 of file OverlapsJoinHashTable.cpp.

Constructor & Destructor Documentation

anonymous_namespace{OverlapsJoinHashTable.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 382 of file OverlapsJoinHashTable.cpp.

References CHECK.

390  : num_dims_(2) // Todo: allow varying number of dims
391  , bucket_thresholds_(/*count=*/num_dims_, /*value=*/bucket_threshold)
392  , step_(step)
393  , min_threshold_(min_threshold)
394  , effective_memory_level_(effective_memory_level)
395  , columns_per_device_(columns_per_device)
396  , inner_outer_pairs_(inner_outer_pairs)
397  , table_tuple_count_(table_tuple_count)
398  , executor_(executor) {
399  CHECK(!columns_per_device_.empty());
400  }
#define CHECK(condition)
Definition: Logger.h:222

Member Function Documentation

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

Definition at line 443 of file OverlapsJoinHashTable.cpp.

443  {
444  for (const auto& t : bucket_thresholds_) {
445  if (t < min_threshold_) {
446  return true;
447  }
448  }
449  return false;
450  }
std::vector<double> anonymous_namespace{OverlapsJoinHashTable.cpp}::BucketSizeTuner::computeBucketSizes ( ) const
inlineprivate

Definition at line 452 of file OverlapsJoinHashTable.cpp.

References anonymous_namespace{OverlapsJoinHashTable.cpp}::compute_bucket_sizes().

452  {
453  if (table_tuple_count_ == 0) {
454  return std::vector<double>(/*count=*/num_dims_, /*val=*/0);
455  }
458  columns_per_device_.front().join_columns[0],
459  columns_per_device_.front().join_column_types[0],
461  executor_);
462  }
std::vector< double > compute_bucket_sizes(const std::vector< double > &bucket_thresholds, const Data_Namespace::MemoryLevel effective_memory_level, const JoinColumn &join_column, const JoinColumnTypeInfo &join_column_type, const std::vector< InnerOuter > &inner_outer_pairs, const Executor *executor)

+ Here is the call graph for this function:

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

Method to retrieve inverted bucket sizes, which are what are used elsewhere in the OverlapsHashTable framework

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 429 of file OverlapsJoinHashTable.cpp.

References CHECK_EQ.

429  {
430  if (num_steps_ == 0) {
431  CHECK_EQ(current_bucket_sizes_.size(), static_cast<size_t>(0));
433  }
435  std::vector<double> inverse_bucket_sizes;
436  for (const auto s : current_bucket_sizes_) {
437  inverse_bucket_sizes.emplace_back(1.0 / s);
438  }
439  return inverse_bucket_sizes;
440  }
#define CHECK_EQ(x, y)
Definition: Logger.h:230
auto anonymous_namespace{OverlapsJoinHashTable.cpp}::BucketSizeTuner::getMinBucketSize ( ) const
inline

Definition at line 419 of file OverlapsJoinHashTable.cpp.

419  {
420  return *std::min_element(bucket_thresholds_.begin(), bucket_thresholds_.end());
421  }
bool anonymous_namespace{OverlapsJoinHashTable.cpp}::BucketSizeTuner::tuneLargerOneStep ( const double  step_overide)
inlineprivate

Definition at line 488 of file OverlapsJoinHashTable.cpp.

References CHECK_EQ.

488  {
489  if (!current_bucket_sizes_.empty()) {
492  }
493  // If current_bucket_sizes was empty, we will start from our initial threshold
494  for (auto& t : bucket_thresholds_) {
495  t *= step_overide;
496  }
497  // When tuning up, do not dynamically compute bucket_sizes, as compute_bucket_sizes as
498  // written will pick the largest bin size below the threshold, meaning our bucket_size
499  // will never increase beyond the size of the largest polygon. This could mean that we
500  // can never make the bucket sizes large enough to get our hash table below the
501  // maximum size Possible todo: enable templated version of compute_bucket_sizes that
502  // allows for optionally finding smallest extent above threshold, to mirror default
503  // behavior finding largest extent below threshold, and use former variant here
505  num_steps_++;
506  return true;
507  }
#define CHECK_EQ(x, y)
Definition: Logger.h:230
bool anonymous_namespace{OverlapsJoinHashTable.cpp}::BucketSizeTuner::tuneOneStep ( )
inline

Definition at line 402 of file OverlapsJoinHashTable.cpp.

References tuneOneStep().

Referenced by tuneOneStep().

+ Here is the call graph for this function:

+ Here is the caller graph for this function:

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

Definition at line 408 of file OverlapsJoinHashTable.cpp.

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

Definition at line 464 of file OverlapsJoinHashTable.cpp.

References CHECK_EQ, and VLOG.

464  {
465  if (!current_bucket_sizes_.empty()) {
468  for (auto& t : bucket_thresholds_) {
469  t /= step_overide;
470  }
471  }
473  VLOG(1) << "Aborting overlaps tuning as at least one bucket size is below min "
474  "threshold";
475  return false;
476  }
477  const auto next_bucket_sizes = computeBucketSizes();
478  if (next_bucket_sizes == current_bucket_sizes_) {
479  VLOG(1) << "Aborting overlaps tuning as bucket size is no longer changing.";
480  return false;
481  }
482 
483  current_bucket_sizes_ = next_bucket_sizes;
484  num_steps_++;
485  return true;
486  }
#define CHECK_EQ(x, y)
Definition: Logger.h:230
#define VLOG(n)
Definition: Logger.h:316

Friends And Related Function Documentation

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

Definition at line 525 of file OverlapsJoinHashTable.cpp.

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

Member Data Documentation

std::vector<double> anonymous_namespace{OverlapsJoinHashTable.cpp}::BucketSizeTuner::bucket_thresholds_
private
const std::vector<ColumnsForDevice>& anonymous_namespace{OverlapsJoinHashTable.cpp}::BucketSizeTuner::columns_per_device_
private

Definition at line 515 of file OverlapsJoinHashTable.cpp.

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

Definition at line 520 of file OverlapsJoinHashTable.cpp.

const Data_Namespace::MemoryLevel anonymous_namespace{OverlapsJoinHashTable.cpp}::BucketSizeTuner::effective_memory_level_
private

Definition at line 514 of file OverlapsJoinHashTable.cpp.

const Executor* anonymous_namespace{OverlapsJoinHashTable.cpp}::BucketSizeTuner::executor_
private

Definition at line 518 of file OverlapsJoinHashTable.cpp.

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

Definition at line 516 of file OverlapsJoinHashTable.cpp.

const double anonymous_namespace{OverlapsJoinHashTable.cpp}::BucketSizeTuner::min_threshold_
private
size_t anonymous_namespace{OverlapsJoinHashTable.cpp}::BucketSizeTuner::num_dims_
private

Definition at line 509 of file OverlapsJoinHashTable.cpp.

size_t anonymous_namespace{OverlapsJoinHashTable.cpp}::BucketSizeTuner::num_steps_ {0}
private
const double anonymous_namespace{OverlapsJoinHashTable.cpp}::BucketSizeTuner::step_
private
const size_t anonymous_namespace{OverlapsJoinHashTable.cpp}::BucketSizeTuner::table_tuple_count_
private

Definition at line 517 of file OverlapsJoinHashTable.cpp.


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