This repository was archived by the owner on Sep 27, 2019. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 618
/
Copy pathcolumn_stats_catalog.cpp
243 lines (211 loc) · 10.9 KB
/
column_stats_catalog.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
//===----------------------------------------------------------------------===//
//
// Peloton
//
// column_stats_catalog.cpp
//
// Identification: src/catalog/column_stats_catalog.cpp
//
// Copyright (c) 2015-17, Carnegie Mellon University Database Group
//
//===----------------------------------------------------------------------===//
#include "catalog/column_stats_catalog.h"
#include "catalog/catalog.h"
#include "executor/logical_tile.h"
#include "optimizer/stats/column_stats_collector.h"
#include "storage/data_table.h"
#include "storage/tuple.h"
namespace peloton {
namespace catalog {
ColumnStatsCatalog::ColumnStatsCatalog(concurrency::TransactionContext *txn,
const std::string &database_name)
: AbstractCatalog(txn, "CREATE TABLE " + database_name +
"." CATALOG_SCHEMA_NAME "." COLUMN_STATS_CATALOG_NAME
" ("
"table_id INT NOT NULL, "
"column_id INT NOT NULL, "
"num_rows INT NOT NULL, "
"cardinality DECIMAL NOT NULL, "
"frac_null DECIMAL NOT NULL, "
"most_common_vals VARCHAR, "
"most_common_freqs VARCHAR, "
"histogram_bounds VARCHAR, "
"column_name VARCHAR, "
"has_index BOOLEAN);") {
// unique key: (database_id, table_id, column_id)
Catalog::GetInstance()->CreateIndex(txn,
database_name,
CATALOG_SCHEMA_NAME,
COLUMN_STATS_CATALOG_NAME,
COLUMN_STATS_CATALOG_NAME "_skey0",
{ColumnId::TABLE_ID, ColumnId::COLUMN_ID},
true,
IndexType::BWTREE);
// non-unique key: (database_id, table_id)
Catalog::GetInstance()->CreateIndex(txn,
database_name,
CATALOG_SCHEMA_NAME,
COLUMN_STATS_CATALOG_NAME,
COLUMN_STATS_CATALOG_NAME "_skey1",
{ColumnId::TABLE_ID},
false,
IndexType::BWTREE);
}
ColumnStatsCatalog::~ColumnStatsCatalog() {}
bool ColumnStatsCatalog::InsertColumnStats(concurrency::TransactionContext *txn,
oid_t table_id,
oid_t column_id,
std::string column_name,
int num_rows,
double frac_null,
std::string most_common_vals,
std::string most_common_freqs,
std::string histogram_bounds,
double cardinality,
bool has_index,
type::AbstractPool *pool) {
std::unique_ptr<storage::Tuple> tuple(
new storage::Tuple(catalog_table_->GetSchema(), true));
auto val_table_id = type::ValueFactory::GetIntegerValue(table_id);
auto val_column_id = type::ValueFactory::GetIntegerValue(column_id);
auto val_num_row = type::ValueFactory::GetIntegerValue(num_rows);
auto val_cardinality = type::ValueFactory::GetDecimalValue(cardinality);
auto val_frac_null = type::ValueFactory::GetDecimalValue(frac_null);
type::Value val_common_val, val_common_freq;
if (!most_common_vals.empty()) {
val_common_val = type::ValueFactory::GetVarcharValue(most_common_vals);
val_common_freq = type::ValueFactory::GetVarcharValue(most_common_freqs);
} else {
val_common_val =
type::ValueFactory::GetNullValueByType(type::TypeId::VARCHAR);
val_common_freq =
type::ValueFactory::GetNullValueByType(type::TypeId::DECIMAL);
}
type::Value val_hist_bounds;
if (!histogram_bounds.empty()) {
val_hist_bounds = type::ValueFactory::GetVarcharValue(histogram_bounds);
} else {
val_hist_bounds =
type::ValueFactory::GetNullValueByType(type::TypeId::VARCHAR);
}
type::Value val_column_name =
type::ValueFactory::GetVarcharValue(column_name);
type::Value val_has_index = type::ValueFactory::GetBooleanValue(has_index);
tuple->SetValue(ColumnId::TABLE_ID, val_table_id, nullptr);
tuple->SetValue(ColumnId::COLUMN_ID, val_column_id, nullptr);
tuple->SetValue(ColumnId::NUM_ROWS, val_num_row, nullptr);
tuple->SetValue(ColumnId::CARDINALITY, val_cardinality, nullptr);
tuple->SetValue(ColumnId::FRAC_NULL, val_frac_null, nullptr);
tuple->SetValue(ColumnId::MOST_COMMON_VALS, val_common_val, pool);
tuple->SetValue(ColumnId::MOST_COMMON_FREQS, val_common_freq, pool);
tuple->SetValue(ColumnId::HISTOGRAM_BOUNDS, val_hist_bounds, pool);
tuple->SetValue(ColumnId::COLUMN_NAME, val_column_name, pool);
tuple->SetValue(ColumnId::HAS_INDEX, val_has_index, nullptr);
// Insert the tuple into catalog table
return InsertTuple(txn, std::move(tuple));
}
bool ColumnStatsCatalog::DeleteColumnStats(concurrency::TransactionContext *txn,
oid_t table_id,
oid_t column_id) {
oid_t index_offset = IndexId::SECONDARY_KEY_0; // Secondary key index
std::vector<type::Value> values;
values.push_back(type::ValueFactory::GetIntegerValue(table_id).Copy());
values.push_back(type::ValueFactory::GetIntegerValue(column_id).Copy());
return DeleteWithIndexScan(txn, index_offset, values);
}
std::unique_ptr<std::vector<type::Value>> ColumnStatsCatalog::GetColumnStats(concurrency::TransactionContext *txn,
oid_t table_id,
oid_t column_id) {
std::vector<oid_t> column_ids(
{ColumnId::NUM_ROWS, ColumnId::CARDINALITY, ColumnId::FRAC_NULL,
ColumnId::MOST_COMMON_VALS, ColumnId::MOST_COMMON_FREQS,
ColumnId::HISTOGRAM_BOUNDS, ColumnId::COLUMN_NAME, ColumnId::HAS_INDEX});
oid_t index_offset = IndexId::SECONDARY_KEY_0; // Secondary key index
std::vector<type::Value> values;
values.push_back(type::ValueFactory::GetIntegerValue(table_id).Copy());
values.push_back(type::ValueFactory::GetIntegerValue(column_id).Copy());
auto result_tiles =
GetResultWithIndexScan(txn,
column_ids,
index_offset,
values);
PELOTON_ASSERT(result_tiles->size() <= 1); // unique
if (result_tiles->size() == 0) {
return nullptr;
}
auto tile = (*result_tiles)[0].get();
PELOTON_ASSERT(tile->GetTupleCount() <= 1);
if (tile->GetTupleCount() == 0) {
return nullptr;
}
type::Value num_rows, cardinality, frac_null, most_common_vals,
most_common_freqs, hist_bounds, column_name, has_index;
num_rows = tile->GetValue(0, ColumnStatsOffset::NUM_ROWS_OFF);
cardinality = tile->GetValue(0, ColumnStatsOffset::CARDINALITY_OFF);
frac_null = tile->GetValue(0, ColumnStatsOffset::FRAC_NULL_OFF);
most_common_vals = tile->GetValue(0, ColumnStatsOffset::COMMON_VALS_OFF);
most_common_freqs = tile->GetValue(0, ColumnStatsOffset::COMMON_FREQS_OFF);
hist_bounds = tile->GetValue(0, ColumnStatsOffset::HIST_BOUNDS_OFF);
column_name = tile->GetValue(0, ColumnStatsOffset::COLUMN_NAME_OFF);
has_index = tile->GetValue(0, ColumnStatsOffset::HAS_INDEX_OFF);
std::unique_ptr<std::vector<type::Value>> column_stats(
new std::vector<type::Value>({num_rows, cardinality, frac_null,
most_common_vals, most_common_freqs,
hist_bounds, column_name, has_index}));
return column_stats;
}
// Return value: number of column stats
size_t ColumnStatsCatalog::GetTableStats(concurrency::TransactionContext *txn,
oid_t table_id,
std::map<oid_t,
std::unique_ptr<std::vector<type::Value>>> &column_stats_map) {
std::vector<oid_t> column_ids(
{ColumnId::COLUMN_ID, ColumnId::NUM_ROWS, ColumnId::CARDINALITY,
ColumnId::FRAC_NULL, ColumnId::MOST_COMMON_VALS,
ColumnId::MOST_COMMON_FREQS, ColumnId::HISTOGRAM_BOUNDS,
ColumnId::COLUMN_NAME, ColumnId::HAS_INDEX});
oid_t index_offset = IndexId::SECONDARY_KEY_1; // Secondary key index
std::vector<type::Value> values;
values.push_back(type::ValueFactory::GetIntegerValue(table_id).Copy());
auto result_tiles =
GetResultWithIndexScan(txn,
column_ids,
index_offset,
values);
PELOTON_ASSERT(result_tiles->size() <= 1); // unique
if (result_tiles->size() == 0) {
return 0;
}
auto tile = (*result_tiles)[0].get();
size_t tuple_count = tile->GetTupleCount();
LOG_DEBUG("Tuple count: %lu", tuple_count);
if (tuple_count == 0) {
return 0;
}
type::Value num_rows, cardinality, frac_null, most_common_vals,
most_common_freqs, hist_bounds, column_name, has_index;
for (size_t tuple_id = 0; tuple_id < tuple_count; ++tuple_id) {
num_rows = tile->GetValue(tuple_id, 1 + ColumnStatsOffset::NUM_ROWS_OFF);
cardinality =
tile->GetValue(tuple_id, 1 + ColumnStatsOffset::CARDINALITY_OFF);
frac_null = tile->GetValue(tuple_id, 1 + ColumnStatsOffset::FRAC_NULL_OFF);
most_common_vals =
tile->GetValue(tuple_id, 1 + ColumnStatsOffset::COMMON_VALS_OFF);
most_common_freqs =
tile->GetValue(tuple_id, 1 + ColumnStatsOffset::COMMON_FREQS_OFF);
hist_bounds =
tile->GetValue(tuple_id, 1 + ColumnStatsOffset::HIST_BOUNDS_OFF);
column_name =
tile->GetValue(tuple_id, 1 + ColumnStatsOffset::COLUMN_NAME_OFF);
has_index = tile->GetValue(tuple_id, 1 + ColumnStatsOffset::HAS_INDEX_OFF);
std::unique_ptr<std::vector<type::Value>> column_stats(
new std::vector<type::Value>({num_rows, cardinality, frac_null,
most_common_vals, most_common_freqs,
hist_bounds, column_name, has_index}));
oid_t column_id = tile->GetValue(tuple_id, 0).GetAs<int>();
column_stats_map[column_id] = std::move(column_stats);
}
return tuple_count;
}
} // namespace catalog
} // namespace peloton