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
|
#include "interface.h"
#include <array>
#include <util/string/builder.h>
#include <util/generic/hash.h>
#include <util/generic/hash_set.h>
#include <library/cpp/disjoint_sets/disjoint_sets.h>
namespace NYql {
namespace {
std::array<TStringBuf,6> Prefixes = {
"",
" ",
" ",
" ",
" ",
" "
};
TStringBuf Prefix(int level) {
return level < (int)Prefixes.size()
? Prefixes[level]
: Prefixes.back();
}
void PrettyPrintVar(TStringBuilder& b, const IOptimizer::TInput* input, IOptimizer::TVarId varId) {
const auto& [relno, varno] = varId;
auto varName = input
? input->Rels[relno-1].TargetVars[varno-1].Name
: '\0';
if (!varName) {
b << "(" << relno << "," << varno << ")";
} else {
b << varName;
}
}
void PrettyPrintVars(TStringBuilder& b, const IOptimizer::TInput* input, const std::vector<IOptimizer::TVarId>& vars) {
for (ui32 j = 0; j < vars.size(); ++j) {
PrettyPrintVar(b, input, vars[j]);
if (j != vars.size() - 1) {
b << ",";
}
}
}
void PrettyPrintNode(int level, TStringBuilder& b, const IOptimizer::TOutput& output, int id) {
TStringBuf prefix = Prefix(level);
const auto& node = output.Nodes[id];
switch (node.Mode) {
case IOptimizer::EJoinType::Unknown: b << prefix << " Node\n"; break;
case IOptimizer::EJoinType::Inner: b << prefix << " Inner Join\n"; break;
case IOptimizer::EJoinType::Left: b << prefix << " Left Join\n"; break;
case IOptimizer::EJoinType::Right: b << prefix << " Right Join\n"; break;
default: b << prefix << " Unknown\n"; break;
}
switch (node.Strategy) {
case IOptimizer::EJoinStrategy::Hash: b << prefix << " Hash Strategy\n"; break;
case IOptimizer::EJoinStrategy::Loop: b << prefix << " Loop Strategy\n"; break;
default: break;
}
if (!node.Rels.empty())
{
b << prefix << " Rels: [";
for (int i = 0; i < (int)node.Rels.size()-1; i++) {
b << node.Rels[i] << ",";
}
b << node.Rels.back();
b << "]\n";
}
{
if (!node.LeftVars.empty() && !node.RightVars.empty()) {
b << prefix << " Op: ";
PrettyPrintVars(b, output.Input, node.LeftVars);
b << " = ";
PrettyPrintVars(b, output.Input, node.RightVars);
b << "\n";
}
}
if (node.Outer != -1) {
b << prefix << " {\n";
PrettyPrintNode(level+1, b, output, node.Outer);
b << prefix << " }\n";
}
if (node.Inner != -1) {
b << prefix << " {\n";
PrettyPrintNode(level+1, b, output, node.Inner);
b << prefix << " }\n";
}
}
void PrettyPrintRel(TStringBuilder& b, const IOptimizer::TInput* input, const auto& relId) {
const auto& rel = input->Rels[relId - 1];
b << "{";
b << "rows: " << rel.Rows << ",";
b << "cost: " << rel.TotalCost << ",";
b << "vars: [";
for (ui32 i = 0; i < rel.TargetVars.size(); i++) {
PrettyPrintVar(b, input, {relId, i + 1});
if (i != rel.TargetVars.size() - 1) {
b << ", ";
}
}
b << "]";
b << "}";
}
} // namespace
TString IOptimizer::TOutput::ToString(bool printCost) const {
TStringBuilder b;
if (printCost) {
char buf[1024];
snprintf(buf, sizeof(buf), "%.2lf", Rows);
b << "Rows: " << buf << "\n";
snprintf(buf, sizeof(buf), "%.2lf", TotalCost);
b << "TotalCost: " << buf << "\n";
}
b << "{\n";
if (!Nodes.empty()) {
PrettyPrintNode(0, b, *this, 0);
}
b << "}\n";
return b;
}
TString IOptimizer::TInput::ToString() const {
TStringBuilder b;
b << "Rels: [";
for (ui32 i = 0; i < Rels.size(); ++i) {
PrettyPrintRel(b, this, i + 1);
if (i != Rels.size() - 1) {
b << ",\n";
}
}
b << "]\n";
b << "EqClasses: [";
for (ui32 i = 0; i < EqClasses.size(); ++i) {
b << "[";
PrettyPrintVars(b, this, EqClasses[i].Vars);
b << "]";
if (i != EqClasses.size() - 1) {
b << ",";
}
}
b << "]\n";
return b;
}
void IOptimizer::TInput::Normalize() {
using TId = TDisjointSets::TElement;
THashMap<TVarId, TId> var2id;
std::vector<TVarId> id2var;
TId curId = 1;
for (auto& eq : EqClasses) {
for (auto& v : eq.Vars) {
auto& id = var2id[v];
if (id == 0) {
id = curId;
id2var.resize(curId + 1);
id2var[curId] = v;
++curId;
}
}
}
TDisjointSets u(curId + 1);
for (auto& eq : EqClasses) {
Y_ABORT_UNLESS(!eq.Vars.empty());
ui32 i = 0;
TId first = var2id[eq.Vars[i++]];
for (; i < eq.Vars.size(); ++i) {
TId id = var2id[eq.Vars[i]];
u.UnionSets(first, id);
}
}
THashMap<TId, THashSet<TId>> eqClasses;
for (auto& eq : EqClasses) {
for (auto& var : eq.Vars) {
auto id = var2id[var];
auto canonicalId = u.CanonicSetElement(id);
eqClasses[canonicalId].emplace(id);
}
}
EqClasses.clear();
for (auto& [_, ids]: eqClasses) {
TEq eqClass;
eqClass.Vars.reserve(ids.size());
for (auto id : ids) {
eqClass.Vars.emplace_back(id2var[id]);
}
std::sort(eqClass.Vars.begin(), eqClass.Vars.end());
EqClasses.emplace_back(std::move(eqClass));
}
}
}
|
