OmniSciDB  1dac507f6e
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Pages
InputMetadata.cpp
Go to the documentation of this file.
1 /*
2  * Copyright 2017 MapD Technologies, Inc.
3  *
4  * Licensed under the Apache License, Version 2.0 (the "License");
5  * you may not use this file except in compliance with the License.
6  * You may obtain a copy of the License at
7  *
8  * http://www.apache.org/licenses/LICENSE-2.0
9  *
10  * Unless required by applicable law or agreed to in writing, software
11  * distributed under the License is distributed on an "AS IS" BASIS,
12  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13  * See the License for the specific language governing permissions and
14  * limitations under the License.
15  */
16 
17 #include "InputMetadata.h"
18 #include "Execute.h"
19 
20 #include "../Fragmenter/Fragmenter.h"
21 
22 #include <future>
23 
24 InputTableInfoCache::InputTableInfoCache(Executor* executor) : executor_(executor) {}
25 
26 namespace {
27 
29  const Fragmenter_Namespace::TableInfo& table_info) {
30  Fragmenter_Namespace::TableInfo table_info_copy;
31  table_info_copy.chunkKeyPrefix = table_info.chunkKeyPrefix;
32  table_info_copy.fragments = table_info.fragments;
33  table_info_copy.setPhysicalNumTuples(table_info.getPhysicalNumTuples());
34  return table_info_copy;
35 }
36 
38  const std::vector<const TableDescriptor*>& shard_tables) {
39  size_t total_number_of_tuples{0};
40  Fragmenter_Namespace::TableInfo table_info_all_shards;
41  for (const TableDescriptor* shard_table : shard_tables) {
42  CHECK(shard_table->fragmenter);
43  const auto& shard_metainfo = shard_table->fragmenter->getFragmentsForQuery();
44  total_number_of_tuples += shard_metainfo.getPhysicalNumTuples();
45  table_info_all_shards.fragments.insert(table_info_all_shards.fragments.end(),
46  shard_metainfo.fragments.begin(),
47  shard_metainfo.fragments.end());
48  }
49  table_info_all_shards.setPhysicalNumTuples(total_number_of_tuples);
50  return table_info_all_shards;
51 }
52 
53 } // namespace
54 
56  const auto it = cache_.find(table_id);
57  if (it != cache_.end()) {
58  const auto& table_info = it->second;
59  return copy_table_info(table_info);
60  }
61  const auto cat = executor_->getCatalog();
62  CHECK(cat);
63  const auto td = cat->getMetadataForTable(table_id);
64  CHECK(td);
65  const auto shard_tables = cat->getPhysicalTablesDescriptors(td);
66  auto table_info = build_table_info(shard_tables);
67  auto it_ok = cache_.emplace(table_id, copy_table_info(table_info));
68  CHECK(it_ok.second);
69  return copy_table_info(table_info);
70 }
71 
73  decltype(cache_)().swap(cache_);
74 }
75 
76 namespace {
77 
78 bool uses_int_meta(const SQLTypeInfo& col_ti) {
79  return col_ti.is_integer() || col_ti.is_decimal() || col_ti.is_time() ||
80  col_ti.is_boolean() ||
81  (col_ti.is_string() && col_ti.get_compression() == kENCODING_DICT);
82 }
83 
84 std::map<int, ChunkMetadata> synthesize_metadata(const ResultSet* rows) {
85  rows->moveToBegin();
86  std::vector<std::vector<std::unique_ptr<Encoder>>> dummy_encoders;
87  const size_t worker_count = use_parallel_algorithms(*rows) ? cpu_threads() : 1;
88  for (size_t worker_idx = 0; worker_idx < worker_count; ++worker_idx) {
89  dummy_encoders.emplace_back();
90  for (size_t i = 0; i < rows->colCount(); ++i) {
91  const auto& col_ti = rows->getColType(i);
92  dummy_encoders.back().emplace_back(Encoder::Create(nullptr, col_ti));
93  }
94  }
95  const auto do_work = [rows](const std::vector<TargetValue>& crt_row,
96  std::vector<std::unique_ptr<Encoder>>& dummy_encoders) {
97  for (size_t i = 0; i < rows->colCount(); ++i) {
98  const auto& col_ti = rows->getColType(i);
99  const auto& col_val = crt_row[i];
100  const auto scalar_col_val = boost::get<ScalarTargetValue>(&col_val);
101  CHECK(scalar_col_val);
102  if (uses_int_meta(col_ti)) {
103  const auto i64_p = boost::get<int64_t>(scalar_col_val);
104  CHECK(i64_p);
105  dummy_encoders[i]->updateStats(*i64_p, *i64_p == inline_int_null_val(col_ti));
106  } else if (col_ti.is_fp()) {
107  switch (col_ti.get_type()) {
108  case kFLOAT: {
109  const auto float_p = boost::get<float>(scalar_col_val);
110  CHECK(float_p);
111  dummy_encoders[i]->updateStats(*float_p,
112  *float_p == inline_fp_null_val(col_ti));
113  break;
114  }
115  case kDOUBLE: {
116  const auto double_p = boost::get<double>(scalar_col_val);
117  CHECK(double_p);
118  dummy_encoders[i]->updateStats(*double_p,
119  *double_p == inline_fp_null_val(col_ti));
120  break;
121  }
122  default:
123  CHECK(false);
124  }
125  } else {
126  throw std::runtime_error(col_ti.get_type_name() +
127  " is not supported in temporary table.");
128  }
129  }
130  };
131  if (use_parallel_algorithms(*rows)) {
132  const size_t worker_count = cpu_threads();
133  std::vector<std::future<void>> compute_stats_threads;
134  const auto entry_count = rows->entryCount();
135  for (size_t i = 0,
136  start_entry = 0,
137  stride = (entry_count + worker_count - 1) / worker_count;
138  i < worker_count && start_entry < entry_count;
139  ++i, start_entry += stride) {
140  const auto end_entry = std::min(start_entry + stride, entry_count);
141  compute_stats_threads.push_back(std::async(
142  std::launch::async,
143  [rows, &do_work, &dummy_encoders](
144  const size_t start, const size_t end, const size_t worker_idx) {
145  for (size_t i = start; i < end; ++i) {
146  const auto crt_row = rows->getRowAtNoTranslations(i);
147  if (!crt_row.empty()) {
148  do_work(crt_row, dummy_encoders[worker_idx]);
149  }
150  }
151  },
152  start_entry,
153  end_entry,
154  i));
155  }
156  for (auto& child : compute_stats_threads) {
157  child.wait();
158  }
159  for (auto& child : compute_stats_threads) {
160  child.get();
161  }
162  } else {
163  while (true) {
164  auto crt_row = rows->getNextRow(false, false);
165  if (crt_row.empty()) {
166  break;
167  }
168  do_work(crt_row, dummy_encoders[0]);
169  }
170  rows->moveToBegin();
171  }
172  std::map<int, ChunkMetadata> metadata_map;
173  for (size_t worker_idx = 1; worker_idx < worker_count; ++worker_idx) {
174  CHECK_LT(worker_idx, dummy_encoders.size());
175  const auto& worker_encoders = dummy_encoders[worker_idx];
176  for (size_t i = 0; i < rows->colCount(); ++i) {
177  dummy_encoders[0][i]->reduceStats(*worker_encoders[i]);
178  }
179  }
180  for (size_t i = 0; i < rows->colCount(); ++i) {
181  const auto it_ok =
182  metadata_map.emplace(i, dummy_encoders[0][i]->getMetadata(rows->getColType(i)));
183  CHECK(it_ok.second);
184  }
185  return metadata_map;
186 }
187 
189  std::deque<Fragmenter_Namespace::FragmentInfo> result;
190  if (rows) {
191  result.resize(1);
192  auto& fragment = result.front();
193  fragment.fragmentId = 0;
194  fragment.deviceIds.resize(3);
195  fragment.resultSet = rows.get();
196  fragment.resultSetMutex.reset(new std::mutex());
197  }
199  table_info.fragments = result;
200  return table_info;
201 }
202 
203 void collect_table_infos(std::vector<InputTableInfo>& table_infos,
204  const std::vector<InputDescriptor>& input_descs,
205  Executor* executor) {
206  const auto temporary_tables = executor->getTemporaryTables();
207  const auto cat = executor->getCatalog();
208  CHECK(cat);
209  std::unordered_map<int, size_t> info_cache;
210  for (const auto& input_desc : input_descs) {
211  const auto table_id = input_desc.getTableId();
212  const auto cached_index_it = info_cache.find(table_id);
213  if (cached_index_it != info_cache.end()) {
214  CHECK_LT(cached_index_it->second, table_infos.size());
215  table_infos.push_back(
216  {table_id, copy_table_info(table_infos[cached_index_it->second].info)});
217  continue;
218  }
219  if (input_desc.getSourceType() == InputSourceType::RESULT) {
220  CHECK_LT(table_id, 0);
221  CHECK(temporary_tables);
222  const auto it = temporary_tables->find(table_id);
223  LOG_IF(FATAL, it == temporary_tables->end())
224  << "Failed to find previous query result for node " << -table_id;
225  table_infos.push_back({table_id, synthesize_table_info(it->second)});
226  } else {
227  CHECK(input_desc.getSourceType() == InputSourceType::TABLE);
228  table_infos.push_back({table_id, executor->getTableInfo(table_id)});
229  }
230  CHECK(!table_infos.empty());
231  info_cache.insert(std::make_pair(table_id, table_infos.size() - 1));
232  }
233 }
234 
235 } // namespace
236 
237 size_t get_frag_count_of_table(const int table_id, Executor* executor) {
238  const auto temporary_tables = executor->getTemporaryTables();
239  CHECK(temporary_tables);
240  auto it = temporary_tables->find(table_id);
241  if (it != temporary_tables->end()) {
242  CHECK_GE(int(0), table_id);
243  return size_t(1);
244  } else {
245  const auto table_info = executor->getTableInfo(table_id);
246  return table_info.fragments.size();
247  }
248 }
249 
250 std::vector<InputTableInfo> get_table_infos(
251  const std::vector<InputDescriptor>& input_descs,
252  Executor* executor) {
253  std::vector<InputTableInfo> table_infos;
254  collect_table_infos(table_infos, input_descs, executor);
255  return table_infos;
256 }
257 
258 std::vector<InputTableInfo> get_table_infos(const RelAlgExecutionUnit& ra_exe_unit,
259  Executor* executor) {
261  std::vector<InputTableInfo> table_infos;
262  collect_table_infos(table_infos, ra_exe_unit.input_descs, executor);
263  return table_infos;
264 }
265 
266 const std::map<int, ChunkMetadata>&
271  }
272  return chunkMetadataMap;
273 }
274 
276  std::unique_ptr<std::lock_guard<std::mutex>> lock;
277  if (resultSetMutex) {
278  lock.reset(new std::lock_guard<std::mutex>(*resultSetMutex));
279  }
280  CHECK_EQ(!!resultSet, !!resultSetMutex);
281  if (resultSet && !synthesizedNumTuplesIsValid) {
282  numTuples = resultSet->rowCount();
283  synthesizedNumTuplesIsValid = true;
284  }
285  return numTuples;
286 }
287 
289  if (!fragments.empty() && fragments.front().resultSet) {
290  return fragments.front().getNumTuples();
291  }
292  return numTuples;
293 }
294 
296  if (!fragments.empty() && fragments.front().resultSet) {
297  return fragments.front().resultSet->entryCount();
298  }
299  return numTuples;
300 }
301 
303  if (!fragments.empty() && fragments.front().resultSet) {
304  return fragments.front().resultSet->entryCount();
305  }
306  size_t fragment_num_tupples_upper_bound = 0;
307  for (const auto& fragment : fragments) {
308  fragment_num_tupples_upper_bound =
309  std::max(fragment.getNumTuples(), fragment_num_tupples_upper_bound);
310  }
311  return fragment_num_tupples_upper_bound;
312 }
bool is_boolean() const
Definition: sqltypes.h:484
#define CHECK_EQ(x, y)
Definition: Logger.h:198
bool use_parallel_algorithms(const ResultSet &rows)
Definition: ResultSet.cpp:873
HOST DEVICE EncodingType get_compression() const
Definition: sqltypes.h:334
Fragmenter_Namespace::TableInfo copy_table_info(const Fragmenter_Namespace::TableInfo &table_info)
static Encoder * Create(Data_Namespace::AbstractBuffer *buffer, const SQLTypeInfo sqlType)
Definition: Encoder.cpp:26
Executor * executor_
Definition: InputMetadata.h:48
#define CHECK_GE(x, y)
Definition: Logger.h:203
std::deque< FragmentInfo > fragments
Definition: Fragmenter.h:167
std::shared_ptr< ResultSet > ResultSetPtr
std::vector< int > chunkKeyPrefix
Definition: Fragmenter.h:166
const std::vector< InputDescriptor > input_descs
double inline_fp_null_val(const SQL_TYPE_INFO &ti)
#define LOG_IF(severity, condition)
Definition: Logger.h:276
size_t getPhysicalNumTuples() const
Definition: Fragmenter.h:160
Fragmenter_Namespace::TableInfo getTableInfo(const int table_id)
CHECK(cgen_state)
bool uses_int_meta(const SQLTypeInfo &col_ti)
bool is_time() const
Definition: sqltypes.h:483
#define INJECT_TIMER(DESC)
Definition: measure.h:91
size_t getFragmentNumTuplesUpperBound() const
Fragmenter_Namespace::TableInfo synthesize_table_info(const ResultSetPtr &rows)
std::map< int, ChunkMetadata > chunkMetadataMap
Definition: Fragmenter.h:134
const std::map< int, ChunkMetadata > & getChunkMetadataMap() const
#define CHECK_LT(x, y)
Definition: Logger.h:200
bool is_integer() const
Definition: sqltypes.h:479
InputTableInfoCache(Executor *executor)
bool is_string() const
Definition: sqltypes.h:477
std::vector< InputTableInfo > get_table_infos(const std::vector< InputDescriptor > &input_descs, Executor *executor)
void setPhysicalNumTuples(const size_t physNumTuples)
Definition: Fragmenter.h:162
int64_t inline_int_null_val(const SQL_TYPE_INFO &ti)
std::map< int, ChunkMetadata > synthesize_metadata(const ResultSet *rows)
void collect_table_infos(std::vector< InputTableInfo > &table_infos, const std::vector< InputDescriptor > &input_descs, Executor *executor)
specifies the content in-memory of a row in the table metadata table
std::unordered_map< int, Fragmenter_Namespace::TableInfo > cache_
Definition: InputMetadata.h:47
bool is_decimal() const
Definition: sqltypes.h:480
size_t get_frag_count_of_table(const int table_id, Executor *executor)
int cpu_threads()
Definition: thread_count.h:25
Fragmenter_Namespace::TableInfo build_table_info(const std::vector< const TableDescriptor * > &shard_tables)