anonymous_namespace{BoundingBoxIntersectJoinHashTable.cpp}::TuningState Struct Reference

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

Public Types
enum	TuningDirection { TuningDirection::SMALLER, TuningDirection::LARGER }

Public Member Functions
	TuningState (const size_t bbox_intersect_max_table_size_bytes, const double bbox_intersect_target_entries_per_bin)
bool	operator() (const HashTableProps &new_props, const bool new_bbox_intersect_threshold)
bool	hashTableTooBig () const
bool	keysPerBinIncreasing () const
bool	previousIterationValid () const
bool	keysPerBinUnderThreshold () const

Public Attributes
HashTableProps	crt_props
HashTableProps	prev_props
double	chosen_bbox_intersect_threshold
TuningDirection	tuning_direction {TuningDirection::SMALLER}
size_t	crt_step
size_t	crt_reverse_search_iteration
size_t	bbox_intersect_max_table_size_bytes
double	bbox_intersect_target_entries_per_bin
const size_t	max_reverse_search_iterations {8}

Detailed Description

Definition at line 268 of file BoundingBoxIntersectJoinHashTable.cpp.

Member Enumeration Documentation

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

strong

Enumerator
SMALLER
LARGER

Definition at line 285 of file BoundingBoxIntersectJoinHashTable.cpp.

{ SMALLER, LARGER };

Constructor & Destructor Documentation

anonymous_namespace{BoundingBoxIntersectJoinHashTable.cpp}::TuningState::TuningState ( const size_t  bbox_intersect_max_table_size_bytes, const double  bbox_intersect_target_entries_per_bin  )

inline

Definition at line 269 of file BoundingBoxIntersectJoinHashTable.cpp.

      : crt_props(HashTableProps::invalid())
      , prev_props(HashTableProps::invalid())
      , chosen_bbox_intersect_threshold(-1)
      , crt_step(0)
      , crt_reverse_search_iteration(0)
      , bbox_intersect_max_table_size_bytes(bbox_intersect_max_table_size_bytes)
      , bbox_intersect_target_entries_per_bin(bbox_intersect_target_entries_per_bin) {}

Member Function Documentation

bool anonymous_namespace{BoundingBoxIntersectJoinHashTable.cpp}::TuningState::hashTableTooBig ( ) const

inline

Definition at line 379 of file BoundingBoxIntersectJoinHashTable.cpp.

                               {
    return crt_props.hash_table_size > bbox_intersect_max_table_size_bytes;
  }

bool anonymous_namespace{BoundingBoxIntersectJoinHashTable.cpp}::TuningState::keysPerBinIncreasing ( ) const

inline

Definition at line 383 of file BoundingBoxIntersectJoinHashTable.cpp.

                                    {
    return crt_props.keys_per_bin > prev_props.keys_per_bin;
  }

bool anonymous_namespace{BoundingBoxIntersectJoinHashTable.cpp}::TuningState::keysPerBinUnderThreshold ( ) const

inline

Definition at line 391 of file BoundingBoxIntersectJoinHashTable.cpp.

                                        {
    return crt_props.keys_per_bin < bbox_intersect_target_entries_per_bin;
  }

bool anonymous_namespace{BoundingBoxIntersectJoinHashTable.cpp}::TuningState::operator() ( const HashTableProps &  new_props, const bool  new_bbox_intersect_threshold  )

inline

Returns true to continue tuning, false to end the loop with the above threshold

Definition at line 298 of file BoundingBoxIntersectJoinHashTable.cpp.

References CHECK, UNREACHABLE, and VLOG.

                                                           {
    prev_props = crt_props;
    crt_props = new_props;
    crt_step++;

    if (hashTableTooBig() || keysPerBinIncreasing()) {
      if (hashTableTooBig()) {
        VLOG(1) << "Reached hash table size limit: "
                << bbox_intersect_max_table_size_bytes << " with "
                << crt_props.hash_table_size << " byte hash table, "
                << crt_props.keys_per_bin << " keys per bin.";
      } else if (keysPerBinIncreasing()) {
        VLOG(1) << "Keys per bin increasing from " << prev_props.keys_per_bin << " to "
                << crt_props.keys_per_bin;
        CHECK(previousIterationValid());
      }
      if (previousIterationValid()) {
        VLOG(1) << "Using previous threshold value " << chosen_bbox_intersect_threshold;
        crt_props = prev_props;
        return false;
      } else {
        CHECK(hashTableTooBig());
        crt_reverse_search_iteration++;
        chosen_bbox_intersect_threshold = new_bbox_intersect_threshold;

        if (crt_reverse_search_iteration == max_reverse_search_iterations) {
          VLOG(1) << "Hit maximum number (" << max_reverse_search_iterations
                  << ") of reverse tuning iterations. Aborting tuning";
          // use the crt props, but don't bother trying to tune any farther
          return false;
        }

        if (crt_reverse_search_iteration > 1 &&
            crt_props.hash_table_size == prev_props.hash_table_size) {
          // hash table size is not changing, bail
          VLOG(1) << "Hash table size not decreasing (" << crt_props.hash_table_size
                  << " bytes) and still above maximum allowed size ("
                  << bbox_intersect_max_table_size_bytes << " bytes). Aborting tuning";
          return false;
        }

        // if the hash table is too big on the very first step, change direction towards
        // larger bins to see if a slightly smaller hash table will fit
        if (crt_step == 1 && crt_reverse_search_iteration == 1) {
          VLOG(1)
              << "First iteration of tuning led to hash table size over "
                 "limit. Reversing search to try larger bin sizes (previous threshold: "
              << chosen_bbox_intersect_threshold << ")";
          // Need to change direction of tuning to tune "up" towards larger bins
          tuning_direction = TuningDirection::LARGER;
        }
        return true;
      }
      UNREACHABLE();
    }

    chosen_bbox_intersect_threshold = new_bbox_intersect_threshold;

    if (keysPerBinUnderThreshold()) {
      VLOG(1) << "Hash table reached size " << crt_props.hash_table_size
              << " with keys per bin " << crt_props.keys_per_bin << " under threshold "
              << bbox_intersect_target_entries_per_bin
              << ". Terminating bucket size loop.";
      return false;
    }

    if (crt_reverse_search_iteration > 0) {
      // We always take the first tuning iteration that succeeds when reversing
      // direction, as if we're here we haven't had a successful iteration and we're
      // "backtracking" our search by making bin sizes larger
      VLOG(1) << "On reverse (larger tuning direction) search found workable "
              << " hash table size of " << crt_props.hash_table_size
              << " with keys per bin " << crt_props.keys_per_bin
              << ". Terminating bucket size loop.";
      return false;
    }

    return true;
  }

bool anonymous_namespace{BoundingBoxIntersectJoinHashTable.cpp}::TuningState::previousIterationValid ( ) const

inline

Definition at line 387 of file BoundingBoxIntersectJoinHashTable.cpp.

                                      {
    return tuning_direction == TuningDirection::SMALLER && crt_step > 1;
  }

Member Data Documentation

size_t anonymous_namespace{BoundingBoxIntersectJoinHashTable.cpp}::TuningState::bbox_intersect_max_table_size_bytes

Definition at line 291 of file BoundingBoxIntersectJoinHashTable.cpp.

double anonymous_namespace{BoundingBoxIntersectJoinHashTable.cpp}::TuningState::bbox_intersect_target_entries_per_bin

Definition at line 292 of file BoundingBoxIntersectJoinHashTable.cpp.

double anonymous_namespace{BoundingBoxIntersectJoinHashTable.cpp}::TuningState::chosen_bbox_intersect_threshold

Definition at line 284 of file BoundingBoxIntersectJoinHashTable.cpp.

HashTableProps anonymous_namespace{BoundingBoxIntersectJoinHashTable.cpp}::TuningState::crt_props

Definition at line 280 of file BoundingBoxIntersectJoinHashTable.cpp.

size_t anonymous_namespace{BoundingBoxIntersectJoinHashTable.cpp}::TuningState::crt_reverse_search_iteration

Definition at line 290 of file BoundingBoxIntersectJoinHashTable.cpp.

size_t anonymous_namespace{BoundingBoxIntersectJoinHashTable.cpp}::TuningState::crt_step

Definition at line 289 of file BoundingBoxIntersectJoinHashTable.cpp.

const size_t anonymous_namespace{BoundingBoxIntersectJoinHashTable.cpp}::TuningState::max_reverse_search_iterations {8}

Definition at line 293 of file BoundingBoxIntersectJoinHashTable.cpp.

HashTableProps anonymous_namespace{BoundingBoxIntersectJoinHashTable.cpp}::TuningState::prev_props

Definition at line 281 of file BoundingBoxIntersectJoinHashTable.cpp.

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

Definition at line 286 of file BoundingBoxIntersectJoinHashTable.cpp.

---

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

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