#include <RangeJoinHashTable.h>

Inheritance diagram for RangeJoinHashTable:

Collaboration diagram for RangeJoinHashTable:

Public Member Functions
	RangeJoinHashTable (const std::shared_ptr< Analyzer::BinOper > condition, const JoinType join_type, const Analyzer::RangeOper range_expr, std::shared_ptr< Analyzer::ColumnVar > inner_col_expr, const std::vector< InputTableInfo > &query_infos, const Data_Namespace::MemoryLevel memory_level, ColumnCacheMap &column_cache, Executor executor, const std::vector< InnerOuter > &inner_outer_pairs, const int device_count, const RegisteredQueryHint &query_hints, const HashTableBuildDagMap &hashtable_build_dag_map, const TableIdToNodeMap &table_id_to_node_map)

	~RangeJoinHashTable () override=default

llvm::Value *	codegenKey (const CompilationOptions &co, llvm::Value *offset)

HashJoinMatchingSet	codegenMatchingSetWithOffset (const CompilationOptions &, const size_t, llvm::Value *)

Public Member Functions inherited from BoundingBoxIntersectJoinHashTable
	BoundingBoxIntersectJoinHashTable (const std::shared_ptr< Analyzer::BinOper > condition, const JoinType join_type, const std::vector< InputTableInfo > &query_infos, const Data_Namespace::MemoryLevel memory_level, ColumnCacheMap &column_cache, Executor *executor, const std::vector< InnerOuter > &inner_outer_pairs, const int device_count, const RegisteredQueryHint &query_hints, const HashTableBuildDagMap &hashtable_build_dag_map, const TableIdToNodeMap &table_id_to_node_map)

virtual	~BoundingBoxIntersectJoinHashTable ()

Public Member Functions inherited from HashJoin
virtual std::string	toStringFlat64 (const ExecutorDeviceType device_type, const int device_id) const

virtual std::string	toStringFlat32 (const ExecutorDeviceType device_type, const int device_id) const

JoinColumn	fetchJoinColumn (const Analyzer::ColumnVar hash_col, const std::vector< Fragmenter_Namespace::FragmentInfo > &fragment_info, const Data_Namespace::MemoryLevel effective_memory_level, const int device_id, std::vector< std::shared_ptr< Chunk_NS::Chunk >> &chunks_owner, DeviceAllocator dev_buff_owner, std::vector< std::shared_ptr< void >> &malloc_owner, Executor executor, ColumnCacheMap column_cache)

HashTable *	getHashTableForDevice (const size_t device_id) const

size_t	getJoinHashBufferSize (const ExecutorDeviceType device_type)

size_t	getJoinHashBufferSize (const ExecutorDeviceType device_type, const int device_id) const

int8_t *	getJoinHashBuffer (const ExecutorDeviceType device_type, const int device_id) const

void	freeHashBufferMemory ()

Static Public Member Functions
static std::shared_ptr < RangeJoinHashTable >	getInstance (const std::shared_ptr< Analyzer::BinOper > condition, const Analyzer::RangeOper range_expr, const std::vector< InputTableInfo > &query_infos, const Data_Namespace::MemoryLevel memory_level, const JoinType join_type, const int device_count, ColumnCacheMap &column_cache, Executor executor, const HashTableBuildDagMap &hashtable_build_dag_map, const RegisteredQueryHint &query_hints, const TableIdToNodeMap &table_id_to_node_map)

Static Public Member Functions inherited from BoundingBoxIntersectJoinHashTable
static std::shared_ptr < BoundingBoxIntersectJoinHashTable >	getInstance (const std::shared_ptr< Analyzer::BinOper > condition, const std::vector< InputTableInfo > &query_infos, const Data_Namespace::MemoryLevel memory_level, const JoinType join_type, const int device_count, ColumnCacheMap &column_cache, Executor *executor, const HashTableBuildDagMap &hashtable_build_dag_map, const RegisteredQueryHint &query_hint, const TableIdToNodeMap &table_id_to_node_map)
	Make hash table from an in-flight SQL query's parse tree etc. More...

static void	invalidateCache ()

static void	markCachedItemAsDirty (size_t table_key)

static HashtableRecycler *	getHashTableCache ()

static BoundingBoxIntersectTuningParamRecycler *	getBoundingBoxIntersectTuningParamCache ()

Static Public Member Functions inherited from HashJoin
static size_t	getMaximumNumHashEntriesCanHold (MemoryLevel memory_level, const Executor *executor, size_t rowid_size) noexcept

static std::string	generateTooManyHashEntriesErrMsg (size_t num_entries, size_t threshold, MemoryLevel memory_level)

static bool	layoutRequiresAdditionalBuffers (HashType layout) noexcept

static std::string	getHashTypeString (HashType ht) noexcept

static HashJoinMatchingSet	codegenMatchingSet (const std::vector< llvm::Value * > &hash_join_idx_args_in, const bool is_sharded, const bool col_is_nullable, const bool is_bw_eq, const int64_t sub_buff_size, Executor *executor, const bool is_bucketized=false)

static llvm::Value *	codegenHashTableLoad (const size_t table_idx, Executor *executor)

static std::shared_ptr< HashJoin >	getInstance (const std::shared_ptr< Analyzer::BinOper > qual_bin_oper, const std::vector< InputTableInfo > &query_infos, const Data_Namespace::MemoryLevel memory_level, const JoinType join_type, const HashType preferred_hash_type, const int device_count, ColumnCacheMap &column_cache, Executor *executor, const HashTableBuildDagMap &hashtable_build_dag_map, const RegisteredQueryHint &query_hint, const TableIdToNodeMap &table_id_to_node_map)
	Make hash table from an in-flight SQL query's parse tree etc. More...

static std::shared_ptr< HashJoin >	getSyntheticInstance (std::string_view table1, std::string_view column1, const Catalog_Namespace::Catalog &catalog1, std::string_view table2, std::string_view column2, const Catalog_Namespace::Catalog &catalog2, const Data_Namespace::MemoryLevel memory_level, const HashType preferred_hash_type, const int device_count, ColumnCacheMap &column_cache, Executor *executor)
	Make hash table from named tables and columns (such as for testing). More...

static std::shared_ptr< HashJoin >	getSyntheticInstance (const std::shared_ptr< Analyzer::BinOper > qual_bin_oper, const Data_Namespace::MemoryLevel memory_level, const HashType preferred_hash_type, const int device_count, ColumnCacheMap &column_cache, Executor *executor)
	Make hash table from named tables and columns (such as for testing). More...

static std::pair< std::string, std::shared_ptr< HashJoin > >	getSyntheticInstance (std::vector< std::shared_ptr< Analyzer::BinOper >>, const Data_Namespace::MemoryLevel memory_level, const HashType preferred_hash_type, const int device_count, ColumnCacheMap &column_cache, Executor *executor)

static shared::TableKey	getInnerTableId (const std::vector< InnerOuter > &inner_outer_pairs)

static bool	canAccessHashTable (bool allow_hash_table_recycling, bool invalid_cache_key, JoinType join_type)

static void	checkHashJoinReplicationConstraint (const shared::TableKey &table_key, const size_t shard_count, const Executor *executor)

static std::pair< InnerOuter, InnerOuterStringOpInfos >	normalizeColumnPair (const Analyzer::Expr lhs, const Analyzer::Expr rhs, const TemporaryTables *temporary_tables, const bool is_bbox_intersect=false)

template<typename T >
static const T *	getHashJoinColumn (const Analyzer::Expr *expr)

static std::pair< std::vector < InnerOuter >, std::vector < InnerOuterStringOpInfos > >	normalizeColumnPairs (const Analyzer::BinOper condition, const TemporaryTables temporary_tables)

static std::vector< int >	collectFragmentIds (const std::vector< Fragmenter_Namespace::FragmentInfo > &fragments)

static CompositeKeyInfo	getCompositeKeyInfo (const std::vector< InnerOuter > &inner_outer_pairs, const Executor *executor, const std::vector< InnerOuterStringOpInfos > &inner_outer_string_op_infos_pairs={})

static std::vector< const StringDictionaryProxy::IdMap * >	translateCompositeStrDictProxies (const CompositeKeyInfo &composite_key_info, const std::vector< InnerOuterStringOpInfos > &string_op_infos_for_keys, const Executor *executor)

static std::pair< const StringDictionaryProxy , StringDictionaryProxy >	getStrDictProxies (const InnerOuter &cols, const Executor *executor, const bool has_string_ops)

static const StringDictionaryProxy::IdMap *	translateInnerToOuterStrDictProxies (const InnerOuter &cols, const InnerOuterStringOpInfos &inner_outer_string_op_infos, ExpressionRange &old_col_range, const Executor *executor)

Protected Member Functions
void	reifyWithLayout (const HashType layout) override

void	reifyForDevice (const ColumnsForDevice &columns_for_device, const HashType layout, const size_t entry_count, const size_t emitted_keys_count, const int device_id, const logger::ThreadLocalIds parent_thread_local_ids)

std::shared_ptr < BaselineHashTable >	initHashTableOnCpu (const std::vector< JoinColumn > &join_columns, const std::vector< JoinColumnTypeInfo > &join_column_types, const std::vector< JoinBucketInfo > &join_bucket_info, const BaselineHashTableEntryInfo hash_table_entry_info)

HashType	getHashType () const noexceptoverride

std::pair< size_t, size_t >	approximateTupleCount (const std::vector< double > &inverse_bucket_sizes_for_dimension, std::vector< ColumnsForDevice > &columns_per_device, const size_t chosen_max_hashtable_size, const double chosen_bucket_threshold) override

std::pair< size_t, size_t >	computeRangeHashTableCounts (const size_t shard_count, std::vector< ColumnsForDevice > &columns_per_device)

Protected Member Functions inherited from BoundingBoxIntersectJoinHashTable
void	reify (const HashType preferred_layout)

virtual void	reifyImpl (std::vector< ColumnsForDevice > &columns_per_device, const Fragmenter_Namespace::TableInfo &query_info, const HashType layout, const size_t shard_count, const size_t entry_count, const size_t emitted_keys_count, const bool skip_hashtable_caching, const size_t chosen_max_hashtable_size, const double chosen_bucket_threshold)

void	reifyForDevice (const ColumnsForDevice &columns_for_device, const HashType layout, const size_t entry_count, const size_t emitted_keys_count, const bool skip_hashtable_caching, const int device_id, const logger::ThreadLocalIds parent_thread_local_ids)

size_t	calculateHashTableSize (size_t number_of_dimensions, size_t emitted_keys_count, size_t entry_count) const

ColumnsForDevice	fetchColumnsForDevice (const std::vector< Fragmenter_Namespace::FragmentInfo > &fragments, const int device_id, DeviceAllocator *dev_buff_owner)

virtual std::pair< size_t, size_t >	computeHashTableCounts (const size_t shard_count, const std::vector< double > &inverse_bucket_sizes_for_dimension, std::vector< ColumnsForDevice > &columns_per_device, const size_t chosen_max_hashtable_size, const double chosen_bucket_threshold)

void	setInverseBucketSizeInfo (const std::vector< double > &inverse_bucket_sizes, std::vector< ColumnsForDevice > &columns_per_device, const size_t device_count)

size_t	getKeyComponentWidth () const

size_t	getKeyComponentCount () const

Data_Namespace::MemoryLevel	getMemoryLevel () const noexceptoverride

int	getDeviceCount () const noexceptoverride

std::shared_ptr < BaselineHashTable >	initHashTableOnCpu (const std::vector< JoinColumn > &join_columns, const std::vector< JoinColumnTypeInfo > &join_column_types, const std::vector< JoinBucketInfo > &join_bucket_info, const BaselineHashTableEntryInfo hash_table_entry_info, const bool skip_hashtable_caching)

HashJoinMatchingSet	codegenMatchingSet (const CompilationOptions &, const size_t) override

std::string	toString (const ExecutorDeviceType device_type, const int device_id=0, bool raw=false) const override

DecodedJoinHashBufferSet	toSet (const ExecutorDeviceType device_type, const int device_id) const override

llvm::Value *	codegenSlot (const CompilationOptions &, const size_t) override

const RegisteredQueryHint &	getRegisteredQueryHint ()

size_t	getEntryCount () const

size_t	getEmittedKeysCount () const

size_t	getComponentBufferSize () const noexceptoverride

size_t	shardCount () const

Data_Namespace::MemoryLevel	getEffectiveMemoryLevel (const std::vector< InnerOuter > &inner_outer_pairs) const

shared::TableKey	getInnerTableId () const noexceptoverride

int	getInnerTableRteIdx () const noexceptoverride

size_t	getKeyBufferSize () const noexcept

size_t	offsetBufferOff () const noexceptoverride

size_t	countBufferOff () const noexceptoverride

size_t	payloadBufferOff () const noexceptoverride

std::string	getHashJoinType () const final

bool	isBitwiseEq () const override

std::shared_ptr< HashTable >	initHashTableOnCpuFromCache (QueryPlanHash key, CacheItemType item_type, DeviceIdentifier device_identifier)

std::optional< std::pair < size_t, size_t > >	getApproximateTupleCountFromCache (QueryPlanHash key, CacheItemType item_type, DeviceIdentifier device_identifier)

void	putHashTableOnCpuToCache (QueryPlanHash key, CacheItemType item_type, std::shared_ptr< HashTable > hashtable_ptr, DeviceIdentifier device_identifier, size_t hashtable_building_time)

llvm::Value *	codegenKey (const CompilationOptions &)

std::vector< llvm::Value * >	codegenManyKey (const CompilationOptions &)

std::optional < BoundingBoxIntersectMetaInfo >	getBoundingBoxIntersectMetaInfo ()

QueryPlanHash	getAlternativeCacheKey (AlternativeCacheKeyForBoundingBoxIntersection &info)

void	generateCacheKey (const size_t max_hashtable_size, const double bucket_threshold, const std::vector< double > &bucket_sizes, std::vector< std::vector< Fragmenter_Namespace::FragmentInfo >> &fragments_per_device, int device_count)

QueryPlanHash	getCacheKey (int device_id) const

const std::vector< InnerOuter > &	getInnerOuterPairs () const

void	setBoundingBoxIntersectionMetaInfo (size_t max_table_size_bytes, double bucket_threshold, std::vector< double > &bucket_sizes)

Private Member Functions
bool	isInnerColCompressed () const

bool	isProbeCompressed () const

Private Attributes
const Analyzer::RangeOper *	range_expr_

std::shared_ptr < Analyzer::ColumnVar >	inner_col_expr_

Data_Namespace::MemoryLevel	effective_memory_level_

const double	bucket_threshold_ {std::numeric_limits<double>::max()}

const size_t	max_hashtable_size_ {std::numeric_limits<size_t>::max()}

Additional Inherited Members
Static Public Attributes inherited from HashJoin
static constexpr size_t	MAX_NUM_HASH_ENTRIES = size_t(1) << 31

Static Protected Member Functions inherited from HashJoin
static llvm::Value *	codegenColOrStringOper (const Analyzer::Expr *col_or_string_oper, const std::vector< StringOps_Namespace::StringOpInfo > &string_op_infos, CodeGenerator &code_generator, const CompilationOptions &co)

Protected Attributes inherited from BoundingBoxIntersectJoinHashTable
const std::shared_ptr < Analyzer::BinOper >	condition_

const JoinType	join_type_

const std::vector < InputTableInfo > &	query_infos_

const Data_Namespace::MemoryLevel	memory_level_

Executor *	executor_

ColumnCacheMap &	column_cache_

std::vector< InnerOuter >	inner_outer_pairs_

const int	device_count_

RegisteredQueryHint	query_hints_

std::vector< double >	inverse_bucket_sizes_for_dimension_

double	chosen_bbox_intersect_bucket_threshold_

size_t	chosen_bbox_intersect_max_table_size_bytes_

CompositeKeyInfo	composite_key_info_

std::optional< HashType >	layout_override_

std::mutex	cpu_hash_table_buff_mutex_

HashTableBuildDagMap	hashtable_build_dag_map_

QueryPlanDAG	query_plan_dag_

std::vector< QueryPlanHash >	hashtable_cache_key_

HashtableCacheMetaInfo	hashtable_cache_meta_info_

std::unordered_set< size_t >	table_keys_

const TableIdToNodeMap	table_id_to_node_map_

Protected Attributes inherited from HashJoin
std::vector< std::shared_ptr < HashTable > >	hash_tables_for_device_

Static Protected Attributes inherited from BoundingBoxIntersectJoinHashTable
static std::unique_ptr < HashtableRecycler >	hash_table_cache_

static std::unique_ptr < BoundingBoxIntersectTuningParamRecycler >	auto_tuner_cache_

Detailed Description

Definition at line 21 of file RangeJoinHashTable.h.

Constructor & Destructor Documentation

RangeJoinHashTable::RangeJoinHashTable	(	const std::shared_ptr< Analyzer::BinOper >	condition,
		const JoinType	join_type,
		const Analyzer::RangeOper *	range_expr,
		std::shared_ptr< Analyzer::ColumnVar >	inner_col_expr,
		const std::vector< InputTableInfo > &	query_infos,
		const Data_Namespace::MemoryLevel	memory_level,
		ColumnCacheMap &	column_cache,
		Executor *	executor,
		const std::vector< InnerOuter > &	inner_outer_pairs,
		const int	device_count,
		const RegisteredQueryHint &	query_hints,
		const HashTableBuildDagMap &	hashtable_build_dag_map,
		const TableIdToNodeMap &	table_id_to_node_map
	)

inline

Definition at line 23 of file RangeJoinHashTable.h.

       : BoundingBoxIntersectJoinHashTable(condition,
                                           join_type,
                                           query_infos,
                                           memory_level,
                                           column_cache,
                                           executor,
                                           inner_outer_pairs,
                                           device_count,
                                           query_hints,
                                           hashtable_build_dag_map,
                                           table_id_to_node_map)
       , range_expr_(range_expr)
       , inner_col_expr_(std::move(inner_col_expr)) {}

RangeJoinHashTable::~RangeJoinHashTable ( )

overridedefault

Member Function Documentation

std::pair< size_t, size_t > RangeJoinHashTable::approximateTupleCount	(	const std::vector< double > &	inverse_bucket_sizes_for_dimension,
		std::vector< ColumnsForDevice > &	columns_per_device,
		const size_t	chosen_max_hashtable_size,
		const double	chosen_bucket_threshold
	)

overrideprotectedvirtual

Reimplemented from BoundingBoxIntersectJoinHashTable.

Definition at line 518 of file RangeJoinHashTable.cpp.

References approximate_distinct_tuples_on_device_range(), approximate_distinct_tuples_range(), threading_serial::async(), Bitmap, CHECK, CHECK_EQ, CHECK_GT, CPU, Data_Namespace::CPU_LEVEL, cpu_threads(), BoundingBoxIntersectJoinHashTable::device_count_, effective_memory_level_, BoundingBoxIntersectJoinHashTable::executor_, HashJoin::getCompositeKeyInfo(), getQueryEngineCudaStreamForDevice(), GPU, Data_Namespace::GPU_LEVEL, hll_size(), hll_unify(), CountDistinctDescriptor::impl_type_, BoundingBoxIntersectJoinHashTable::inner_outer_pairs_, isInnerColCompressed(), transfer_flat_object_to_gpu(), transfer_vector_of_flat_objects_to_gpu(), and UNREACHABLE.

Referenced by computeRangeHashTableCounts().

                                           {
 #ifdef _WIN32
   // WIN32 needs have C++20 set for designated initialisation to work
   CountDistinctDescriptor count_distinct_desc{
       CountDistinctImplType::Bitmap,
       0,
       0,
       11,
       true,
       effective_memory_level_ == Data_Namespace::MemoryLevel::GPU_LEVEL
           ? ExecutorDeviceType::GPU
           : ExecutorDeviceType::CPU,
       1,
   };
 #else
   CountDistinctDescriptor count_distinct_desc{
       .impl_type_ = CountDistinctImplType::Bitmap,
       .min_val = 0,
       .bucket_size = 0,
       .bitmap_sz_bits = 11,
       .approximate = true,
       .device_type = effective_memory_level_ == Data_Namespace::MemoryLevel::GPU_LEVEL
                          ? ExecutorDeviceType::GPU
                          : ExecutorDeviceType::CPU,
       .sub_bitmap_count = 1,
   };
 #endif
   const auto padded_size_bytes = count_distinct_desc.bitmapPaddedSizeBytes();
 
   CHECK(!columns_per_device.empty() && !columns_per_device.front().join_columns.empty());
   if (columns_per_device.front().join_columns.front().num_elems == 0) {
     return std::make_pair(0, 0);
   }
 
   for (auto& columns_for_device : columns_per_device) {
     columns_for_device.setBucketInfo(inverse_bucket_sizes_for_dimension,
                                      inner_outer_pairs_);
   }
 
   // Number of keys must match dimension of buckets
   CHECK_EQ(columns_per_device.front().join_columns.size(),
            columns_per_device.front().join_buckets.size());
   if (effective_memory_level_ == Data_Namespace::MemoryLevel::CPU_LEVEL) {
     const auto composite_key_info =
         HashJoin::getCompositeKeyInfo(inner_outer_pairs_, executor_);
     int thread_count = cpu_threads();
     std::vector<uint8_t> hll_buffer_all_cpus(thread_count * padded_size_bytes);
     auto hll_result = &hll_buffer_all_cpus[0];
 
     std::vector<int32_t> num_keys_for_row;
     num_keys_for_row.resize(columns_per_device.front().join_columns[0].num_elems);
 
     approximate_distinct_tuples_range(hll_result,
                                       num_keys_for_row,
                                       count_distinct_desc.bitmap_sz_bits,
                                       padded_size_bytes,
                                       columns_per_device.front().join_columns,
                                       columns_per_device.front().join_column_types,
                                       columns_per_device.front().join_buckets,
                                       isInnerColCompressed(),
                                       thread_count);
 
     for (int i = 1; i < thread_count; ++i) {
       hll_unify(hll_result,
                 hll_result + i * padded_size_bytes,
                 size_t(1) << count_distinct_desc.bitmap_sz_bits);
     }
     return std::make_pair(hll_size(hll_result, count_distinct_desc.bitmap_sz_bits),
                           num_keys_for_row.size() > 0 ? num_keys_for_row.back() : 0);
   }
 #ifdef HAVE_CUDA
   auto& data_mgr = *executor_->getDataMgr();
   std::vector<std::vector<uint8_t>> host_hll_buffers(device_count_);
   for (auto& host_hll_buffer : host_hll_buffers) {
     host_hll_buffer.resize(count_distinct_desc.bitmapPaddedSizeBytes());
   }
   std::vector<size_t> emitted_keys_count_device_threads(device_count_, 0);
   std::vector<std::future<void>> approximate_distinct_device_threads;
   for (int device_id = 0; device_id < device_count_; ++device_id) {
     approximate_distinct_device_threads.emplace_back(std::async(
         std::launch::async,
         [device_id,
          &columns_per_device,
          &count_distinct_desc,
          &data_mgr,
          &host_hll_buffers,
          &emitted_keys_count_device_threads,
          this] {
           auto allocator = std::make_unique<CudaAllocator>(
               &data_mgr, device_id, getQueryEngineCudaStreamForDevice(device_id));
           auto device_hll_buffer =
               allocator->alloc(count_distinct_desc.bitmapPaddedSizeBytes());
           data_mgr.getCudaMgr()->zeroDeviceMem(
               device_hll_buffer,
               count_distinct_desc.bitmapPaddedSizeBytes(),
               device_id,
               getQueryEngineCudaStreamForDevice(device_id));
           const auto& columns_for_device = columns_per_device[device_id];
           auto join_columns_gpu = transfer_vector_of_flat_objects_to_gpu(
               columns_for_device.join_columns, *allocator);
 
           CHECK_GT(columns_for_device.join_buckets.size(), 0u);
           const auto& bucket_sizes_for_dimension =
               columns_for_device.join_buckets[0].inverse_bucket_sizes_for_dimension;
           auto bucket_sizes_gpu =
               allocator->alloc(bucket_sizes_for_dimension.size() * sizeof(double));
           allocator->copyToDevice(bucket_sizes_gpu,
                                   bucket_sizes_for_dimension.data(),
                                   bucket_sizes_for_dimension.size() * sizeof(double));
           const size_t row_counts_buffer_sz =
               columns_per_device.front().join_columns[0].num_elems * sizeof(int32_t);
           auto row_counts_buffer = allocator->alloc(row_counts_buffer_sz);
           data_mgr.getCudaMgr()->zeroDeviceMem(
               row_counts_buffer,
               row_counts_buffer_sz,
               device_id,
               getQueryEngineCudaStreamForDevice(device_id));
           const auto key_handler =
               RangeKeyHandler(isInnerColCompressed(),
                               bucket_sizes_for_dimension.size(),
                               join_columns_gpu,
                               reinterpret_cast<double*>(bucket_sizes_gpu));
           const auto key_handler_gpu =
               transfer_flat_object_to_gpu(key_handler, *allocator);
           approximate_distinct_tuples_on_device_range(
               reinterpret_cast<uint8_t*>(device_hll_buffer),
               count_distinct_desc.bitmap_sz_bits,
               reinterpret_cast<int32_t*>(row_counts_buffer),
               key_handler_gpu,
               columns_for_device.join_columns[0].num_elems,
               executor_->blockSize(),
               executor_->gridSize());
 
           auto& host_emitted_keys_count = emitted_keys_count_device_threads[device_id];
           allocator->copyFromDevice(
               &host_emitted_keys_count,
               row_counts_buffer +
                   (columns_per_device.front().join_columns[0].num_elems - 1) *
                       sizeof(int32_t),
               sizeof(int32_t));
 
           auto& host_hll_buffer = host_hll_buffers[device_id];
           allocator->copyFromDevice(&host_hll_buffer[0],
                                     device_hll_buffer,
                                     count_distinct_desc.bitmapPaddedSizeBytes());
         }));
   }
   for (auto& child : approximate_distinct_device_threads) {
     child.get();
   }
   CHECK_EQ(Data_Namespace::MemoryLevel::GPU_LEVEL, effective_memory_level_);
   auto& result_hll_buffer = host_hll_buffers.front();
   auto hll_result = reinterpret_cast<int32_t*>(&result_hll_buffer[0]);
   for (int device_id = 1; device_id < device_count_; ++device_id) {
     auto& host_hll_buffer = host_hll_buffers[device_id];
     hll_unify(hll_result,
               reinterpret_cast<int32_t*>(&host_hll_buffer[0]),
               size_t(1) << count_distinct_desc.bitmap_sz_bits);
   }
   size_t emitted_keys_count = 0;
   for (auto& emitted_keys_count_device : emitted_keys_count_device_threads) {
     emitted_keys_count += emitted_keys_count_device;
   }
   return std::make_pair(hll_size(hll_result, count_distinct_desc.bitmap_sz_bits),
                         emitted_keys_count);
 #else
   UNREACHABLE();
   return {0, 0};
 #endif  // HAVE_CUDA
 }

Here is the call graph for this function:

Here is the caller graph for this function:

llvm::Value * RangeJoinHashTable::codegenKey	(	const CompilationOptions &	co,
		llvm::Value *	offset
	)

Definition at line 699 of file RangeJoinHashTable.cpp.

References CodeGenerator::castArrayPointer(), CHECK, CHECK_EQ, CodeGenerator::codegen(), BoundingBoxIntersectJoinHashTable::executor_, func_resolve, get_int_type(), Catalog_Namespace::get_metadata_for_column(), BoundingBoxIntersectJoinHashTable::getKeyComponentCount(), BoundingBoxIntersectJoinHashTable::getKeyComponentWidth(), BoundingBoxIntersectJoinHashTable::inner_outer_pairs_, BoundingBoxIntersectJoinHashTable::inverse_bucket_sizes_for_dimension_, isProbeCompressed(), kPOINT, kTINYINT, LL_BUILDER, LL_CONTEXT, LL_FP, LL_INT, and CodeGenerator::posArg().

Referenced by codegenMatchingSetWithOffset().

                                                                    {
   const auto key_component_width = getKeyComponentWidth();
   CHECK(key_component_width == 4 || key_component_width == 8);
   const auto key_size_lv = LL_INT(getKeyComponentCount() * key_component_width);
   llvm::Value* key_buff_lv{nullptr};
   switch (key_component_width) {
     case 4:
       key_buff_lv =
           LL_BUILDER.CreateAlloca(llvm::Type::getInt32Ty(LL_CONTEXT), key_size_lv);
       break;
     case 8:
       key_buff_lv =
           LL_BUILDER.CreateAlloca(llvm::Type::getInt64Ty(LL_CONTEXT), key_size_lv);
       break;
     default:
       CHECK(false);
   }
 
   const auto& inner_outer_pair = inner_outer_pairs_[0];
   const auto outer_col = inner_outer_pair.second;
   const auto outer_col_ti = outer_col->get_type_info();
 
   if (outer_col_ti.is_geometry()) {
     CodeGenerator code_generator(executor_);
     // TODO(adb): for points we will use the coords array, but for other
     // geometries we will need to use the bounding box. For now only support
     // points.
     CHECK_EQ(outer_col_ti.get_type(), kPOINT);
     CHECK_EQ(inverse_bucket_sizes_for_dimension_.size(), static_cast<size_t>(2));
 
     llvm::Value* arr_ptr{nullptr};
     // prepare point column (arr) ptr to generate code for hash table key
     if (auto outer_col_var = dynamic_cast<const Analyzer::ColumnVar*>(outer_col)) {
       const auto col_lvs = code_generator.codegen(outer_col, true, co);
       CHECK_EQ(col_lvs.size(), size_t(1));
       auto column_key = outer_col_var->getColumnKey();
       if (column_key.table_id < 0) {
         // todo: relax this
         throw QueryNotSupported(
             "Geospatial columns not yet supported in this temporary table context.");
       }
       column_key.column_id = column_key.column_id + 1;
       const auto coords_cd = Catalog_Namespace::get_metadata_for_column(column_key);
       CHECK(coords_cd);
       const auto coords_ti = coords_cd->columnType;
 
       const auto array_buff_ptr = executor_->cgen_state_->emitExternalCall(
           "array_buff",
           llvm::Type::getInt8PtrTy(executor_->cgen_state_->context_),
           {col_lvs.front(), code_generator.posArg(outer_col)});
       CHECK(array_buff_ptr);
       CHECK(coords_ti.get_elem_type().get_type() == kTINYINT)
           << "Only TINYINT coordinates columns are supported in bounding box "
              "intersection.";
       arr_ptr =
           code_generator.castArrayPointer(array_buff_ptr, coords_ti.get_elem_type());
     } else if (auto geo_expr_outer_col =
                    dynamic_cast<const Analyzer::GeoOperator*>(outer_col)) {
       const auto geo_expr_name = geo_expr_outer_col->getName();
       if (func_resolve(geo_expr_name, "ST_Point"sv, "ST_Transform"sv, "ST_Centroid"sv)) {
         // note that ST_SetSRID changes type info of the column, and is handled by
         // translation phase, so when we use ST_SETSRID(ST_POINT(x, y), 4326)
         // as a join column expression, we recognize it as ST_POINT (with SRID as 4326)
         const auto col_lvs = code_generator.codegen(outer_col, true, co);
         // listed functions keep point coordinates in the local variable (let say S)
         // which is corresponding to the pointer that col_lvs[0] holds
         // thus, all we need is to retrieve necessary coordinate from the S by varying
         // its offset (i.e., i == 0 means x coordinate)
         arr_ptr = LL_BUILDER.CreatePointerCast(
             col_lvs[0], llvm::Type::getInt8PtrTy(executor_->cgen_state_->context_));
       } else {
         throw std::runtime_error(
             "RHS key of the range join operator has a geospatial function which is not "
             "supported yet: " +
             geo_expr_name);
       }
     } else {
       throw std::runtime_error("Range join operator has an invalid rhs key: " +
                                outer_col->toString());
     }
 
     // load and unpack offsets
     const auto offset =
         LL_BUILDER.CreateLoad(offset_ptr->getType()->getPointerElementType(),
                               offset_ptr,
                               "packed_bucket_offset");
     const auto x_offset =
         LL_BUILDER.CreateTrunc(offset, llvm::Type::getInt32Ty(LL_CONTEXT));
 
     const auto y_offset_shifted =
         LL_BUILDER.CreateLShr(offset, LL_INT(static_cast<int64_t>(32)));
     const auto y_offset =
         LL_BUILDER.CreateTrunc(y_offset_shifted, llvm::Type::getInt32Ty(LL_CONTEXT));
 
     const auto x_bucket_offset =
         LL_BUILDER.CreateSExt(x_offset, llvm::Type::getInt64Ty(LL_CONTEXT));
     const auto y_bucket_offset =
         LL_BUILDER.CreateSExt(y_offset, llvm::Type::getInt64Ty(LL_CONTEXT));
 
     for (size_t i = 0; i < 2; i++) {
       const auto key_comp_dest_lv = LL_BUILDER.CreateGEP(
           key_buff_lv->getType()->getScalarType()->getPointerElementType(),
           key_buff_lv,
           LL_INT(i));
 
       const auto funcName = isProbeCompressed() ? "get_bucket_key_for_range_compressed"
                                                 : "get_bucket_key_for_range_double";
 
       // Note that get_bucket_key_for_range_compressed will need to be
       // specialized for future compression schemes
       auto bucket_key = executor_->cgen_state_->emitExternalCall(
           funcName,
           get_int_type(64, LL_CONTEXT),
           {arr_ptr, LL_INT(i), LL_FP(inverse_bucket_sizes_for_dimension_[i])});
 
       auto bucket_key_shifted = i == 0
                                     ? LL_BUILDER.CreateAdd(x_bucket_offset, bucket_key)
                                     : LL_BUILDER.CreateAdd(y_bucket_offset, bucket_key);
 
       const auto col_lv = LL_BUILDER.CreateSExt(
           bucket_key_shifted, get_int_type(key_component_width * 8, LL_CONTEXT));
       LL_BUILDER.CreateStore(col_lv, key_comp_dest_lv);
     }
   } else {
     LOG(FATAL) << "Range join key currently only supported for geospatial types.";
   }
   return key_buff_lv;
 }

Here is the call graph for this function:

Here is the caller graph for this function:

HashJoinMatchingSet RangeJoinHashTable::codegenMatchingSetWithOffset	(	const CompilationOptions &	co,
		const size_t	index,
		llvm::Value *	range_offset
	)

Definition at line 829 of file RangeJoinHashTable.cpp.

References CHECK, HashJoin::codegenHashTableLoad(), codegenKey(), HashJoin::codegenMatchingSet(), BoundingBoxIntersectJoinHashTable::executor_, get_int_type(), BoundingBoxIntersectJoinHashTable::getComponentBufferSize(), BoundingBoxIntersectJoinHashTable::getEntryCount(), getHashType(), BoundingBoxIntersectJoinHashTable::getKeyComponentCount(), BoundingBoxIntersectJoinHashTable::getKeyComponentWidth(), LL_BUILDER, LL_CONTEXT, LL_INT, BoundingBoxIntersectJoinHashTable::offsetBufferOff(), OneToMany, and to_string().

                              {
   const auto key_component_width = getKeyComponentWidth();
   CHECK(key_component_width == 4 || key_component_width == 8);
 
   auto key_buff_lv = codegenKey(co, range_offset);
   CHECK(getHashType() == HashType::OneToMany);
 
   auto hash_ptr = codegenHashTableLoad(index, executor_);
   const auto composite_dict_ptr_type =
       llvm::Type::getIntNPtrTy(LL_CONTEXT, key_component_width * 8);
 
   const auto composite_key_dict =
       hash_ptr->getType()->isPointerTy()
           ? LL_BUILDER.CreatePointerCast(hash_ptr, composite_dict_ptr_type)
           : LL_BUILDER.CreateIntToPtr(hash_ptr, composite_dict_ptr_type);
 
   const auto key_component_count = getKeyComponentCount();
 
   const auto funcName =
       "get_composite_key_index_" + std::to_string(key_component_width * 8);
 
   const auto key = executor_->cgen_state_->emitExternalCall(funcName,
                                                             get_int_type(64, LL_CONTEXT),
                                                             {key_buff_lv,
                                                              LL_INT(key_component_count),
                                                              composite_key_dict,
                                                              LL_INT(getEntryCount())});
 
   auto one_to_many_ptr = hash_ptr;
   if (one_to_many_ptr->getType()->isPointerTy()) {
     one_to_many_ptr =
         LL_BUILDER.CreatePtrToInt(hash_ptr, llvm::Type::getInt64Ty(LL_CONTEXT));
   } else {
     CHECK(one_to_many_ptr->getType()->isIntegerTy(64));
   }
   const auto composite_key_dict_size = offsetBufferOff();
   one_to_many_ptr =
       LL_BUILDER.CreateAdd(one_to_many_ptr, LL_INT(composite_key_dict_size));
 
   return HashJoin::codegenMatchingSet(
       /* hash_join_idx_args_in */ {one_to_many_ptr,
                                    key,
                                    LL_INT(int64_t(0)),
                                    LL_INT(getEntryCount() - 1)},
       /* is_sharded            */ false,
       /* is_nullable           */ false,
       /* is_bw_eq              */ false,
       /* sub_buff_size         */ getComponentBufferSize(),
       /* executor              */ executor_);
 }

Here is the call graph for this function:

std::pair< size_t, size_t > RangeJoinHashTable::computeRangeHashTableCounts	(	const size_t	shard_count,
		std::vector< ColumnsForDevice > &	columns_per_device
	)

protected

Definition at line 502 of file RangeJoinHashTable.cpp.

References approximateTupleCount(), bucket_threshold_, CHECK, BoundingBoxIntersectJoinHashTable::device_count_, get_entries_per_device(), BoundingBoxIntersectJoinHashTable::inverse_bucket_sizes_for_dimension_, max_hashtable_size_, and BoundingBoxIntersectJoinHashTable::memory_level_.

Referenced by reifyWithLayout().

                                                      {
   CHECK(!inverse_bucket_sizes_for_dimension_.empty());
   const auto [tuple_count, emitted_keys_count] =
       approximateTupleCount(inverse_bucket_sizes_for_dimension_,
                             columns_per_device,
                             max_hashtable_size_,
                             bucket_threshold_);
   const auto entry_count = 2 * std::max(tuple_count, size_t(1));
 
   return std::make_pair(
       get_entries_per_device(entry_count, shard_count, device_count_, memory_level_),
       emitted_keys_count);
 }

Here is the call graph for this function:

Here is the caller graph for this function:

HashType RangeJoinHashTable::getHashType ( ) const

inlineoverrideprotectedvirtualnoexcept

Reimplemented from BoundingBoxIntersectJoinHashTable.

Definition at line 90 of file RangeJoinHashTable.h.

References OneToMany.

Referenced by codegenMatchingSetWithOffset().

                                                  {
     return HashType::OneToMany;
   }

Here is the caller graph for this function:

std::shared_ptr< RangeJoinHashTable > RangeJoinHashTable::getInstance	(	const std::shared_ptr< Analyzer::BinOper >	condition,
		const Analyzer::RangeOper *	range_expr,
		const std::vector< InputTableInfo > &	query_infos,
		const Data_Namespace::MemoryLevel	memory_level,
		const JoinType	join_type,
		const int	device_count,
		ColumnCacheMap &	column_cache,
		Executor *	executor,
		const HashTableBuildDagMap &	hashtable_build_dag_map,
		const RegisteredQueryHint &	query_hints,
		const TableIdToNodeMap &	table_id_to_node_map
	)

static

NOTE(jclay): Handling Range Joins With Mixed Compression:

First, let's take a concrete example of a query that is rewritten as a range join. Notice in the first code block, that the condition operator is a bounding box intersection operator. The LHS is a column, and the RHS is the range operator. In order to have the hash table build and probe work properly, we need to ensure that the approriate runtime functions are selected. The following breakdown is provided to help document how the appropriate runtime funditon is selected.

The LHS of the RangeOper is used to build the hash table
The LHS of the BoundingBoxIntersectionOper + the RHS of the RangeOper is used as probe

SELECT count(*) FROM t1, t2 where ST_Distance(t1.p1_comp32, t2.p1) <= 6.3;

BinOper condition

((BoundingBoxIntersect) (ColumnVar table: (t1) column: (p1_comp32) GEOMETRY(POINT, 4326) ENCODING COMPRESSED(32)) (RangeOper) (ColumnVar table: (t2) column: (p1) GEOMETRY(POINT, 4326) ENCODING NONE), (Const 6.330000))

RangeOper condition

[(ColumnVar table: 5 (t2) column: 1 rte: 1 GEOMETRY(POINT, 4326) ENCODING NONE), (Const 6.330000)]

Same example as above, annotated:

SELECT count(*) FROM t1, t2 where ST_Distance( t1.p1_comp32, << Bounding Box Intersection Condition LHS t2.p1 << RangeOper LHS ) <= 6.3; << RangeOper RHS

In this case, we select the uncompressed runtime functions when building the hash table over t2.p1. When performing the probe, we must select the compressed runtime functions.

Definition at line 71 of file RangeJoinHashTable.cpp.

References CHECK, HashJoin::checkHashJoinReplicationConstraint(), logger::FATAL, get_inner_query_info(), Analyzer::RangeOper::get_left_operand(), Catalog_Namespace::get_metadata_for_column(), HashJoin::getInnerTableId(), Fragmenter_Namespace::TableInfo::getNumTuplesUpperBound(), BaselineJoinHashTable::getShardCountForCondition(), Data_Namespace::GPU_LEVEL, InputTableInfo::info, LOG, HashJoin::MAX_NUM_HASH_ENTRIES, OneToMany, and Analyzer::RangeOper::toString().

Referenced by BoundingBoxIntersectJoinHashTable::getInstance().

                                                   {
   // the hash table is built over the LHS of the range oper. we then use the lhs
   // of the bin oper + the rhs of the range oper for the probe
   auto range_expr_col_var =
       dynamic_cast<const Analyzer::ColumnVar*>(range_expr->get_left_operand());
   if (!range_expr_col_var || !range_expr_col_var->get_type_info().is_geometry()) {
     throw HashJoinFail("Could not build hash tables for range join | " +
                        range_expr->toString());
   }
 
   CHECK(range_expr_col_var->get_type_info().is_geometry());
 
   auto coords_column_key = range_expr_col_var->getColumnKey();
   coords_column_key.column_id = coords_column_key.column_id + 1;
   const auto coords_cd = Catalog_Namespace::get_metadata_for_column(coords_column_key);
   CHECK(coords_cd);
 
   auto range_join_inner_col_expr = makeExpr<Analyzer::ColumnVar>(
       coords_cd->columnType, coords_column_key, range_expr_col_var->get_rte_idx());
 
   std::vector<InnerOuter> inner_outer_pairs;
   inner_outer_pairs.emplace_back(
       InnerOuter{dynamic_cast<Analyzer::ColumnVar*>(range_join_inner_col_expr.get()),
                  condition->get_left_operand()});
 
   const auto& query_info =
       get_inner_query_info(HashJoin::getInnerTableId(inner_outer_pairs), query_infos)
           .info;
 
   const auto total_entries = 2 * query_info.getNumTuplesUpperBound();
   if (total_entries > HashJoin::MAX_NUM_HASH_ENTRIES) {
     throw TooManyHashEntries();
   }
 
   const auto shard_count = memory_level == Data_Namespace::GPU_LEVEL
                                ? BaselineJoinHashTable::getShardCountForCondition(
                                      condition.get(), executor, inner_outer_pairs)
                                : 0;
 
   auto join_hash_table = std::make_shared<RangeJoinHashTable>(condition,
                                                               join_type,
                                                               range_expr,
                                                               range_join_inner_col_expr,
                                                               query_infos,
                                                               memory_level,
                                                               column_cache,
                                                               executor,
                                                               inner_outer_pairs,
                                                               device_count,
                                                               query_hints,
                                                               hashtable_build_dag_map,
                                                               table_id_to_node_map);
   HashJoin::checkHashJoinReplicationConstraint(
       HashJoin::getInnerTableId(inner_outer_pairs), shard_count, executor);
   try {
     join_hash_table->reifyWithLayout(HashType::OneToMany);
   } catch (const HashJoinFail& e) {
     throw HashJoinFail(std::string("Could not build a 1-to-1 correspondence for columns "
                                    "involved in equijoin | ") +
                        e.what());
   } catch (const ColumnarConversionNotSupported& e) {
     throw HashJoinFail(std::string("Could not build hash tables for equijoin | ") +
                        e.what());
   } catch (const JoinHashTableTooBig& e) {
     throw e;
   } catch (const std::exception& e) {
     LOG(FATAL) << "Fatal error while attempting to build hash tables for join: "
                << e.what();
   }
 
   return join_hash_table;
 }

Here is the call graph for this function:

Here is the caller graph for this function:

std::shared_ptr< BaselineHashTable > RangeJoinHashTable::initHashTableOnCpu	(	const std::vector< JoinColumn > &	join_columns,
		const std::vector< JoinColumnTypeInfo > &	join_column_types,
		const std::vector< JoinBucketInfo > &	join_bucket_info,
		const BaselineHashTableEntryInfo	hash_table_entry_info
	)

protected

Definition at line 448 of file RangeJoinHashTable.cpp.

References BBOX_INTERSECT_HT, CHECK, DataRecyclerUtil::CPU_DEVICE_IDENTIFIER, DEBUG_TIMER, BoundingBoxIntersectJoinHashTable::executor_, HashJoin::getCompositeKeyInfo(), HashTableEntryInfo::getHashTableLayout(), BoundingBoxIntersectJoinHashTable::hashtable_cache_key_, BoundingBoxIntersectJoinHashTable::inner_outer_pairs_, isInnerColCompressed(), BoundingBoxIntersectJoinHashTable::join_type_, HashJoin::layoutRequiresAdditionalBuffers(), BoundingBoxIntersectJoinHashTable::putHashTableOnCpuToCache(), BoundingBoxIntersectJoinHashTable::query_hints_, and to_string().

Referenced by reifyForDevice().

                                                             {
   auto timer = DEBUG_TIMER(__func__);
   decltype(std::chrono::steady_clock::now()) ts1, ts2;
   ts1 = std::chrono::steady_clock::now();
   const auto composite_key_info =
       HashJoin::getCompositeKeyInfo(inner_outer_pairs_, executor_);
   CHECK(!join_columns.empty());
   CHECK(!join_bucket_info.empty());
 
   CHECK(layoutRequiresAdditionalBuffers(hash_table_entry_info.getHashTableLayout()));
   const auto key_component_count =
       join_bucket_info[0].inverse_bucket_sizes_for_dimension.size();
 
   auto key_handler =
       RangeKeyHandler(isInnerColCompressed(),
                       key_component_count,
                       &join_columns[0],
                       join_bucket_info[0].inverse_bucket_sizes_for_dimension.data());
 
   BaselineJoinHashTableBuilder builder;
   const StrProxyTranslationMapsPtrsAndOffsets
       dummy_str_proxy_translation_maps_ptrs_and_offsets;
   const auto err =
       builder.initHashTableOnCpu(&key_handler,
                                  composite_key_info,
                                  join_columns,
                                  join_column_types,
                                  join_bucket_info,
                                  dummy_str_proxy_translation_maps_ptrs_and_offsets,
                                  hash_table_entry_info,
                                  join_type_,
                                  executor_,
                                  query_hints_);
   ts2 = std::chrono::steady_clock::now();
   if (err) {
     throw HashJoinFail(std::string("Unrecognized error when initializing CPU "
                                    "range join hash table (") +
                        std::to_string(err) + std::string(")"));
   }
   std::shared_ptr<BaselineHashTable> hash_table = builder.getHashTable();
   auto hashtable_build_time =
       std::chrono::duration_cast<std::chrono::milliseconds>(ts2 - ts1).count();
   putHashTableOnCpuToCache(hashtable_cache_key_.front(),
                            CacheItemType::BBOX_INTERSECT_HT,
                            hash_table,
                            DataRecyclerUtil::CPU_DEVICE_IDENTIFIER,
                            hashtable_build_time);
   return hash_table;
 }

Here is the call graph for this function:

Here is the caller graph for this function:

bool RangeJoinHashTable::isInnerColCompressed ( ) const

inlineprivate

Definition at line 112 of file RangeJoinHashTable.h.

References SQLTypeInfo::get_compression(), Analyzer::RangeOper::get_left_operand(), Analyzer::Expr::get_type_info(), kENCODING_GEOINT, and range_expr_.

Referenced by approximateTupleCount(), and initHashTableOnCpu().

                                            {
     return range_expr_->get_left_operand()->get_type_info().get_compression() ==
            kENCODING_GEOINT;
   }

Here is the call graph for this function:

Here is the caller graph for this function:

bool RangeJoinHashTable::isProbeCompressed ( ) const

inlineprivate

Definition at line 117 of file RangeJoinHashTable.h.

References BoundingBoxIntersectJoinHashTable::getInnerOuterPairs(), and kENCODING_GEOINT.

Referenced by codegenKey().

                                         {
     const auto& inner_outer_pair = getInnerOuterPairs()[0];
     const auto outer_col = inner_outer_pair.second;
     const auto outer_col_ti = outer_col->get_type_info();
 
     return outer_col_ti.get_compression() == kENCODING_GEOINT;
   }

Here is the call graph for this function:

Here is the caller graph for this function:

void RangeJoinHashTable::reifyForDevice	(	const ColumnsForDevice &	columns_for_device,
		const HashType	layout,
		const size_t	entry_count,
		const size_t	emitted_keys_count,
		const int	device_id,
		const logger::ThreadLocalIds	parent_thread_local_ids
	)

protected

Definition at line 346 of file RangeJoinHashTable.cpp.

References CHECK, CHECK_EQ, CHECK_LT, Data_Namespace::CPU_LEVEL, DEBUG_TIMER_NEW_THREAD, effective_memory_level_, BoundingBoxIntersectJoinHashTable::getKeyComponentCount(), BoundingBoxIntersectJoinHashTable::getKeyComponentWidth(), Data_Namespace::GPU_LEVEL, HashJoin::hash_tables_for_device_, initHashTableOnCpu(), ColumnsForDevice::join_buckets, ColumnsForDevice::join_column_types, ColumnsForDevice::join_columns, HashJoin::layoutRequiresAdditionalBuffers(), BoundingBoxIntersectJoinHashTable::memory_level_, logger::ThreadLocalIds::setNewThreadId(), logger::ThreadLocalIds::thread_id_, UNREACHABLE, and VLOG.

Referenced by reifyWithLayout().

                                                         {
   logger::LocalIdsScopeGuard lisg = parent_thread_local_ids.setNewThreadId();
   DEBUG_TIMER_NEW_THREAD(parent_thread_local_ids.thread_id_);
   CHECK_EQ(getKeyComponentWidth(), size_t(8));
   CHECK(layoutRequiresAdditionalBuffers(layout));
   BaselineHashTableEntryInfo hash_table_entry_info(entry_count,
                                                    emitted_keys_count,
                                                    sizeof(int32_t),
                                                    getKeyComponentCount(),
                                                    getKeyComponentWidth(),
                                                    layout,
                                                    false);
   if (effective_memory_level_ == Data_Namespace::MemoryLevel::CPU_LEVEL) {
     VLOG(1) << "Building range join hash table on CPU.";
     auto hash_table = initHashTableOnCpu(columns_for_device.join_columns,
                                          columns_for_device.join_column_types,
                                          columns_for_device.join_buckets,
                                          hash_table_entry_info);
     CHECK(hash_table);
 
 #ifdef HAVE_CUDA
     if (memory_level_ == Data_Namespace::MemoryLevel::GPU_LEVEL) {
       auto gpu_hash_table = copyCpuHashTableToGpu(hash_table, device_id);
       CHECK_LT(size_t(device_id), hash_tables_for_device_.size());
       hash_tables_for_device_[device_id] = std::move(gpu_hash_table);
     } else {
 #else
     CHECK_EQ(Data_Namespace::CPU_LEVEL, effective_memory_level_);
 #endif
       CHECK_EQ(hash_tables_for_device_.size(), size_t(1));
       hash_tables_for_device_[0] = std::move(hash_table);
 #ifdef HAVE_CUDA
     }
 #endif
   } else {
 #ifdef HAVE_CUDA
     auto hash_table = initHashTableOnGpu(columns_for_device.join_columns,
                                          columns_for_device.join_column_types,
                                          columns_for_device.join_buckets,
                                          hash_table_entry_info,
                                          device_id);
     CHECK_LT(size_t(device_id), hash_tables_for_device_.size());
     hash_tables_for_device_[device_id] = std::move(hash_table);
 #else
     UNREACHABLE();
 #endif
   }
 }

Here is the call graph for this function:

Here is the caller graph for this function:

void RangeJoinHashTable::reifyWithLayout ( const HashType layout )

overrideprotectedvirtual

Reimplemented from BoundingBoxIntersectJoinHashTable.

Definition at line 155 of file RangeJoinHashTable.cpp.

                                                               {
   auto timer = DEBUG_TIMER(__func__);
   CHECK(layout == HashType::OneToMany);
 
   const auto& query_info =
       get_inner_query_info(HashJoin::getInnerTableId(inner_outer_pairs_), query_infos_)
           .info;
 
   if (query_info.fragments.empty()) {
     return;
   }
 
   const auto& table_key = getInnerTableId();
   VLOG(1) << "Reify with layout " << getHashTypeString(layout) << "for " << table_key;
 
   std::vector<ColumnsForDevice> columns_per_device;
 
   auto data_mgr = executor_->getDataMgr();
   std::vector<std::vector<Fragmenter_Namespace::FragmentInfo>> fragments_per_device;
   std::vector<std::unique_ptr<CudaAllocator>> dev_buff_owners;
   const auto shard_count = shardCount();
   for (int device_id = 0; device_id < device_count_; ++device_id) {
     fragments_per_device.emplace_back(
         shard_count
             ? only_shards_for_device(query_info.fragments, device_id, device_count_)
             : query_info.fragments);
     if (memory_level_ == Data_Namespace::MemoryLevel::GPU_LEVEL) {
       dev_buff_owners.emplace_back(std::make_unique<CudaAllocator>(
           data_mgr, device_id, getQueryEngineCudaStreamForDevice(device_id)));
     }
     // for bounding box intersection, we need to fetch columns regardless of the
     // availability of cached hash table to calculate various params, i.e., bucket size
     // info todo(yoonmin) : relax this
     const auto columns_for_device =
         fetchColumnsForDevice(fragments_per_device[device_id],
                               device_id,
                               memory_level_ == Data_Namespace::MemoryLevel::GPU_LEVEL
                                   ? dev_buff_owners[device_id].get()
                                   : nullptr);
     columns_per_device.push_back(columns_for_device);
   }
 
   inverse_bucket_sizes_for_dimension_.clear();
 
   const auto bucket_range =
       dynamic_cast<const Analyzer::Constant*>(range_expr_->get_right_operand());
 
   CHECK(bucket_range);
   CHECK(bucket_range->get_type_info().is_fp() &&
         bucket_range->get_type_info().get_size() == 8);  // TODO
 
   const auto bucket_range_datum = bucket_range->get_constval();
 
   inverse_bucket_sizes_for_dimension_.emplace_back(1. / bucket_range_datum.doubleval);
   inverse_bucket_sizes_for_dimension_.emplace_back(1. / bucket_range_datum.doubleval);
 
   setInverseBucketSizeInfo(
       inverse_bucket_sizes_for_dimension_, columns_per_device, device_count_);
 
   effective_memory_level_ = getEffectiveMemoryLevel(inner_outer_pairs_);
 
   // to properly lookup cached hash table, we need to use join columns listed as lhs and
   // rhs of the bbox intersect op instead of physical (and hidden) column tailored to
   // range join expr in other words, we need to use geometry column (point) instead of its
   // hidden array column i.e., see `get_physical_cols` function
   std::vector<InnerOuter> inner_outer_pairs_for_cache_lookup;
   inner_outer_pairs_for_cache_lookup.emplace_back(InnerOuter{
       dynamic_cast<const Analyzer::ColumnVar*>(range_expr_->get_left_operand()),
       condition_->get_left_operand()});
   auto hashtable_access_path_info =
       HashtableRecycler::getHashtableAccessPathInfo(inner_outer_pairs_for_cache_lookup,
                                                     {},
                                                     condition_->get_optype(),
                                                     join_type_,
                                                     hashtable_build_dag_map_,
                                                     device_count_,
                                                     shard_count,
                                                     fragments_per_device,
                                                     executor_);
   hashtable_cache_key_ = hashtable_access_path_info.hashed_query_plan_dag;
   table_keys_ = hashtable_access_path_info.table_keys;
 
   auto get_inner_table_key = [&inner_outer_pairs_for_cache_lookup]() {
     auto col_var = inner_outer_pairs_for_cache_lookup.front().first;
     return col_var->getTableKey();
   };
 
   if (table_keys_.empty()) {
     const auto& inner_table_key = get_inner_table_key();
     table_keys_ = DataRecyclerUtil::getAlternativeTableKeys(
         composite_key_info_.cache_key_chunks, inner_table_key);
   }
   CHECK(!table_keys_.empty());
 
   setBoundingBoxIntersectionMetaInfo(
       max_hashtable_size_, bucket_threshold_, inverse_bucket_sizes_for_dimension_);
   generateCacheKey(max_hashtable_size_,
                    bucket_threshold_,
                    inverse_bucket_sizes_for_dimension_,
                    fragments_per_device,
                    device_count_);
 
   if (HashtableRecycler::isInvalidHashTableCacheKey(hashtable_cache_key_) &&
       get_inner_table_key().table_id > 0) {
     std::vector<size_t> per_device_chunk_key;
     for (int device_id = 0; device_id < device_count_; ++device_id) {
       auto chunk_key_hash = boost::hash_value(composite_key_info_.cache_key_chunks);
       boost::hash_combine(chunk_key_hash,
                           HashJoin::collectFragmentIds(fragments_per_device[device_id]));
       per_device_chunk_key.push_back(chunk_key_hash);
       AlternativeCacheKeyForBoundingBoxIntersection cache_key{
           inner_outer_pairs_for_cache_lookup,
           columns_per_device.front().join_columns.front().num_elems,
           chunk_key_hash,
           condition_->get_optype(),
           max_hashtable_size_,
           bucket_threshold_,
           {}};
       hashtable_cache_key_[device_id] = getAlternativeCacheKey(cache_key);
       hash_table_cache_->addQueryPlanDagForTableKeys(hashtable_cache_key_[device_id],
                                                      table_keys_);
     }
   }
 
   if (effective_memory_level_ == Data_Namespace::MemoryLevel::CPU_LEVEL) {
     std::lock_guard<std::mutex> cpu_hash_table_buff_lock(cpu_hash_table_buff_mutex_);
     if (auto generic_hash_table =
             initHashTableOnCpuFromCache(hashtable_cache_key_.front(),
                                         CacheItemType::BBOX_INTERSECT_HT,
                                         DataRecyclerUtil::CPU_DEVICE_IDENTIFIER)) {
       if (auto hash_table =
               std::dynamic_pointer_cast<BaselineHashTable>(generic_hash_table)) {
         // See if a hash table of a different layout was returned.
         // If it was OneToMany, we can reuse it on ManyToMany.
         if (layout == HashType::ManyToMany &&
             hash_table->getLayout() == HashType::OneToMany) {
           // use the cached hash table
           layout_override_ = HashType::ManyToMany;
         }
 
         if (memory_level_ == Data_Namespace::MemoryLevel::GPU_LEVEL) {
 #ifdef HAVE_CUDA
           for (int device_id = 0; device_id < device_count_; ++device_id) {
             auto gpu_hash_table = copyCpuHashTableToGpu(hash_table, device_id);
             CHECK_LT(size_t(device_id), hash_tables_for_device_.size());
             hash_tables_for_device_[device_id] = std::move(gpu_hash_table);
           }
 #else
           UNREACHABLE();
 #endif
         } else {
           CHECK_EQ(Data_Namespace::CPU_LEVEL, memory_level_);
           CHECK_EQ(hash_tables_for_device_.size(), size_t(1));
           // do not move hash_table to keep valid ptr of it within the hash table recycler
           hash_tables_for_device_[0] = hash_table;
         }
         return;
       }
     }
   }
 
   auto [entry_count, emitted_keys_count] =
       computeRangeHashTableCounts(shard_count, columns_per_device);
 
   size_t hash_table_size = BoundingBoxIntersectJoinHashTable::calculateHashTableSize(
       inverse_bucket_sizes_for_dimension_.size(), emitted_keys_count, entry_count);
 
   VLOG(1) << "Finalized range join hash table: entry count " << entry_count
           << " hash table size " << hash_table_size;
 
   std::vector<std::future<void>> init_threads;
   for (int device_id = 0; device_id < device_count_; ++device_id) {
     init_threads.push_back(
         std::async(std::launch::async,
                    &RangeJoinHashTable::reifyForDevice,
                    this,
                    /* columns_for_device      */ columns_per_device[device_id],
                    /* layout_type             */ layout,
                    /* entry_count             */ entry_count,
                    /* emitted_keys_count      */ emitted_keys_count,
                    /* device_id               */ device_id,
                    /* parent_thread_local_ids */ logger::thread_local_ids()));
   }
   for (auto& init_thread : init_threads) {
     init_thread.wait();
   }
   for (auto& init_thread : init_threads) {
     init_thread.get();
   }
 }

Here is the call graph for this function:

Member Data Documentation

const double RangeJoinHashTable::bucket_threshold_ {std::numeric_limits<double>::max()}

private

Definition at line 128 of file RangeJoinHashTable.h.

Referenced by computeRangeHashTableCounts(), and reifyWithLayout().

Data_Namespace::MemoryLevel RangeJoinHashTable::effective_memory_level_

private

Definition at line 127 of file RangeJoinHashTable.h.

Referenced by approximateTupleCount(), reifyForDevice(), and reifyWithLayout().

std::shared_ptr<Analyzer::ColumnVar> RangeJoinHashTable::inner_col_expr_

private

Definition at line 126 of file RangeJoinHashTable.h.

const size_t RangeJoinHashTable::max_hashtable_size_ {std::numeric_limits<size_t>::max()}

private

Definition at line 129 of file RangeJoinHashTable.h.

Referenced by computeRangeHashTableCounts(), and reifyWithLayout().

const Analyzer::RangeOper* RangeJoinHashTable::range_expr_

private

Definition at line 125 of file RangeJoinHashTable.h.

Referenced by isInnerColCompressed(), and reifyWithLayout().

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

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

Public Member Functions

Static Public Member Functions

Protected Member Functions

Private Member Functions

Private Attributes

Additional Inherited Members

Detailed Description

Constructor & Destructor Documentation

Member Function Documentation

NOTE(jclay): Handling Range Joins With Mixed Compression:

BinOper condition

RangeOper condition

Member Data Documentation