StreamingTopN.cpp File Reference

#include "StreamingTopN.h"
#include "RelAlgExecutor.h"
#include "Shared/checked_alloc.h"
#include "TopKSort.h"

Include dependency graph for StreamingTopN.cpp:

Go to the source code of this file.

Namespaces
	streaming_top_n

Functions
size_t	streaming_top_n::get_heap_size (const size_t row_size, const size_t n, const size_t thread_count)
size_t	streaming_top_n::get_rows_offset_of_heaps (const size_t n, const size_t thread_count)
std::vector< int8_t >	streaming_top_n::get_rows_copy_from_heaps (const int64_t *heaps, const size_t heaps_size, const size_t n, const size_t thread_count)
bool	use_streaming_top_n (const RelAlgExecutionUnit &ra_exe_unit, const bool output_columnar)
size_t	get_heap_key_slot_index (const std::vector< Analyzer::Expr * > &target_exprs, const size_t target_idx)

Function Documentation

size_t get_heap_key_slot_index	(	const std::vector< Analyzer::Expr * > &	target_exprs,
		const size_t	target_idx
	)

Definition at line 81 of file StreamingTopN.cpp.

References advance_slot(), g_bigint_count, and get_target_info().

Referenced by GroupByAndAggregate::codegenOutputSlot().

                                                        {
  size_t slot_idx = 0;
  for (size_t i = 0; i < target_idx; ++i) {
    auto agg_info = get_target_info(target_exprs[i], g_bigint_count);
    slot_idx = advance_slot(slot_idx, agg_info, false);
  }
  return slot_idx;
}

Here is the call graph for this function:

Here is the caller graph for this function:

bool use_streaming_top_n	(	const RelAlgExecutionUnit &	ra_exe_unit,
		const bool	output_columnar
	)

Definition at line 46 of file StreamingTopN.cpp.

References SortInfo::algorithm, CHECK_GT, CHECK_LE, g_cluster, SortInfo::limit, SortInfo::offset, SortInfo::order_entries, RelAlgExecutionUnit::sort_info, StreamingTopN, and RelAlgExecutionUnit::target_exprs.

Referenced by GroupByAndAggregate::codegen(), GroupByAndAggregate::codegenOutputSlot(), QueryMemoryInitializer::copyGroupByBuffersFromGpu(), QueryMemoryDescriptor::getBufferSizeBytes(), QueryExecutionContext::launchCpuCode(), QueryExecutionContext::launchGpuCode(), and QueryMemoryInitializer::QueryMemoryInitializer().

                                                     {
  if (g_cluster) {
    return false;  // TODO(miyu)
  }

  for (const auto target_expr : ra_exe_unit.target_exprs) {
    if (dynamic_cast<const Analyzer::AggExpr*>(target_expr)) {
      return false;
    }
    if (dynamic_cast<const Analyzer::WindowFunction*>(target_expr)) {
      return false;
    }
  }

  // TODO: Allow streaming top n for columnar output
  if (!output_columnar && ra_exe_unit.sort_info.order_entries.size() == 1 &&
      ra_exe_unit.sort_info.limit &&
      ra_exe_unit.sort_info.algorithm == SortAlgorithm::StreamingTopN) {
    const auto only_order_entry = ra_exe_unit.sort_info.order_entries.front();
    CHECK_GT(only_order_entry.tle_no, int(0));
    CHECK_LE(static_cast<size_t>(only_order_entry.tle_no),
             ra_exe_unit.target_exprs.size());
    const auto order_entry_expr = ra_exe_unit.target_exprs[only_order_entry.tle_no - 1];
    const auto n = ra_exe_unit.sort_info.offset + ra_exe_unit.sort_info.limit;
    if ((order_entry_expr->get_type_info().is_number() ||
         order_entry_expr->get_type_info().is_time()) &&
        n <= 100000) {  // TODO(miyu): relax?
      return true;
    }
  }

  return false;
}

Here is the caller graph for this function: