OmniSciDB  fe05a0c208
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros 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 358 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 360 of file OverlapsJoinHashTable.cpp.

References CHECK.

368  : num_dims_(2) // Todo: allow varying number of dims
369  , bucket_thresholds_(/*count=*/num_dims_, /*value=*/bucket_threshold)
370  , step_(step)
371  , min_threshold_(min_threshold)
372  , effective_memory_level_(effective_memory_level)
373  , columns_per_device_(columns_per_device)
374  , inner_outer_pairs_(inner_outer_pairs)
375  , table_tuple_count_(table_tuple_count)
376  , executor_(executor) {
377  CHECK(!columns_per_device_.empty());
378  }
#define CHECK(condition)
Definition: Logger.h:203

Member Function Documentation

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

Definition at line 421 of file OverlapsJoinHashTable.cpp.

References t.

421  {
422  for (const auto& t : bucket_thresholds_) {
423  if (t < min_threshold_) {
424  return true;
425  }
426  }
427  return false;
428  }
char * t
std::vector<double> anonymous_namespace{OverlapsJoinHashTable.cpp}::BucketSizeTuner::computeBucketSizes ( ) const
inlineprivate

Definition at line 430 of file OverlapsJoinHashTable.cpp.

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

430  {
431  if (table_tuple_count_ == 0) {
432  return std::vector<double>(/*count=*/num_dims_, /*val=*/0);
433  }
436  columns_per_device_.front().join_columns[0],
437  columns_per_device_.front().join_column_types[0],
439  executor_);
440  }
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 407 of file OverlapsJoinHashTable.cpp.

References CHECK_EQ.

407  {
408  if (num_steps_ == 0) {
409  CHECK_EQ(current_bucket_sizes_.size(), static_cast<size_t>(0));
411  }
413  std::vector<double> inverse_bucket_sizes;
414  for (const auto s : current_bucket_sizes_) {
415  inverse_bucket_sizes.emplace_back(1.0 / s);
416  }
417  return inverse_bucket_sizes;
418  }
#define CHECK_EQ(x, y)
Definition: Logger.h:211
auto anonymous_namespace{OverlapsJoinHashTable.cpp}::BucketSizeTuner::getMinBucketSize ( ) const
inline

Definition at line 397 of file OverlapsJoinHashTable.cpp.

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

Definition at line 466 of file OverlapsJoinHashTable.cpp.

References CHECK_EQ, and t.

466  {
467  if (!current_bucket_sizes_.empty()) {
470  }
471  // If current_bucket_sizes was empty, we will start from our initial threshold
472  for (auto& t : bucket_thresholds_) {
473  t *= step_overide;
474  }
475  // When tuning up, do not dynamically compute bucket_sizes, as compute_bucket_sizes as
476  // written will pick the largest bin size below the threshold, meaning our bucket_size
477  // will never increase beyond the size of the largest polygon. This could mean that we
478  // can never make the bucket sizes large enough to get our hash table below the
479  // maximum size Possible todo: enable templated version of compute_bucket_sizes that
480  // allows for optionally finding smallest extent above threshold, to mirror default
481  // behavior finding largest extent below threshold, and use former variant here
483  num_steps_++;
484  return true;
485  }
#define CHECK_EQ(x, y)
Definition: Logger.h:211
char * t
bool anonymous_namespace{OverlapsJoinHashTable.cpp}::BucketSizeTuner::tuneOneStep ( )
inline

Definition at line 380 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 386 of file OverlapsJoinHashTable.cpp.

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

Definition at line 442 of file OverlapsJoinHashTable.cpp.

References CHECK_EQ, t, and VLOG.

442  {
443  if (!current_bucket_sizes_.empty()) {
446  for (auto& t : bucket_thresholds_) {
447  t /= step_overide;
448  }
449  }
451  VLOG(1) << "Aborting overlaps tuning as at least one bucket size is below min "
452  "threshold";
453  return false;
454  }
455  const auto next_bucket_sizes = computeBucketSizes();
456  if (next_bucket_sizes == current_bucket_sizes_) {
457  VLOG(1) << "Aborting overlaps tuning as bucket size is no longer changing.";
458  return false;
459  }
460 
461  current_bucket_sizes_ = next_bucket_sizes;
462  num_steps_++;
463  return true;
464  }
#define CHECK_EQ(x, y)
Definition: Logger.h:211
char * t
#define VLOG(n)
Definition: Logger.h:297

Friends And Related Function Documentation

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

Definition at line 503 of file OverlapsJoinHashTable.cpp.

503  {
504  os << "Step Num: " << tuner.num_steps_ << ", Threshold: " << std::fixed
505  << tuner.bucket_thresholds_[0] << ", Step Size: " << std::fixed << tuner.step_
506  << ", Min: " << std::fixed << tuner.min_threshold_;
507  return os;
508 }

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

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

Definition at line 498 of file OverlapsJoinHashTable.cpp.

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

Definition at line 492 of file OverlapsJoinHashTable.cpp.

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

Definition at line 496 of file OverlapsJoinHashTable.cpp.

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

Definition at line 494 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 487 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 495 of file OverlapsJoinHashTable.cpp.


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