DataRecyclerUtil Class Reference

#include <DataRecycler.h>

Static Public Member Functions
static std::string	getDeviceIdentifierString (DeviceIdentifier device_identifier)
static QueryPlanHash	getUnitaryTableKey ()
static std::unordered_set< size_t >	getAlternativeTableKeys (const std::vector< ChunkKey > &chunk_keys, const shared::TableKey &inner_table_key)

Static Public Attributes
static constexpr DeviceIdentifier	CPU_DEVICE_IDENTIFIER = 0

Detailed Description

Definition at line 134 of file DataRecycler.h.

Member Function Documentation

static std::unordered_set<size_t> DataRecyclerUtil::getAlternativeTableKeys ( const std::vector< ChunkKey > &  chunk_keys, const shared::TableKey &  inner_table_key  )

inlinestatic

Definition at line 154 of file DataRecycler.h.

References getUnitaryTableKey(), shared::TableKey::hash(), hash_value(), and shared::TableKey::table_id.

Referenced by PerfectJoinHashTable::reify(), RangeJoinHashTable::reifyWithLayout(), BoundingBoxIntersectJoinHashTable::reifyWithLayout(), and BaselineJoinHashTable::reifyWithLayout().

                                             {
    std::unordered_set<size_t> alternative_table_keys;
    if (!chunk_keys.empty() && chunk_keys.front().size() > 2 &&
        chunk_keys.front()[1] > 0) {
      auto& chunk_key = chunk_keys.front();
      // the actual chunks fetched per device can be different but they constitute the
      // same table in the same db, so we can exploit this to create an alternative table
      // key
      std::vector<int> alternative_table_key{chunk_key[0], chunk_key[1]};
      alternative_table_keys.insert(boost::hash_value(alternative_table_key));
    } else if (inner_table_key.table_id > 0) {
      // use this path if chunk_keys is empty
      alternative_table_keys.insert(inner_table_key.hash());
    } else {
      // this can happen when we use synthetic table generated by table function such as
      // generate_series, i.e., SELECT ... FROM table(generate_series(...)) ...
      // then we try to manage them via predefined static chunk key
      // and remove them "all" when necessary
      alternative_table_keys.insert(DataRecyclerUtil::getUnitaryTableKey());
    }
    return alternative_table_keys;
  }

Here is the call graph for this function:

Here is the caller graph for this function:

static std::string DataRecyclerUtil::getDeviceIdentifierString ( DeviceIdentifier  device_identifier )

inlinestatic

Definition at line 138 of file DataRecycler.h.

References CPU_DEVICE_IDENTIFIER, and to_string().

Referenced by HashingSchemeRecycler::clearCache(), BoundingBoxIntersectTuningParamRecycler::clearCache(), ChunkMetadataRecycler::clearCache(), ResultSetRecycler::clearCache(), HashtableRecycler::clearCache(), BoundingBoxIntersectTuningParamRecycler::getItemFromCache(), HashingSchemeRecycler::putItemToCache(), BoundingBoxIntersectTuningParamRecycler::putItemToCache(), ChunkMetadataRecycler::putItemToCache(), ResultSetRecycler::putItemToCache(), HashtableRecycler::putItemToCache(), HashingSchemeRecycler::removeItemFromCache(), BoundingBoxIntersectTuningParamRecycler::removeItemFromCache(), ChunkMetadataRecycler::removeItemFromCache(), ResultSetRecycler::removeItemFromCache(), HashtableRecycler::removeItemFromCache(), HashingSchemeRecycler::toString(), ChunkMetadataRecycler::toString(), ResultSetRecycler::toString(), and HashtableRecycler::toString().

                                                                                 {
    std::string device_type = device_identifier == CPU_DEVICE_IDENTIFIER ? "CPU" : "GPU-";
    return device_identifier != CPU_DEVICE_IDENTIFIER
               ? device_type.append(std::to_string(device_identifier))
               : device_type;
  }

Here is the call graph for this function:

Here is the caller graph for this function:

static QueryPlanHash DataRecyclerUtil::getUnitaryTableKey ( )

inlinestatic

Definition at line 145 of file DataRecycler.h.

Referenced by getAlternativeTableKeys(), and HashtableRecycler::removeCachedHashtableBuiltFromSyntheticTable().

                                            {
    // C++20 will support constexpr vector
    // Before we have C++20, let's use a pre-computed constant which is retrieved from
    // std::vector<int> unitary_table_identifier = {-1, -1};
    // UNITARY_TABLE_ID_HASH_VALUE = boost::hash_value(unitary_table_identifier);
    constexpr QueryPlanHash UNITARY_TABLE_ID_HASH_VALUE = 1703092966009212028;
    return UNITARY_TABLE_ID_HASH_VALUE;
  }

Here is the caller graph for this function:

Member Data Documentation

constexpr DeviceIdentifier DataRecyclerUtil::CPU_DEVICE_IDENTIFIER = 0

static

Definition at line 136 of file DataRecycler.h.

Referenced by BoundingBoxIntersectJoinHashTable::approximateTupleCount(), CacheMetricTracker::CacheMetricTracker(), ResultSetRecycler::clearCache(), HashtableRecycler::clearCache(), DataRecycler< std::optional< HashType >, EMPTY_META_INFO >::DataRecycler(), ResultSetRecyclerHolder::getCachedQueryResultSet(), getDeviceIdentifierString(), QueryRunner::QueryRunner::getNumberOfCachedItem(), ResultSetRecycler::getOutputMetaInfo(), ResultSetRecycler::getTargetExprs(), ResultSetRecycler::hasItemInCache(), PerfectJoinHashTable::initHashTableForDevice(), BaselineJoinHashTable::initHashTableForDevice(), RangeJoinHashTable::initHashTableOnCpu(), BoundingBoxIntersectJoinHashTable::initHashTableOnCpu(), anonymous_namespace{DBHandler.cpp}::log_cache_size(), ResultSetRecyclerHolder::markCachedItemAsDirty(), BoundingBoxIntersectJoinHashTable::markCachedItemAsDirty(), BaselineJoinHashTable::markCachedItemAsDirty(), PerfectJoinHashTable::markCachedItemAsDirty(), ResultSetRecyclerHolder::putQueryResultSetToCache(), PerfectJoinHashTable::reify(), RangeJoinHashTable::reifyWithLayout(), BoundingBoxIntersectJoinHashTable::reifyWithLayout(), and BaselineJoinHashTable::reifyWithLayout().

---

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

• /home/jenkins-slave/workspace/core-os-doxygen/QueryEngine/DataRecycler/DataRecycler.h