forked from yongwen/columbia
-
Notifications
You must be signed in to change notification settings - Fork 0
/
group.cpp
377 lines (321 loc) · 8.11 KB
/
group.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
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
/*
group.cpp - implementation of class GROUP
$Revision: 12 $
Implements class GROUP as defined in ssp.h
Columbia Optimizer Framework
A Joint Research Project of Portland State University
and the Oregon Graduate Institute
Directed by Leonard Shapiro and David Maier
Supported by NSF Grants IRI-9610013 and IRI-9619977
*/
#include "stdafx.h"
#include "ssp.h"
#ifdef _DEBUG
#define new DEBUG_NEW
#endif
//##ModelId=3B0C086603C7
GROUP::GROUP(M_EXPR * MExpr)
:GroupID(MExpr->GetGrpID()),
FirstLogMExpr(MExpr), LastLogMExpr(MExpr),
FirstPhysMExpr(NULL), LastPhysMExpr(NULL)
{
if (!ForGlobalEpsPruning) ClassStat[C_GROUP].New();
init_state();
// find the log prop
int arity = MExpr->GetArity();
LOG_PROP ** InputProp=NULL;
if(arity==0)
{ LogProp = (MExpr->GetOp())->FindLogProp(InputProp);
}
else
{
InputProp = new LOG_PROP* [arity];
GROUP *Group;
for(int i=0; i<arity; i++)
{
Group = Ssp->GetGroup(MExpr->GetInput(i));
InputProp[i] = Group->LogProp;
}
LogProp = ((MExpr->GetOp())->FindLogProp(InputProp));
delete [] InputProp;
}
/* Calculate the LowerBd, which is:
TouchCopyCost:
touchcopy() * |G| + //From top join
touchcopy() * sum(cucard(Ai) i = 2, ..., n-1) + // from other, nontop, joins
+ FetchCost:
fetchbound() * sum(cucard(Ai) i = 1, ..., n) // from leaf fetches
*/
double cost = 0;
if( MExpr->GetOp()->is_logical() )
{
if( MExpr->GetOp()->GetName().Compare("GET") == 0 )
cost = 0; //Since GET operator does not have a CopyOut cost
else
cost = TouchCopyCost( (LOG_COLL_PROP *)LogProp ) ;
// Add in fetching cost if CuCard Pruning
if(CuCardPruning)
cost += FetchingCost((LOG_COLL_PROP *)LogProp);
}
LowerBd = new COST(cost);
/* if the operator is EQJOIN with m tables, estimate group size
is 2^m*2.5. else it is zero */
if ( MExpr->GetOp()->GetName().Compare("EQJOIN") == 0)
{
int NumTables = this->EstimateNumTables(MExpr);
EstiGrpSize = pow(2, NumTables)*2.5;
}
else
EstiGrpSize = 0;
// the initial value is -1, meaning no winner has been found
count = -1;
if(COVETrace) //New Group
{
char buffer[10]; //Holds input group ID
CString temp;
if(arity){
for(int i = 0; i < arity; i++){
(void)itoa(MExpr -> GetInput(i), buffer, 10);
temp = temp + " "+ buffer;
}
}
temp += " ";
CString os;
os.Format("addGroup { %d %d \" %s \"%s} %s",
GroupID, int(MExpr), MExpr -> GetOp() -> Dump(),
temp, LogProp -> DumpCOVE()
);
OutputCOVE.Write(os, os.GetLength());
}
}
// free up memory
//##ModelId=3B0C086603C9
GROUP::~GROUP()
{
if (!ForGlobalEpsPruning) ClassStat[C_GROUP].Delete();
delete LogProp;
delete LowerBd;
M_EXPR * mexpr =FirstLogMExpr;
M_EXPR * next = mexpr;
while( next!=NULL )
{ next = mexpr->GetNextMExpr();
delete mexpr;
mexpr = next;
}
mexpr =FirstPhysMExpr;
next = mexpr;
while( next!=NULL )
{ next = mexpr->GetNextMExpr();
delete mexpr;
mexpr = next;
}
#ifndef IRPROP
for(int i=0;i<Winners.GetSize();i++)
delete Winners[i];
#endif
}
// estimate the number of tables in EQJOIN
//##ModelId=3B0C086701FC
int GROUP::EstimateNumTables(M_EXPR * MExpr)
{
int table_num;
int total=0;
GROUP *Group;
int arity = MExpr->GetArity();
// if the input is EQJOIN, continue to count all the input
for(int i=0; i<arity; i++)
{
Group = Ssp->GetGroup(MExpr->GetInput(i));
if (Group->GetFirstLogMExpr()->GetOp()->GetName().Compare("EQJOIN") == 0)
{
table_num = Group->EstimateNumTables(Group->GetFirstLogMExpr());
}
else table_num=1;
total += table_num;
}
return total;
}
//##ModelId=3B0C08670089
void GROUP::NewMExpr(M_EXPR *MExpr)
{
// link to last mexpr
if(MExpr->GetOp()->is_logical())
{
LastLogMExpr->SetNextMExpr(MExpr);
LastLogMExpr = MExpr;
}
else
{
if(LastPhysMExpr)
LastPhysMExpr->SetNextMExpr(MExpr);
else
FirstPhysMExpr = MExpr;
LastPhysMExpr = MExpr;
}
// if there is a winner found before, count the number of plans
if (count != -1) count++;
if(COVETrace) //New MExpr
{
char buffer[10]; //Holds input group ID
CString temp;
int arity = MExpr -> GetArity();
if(arity){
for(int i = 0; i < arity; i++){
(void)itoa(MExpr -> GetInput(i), buffer, 10);
temp = temp + " "+ buffer;
}
}
temp += " ";
CString os;
os.Format("addExp { %d %d \" %s \"%s} %s",
GroupID, int(MExpr), MExpr -> GetOp() -> Dump(),
temp, LogProp -> DumpCOVE()
);
OutputCOVE.Write(os, os.GetLength());
}
}
//##ModelId=3B0C08670044
void GROUP::set_optimized (bool is_optimized)
{
SET_TRACE Trace(true);
if(is_optimized)
{
PTRACE("group %d is completed", GroupID);
}
State.optimized = is_optimized;
}
//##ModelId=3B0C086700BC
void GROUP::ShrinkSubGroup()
{
for(M_EXPR * MExpr = FirstLogMExpr;
MExpr!=NULL;
MExpr=MExpr->GetNextMExpr())
{
for(int i=0; i< MExpr->GetArity(); i++)
Ssp->ShrinkGroup(MExpr->GetInput(i));
}
}
// Delete a physical MExpr from a group, save memory
//##ModelId=3B0C086700BD
void GROUP::DeletePhysMExpr (M_EXPR * PhysMExpr)
{
M_EXPR * MExpr = FirstPhysMExpr;
M_EXPR *next;
if (MExpr == PhysMExpr)
{
FirstPhysMExpr = MExpr->GetNextMExpr();
// if the MExpr to be deleted is the only one in the group,
// set both First and Last Physical MExpr to be NULL
if (FirstPhysMExpr == NULL)
LastPhysMExpr = NULL;
delete MExpr;
MExpr = NULL;
}
else
{
// search for the MExpr to be deleted in the link list
while (MExpr != NULL)
{
next = MExpr->GetNextMExpr();
// if found, manipulate the pointers and delete the necessary one
if (next == PhysMExpr)
{
MExpr->SetNextMExpr(next->GetNextMExpr());
if (next->GetNextMExpr() == NULL)
LastPhysMExpr = MExpr;
delete next;
next = NULL;
break;
}
MExpr = MExpr->GetNextMExpr();
}
}
}
//##ModelId=3B0C086603D1
CString GROUP::Dump()
{
CString os;
int Size = 0;
CString temp;
M_EXPR* MExpr;
os.Format("%s%d%s\r\n","----- Group ", GroupID , " : -----");
for(MExpr=FirstLogMExpr; MExpr!=NULL; MExpr = MExpr->GetNextMExpr() )
{
os += MExpr->Dump();
os += " ; ";
Size++;
}
for(MExpr=FirstPhysMExpr; MExpr!=NULL; MExpr = MExpr->GetNextMExpr() )
{
os += MExpr->Dump();
os += " ; ";
Size++;
}
temp.Format("\r\n%s%d%s", "----- has " , Size , " MExprs -----\r\n");
os += temp;
//Print Winner's circle
os += "Winners:\r\n" ;
#ifdef IRPROP
os += M_WINNER::mc[GroupID]->Dump();
os += "\r\n";
#else
Size = Winners.GetSize();
PHYS_PROP * PhysProp;
if(!Size) os += "\tNo Winners\r\n";
for(int i = 0; i < Size; i++)
{
PhysProp = Winners[i] -> GetPhysProp();
os += "\t" ;
os += PhysProp -> Dump();
os += ", " ;
os += ( Winners[i]->GetMPlan() ? Winners[i]->GetMPlan()-> Dump() : "NULL Plan");
os += ", " ;
os += (Winners[i]->GetCost() ? Winners[i]->GetCost()->Dump() : "NULL Cost");
os += ", " ;
os += (Winners[i]->GetDone() ? "Done" : "Not done");
os += "\r\n";
}
#endif
temp.Format("LowerBound: %s\r\n", LowerBd->Dump() );
os += temp;
os += "log_prop: ";
os += (*LogProp).Dump();
return os;
}
//##ModelId=3B0C086603D2
void GROUP::FastDump()
{
int Size = 0;
M_EXPR* MExpr;
TRACE_FILE("----- Group %d : -----\r\n", GroupID);
for(MExpr=FirstLogMExpr; MExpr!=NULL; MExpr = MExpr->GetNextMExpr() )
{
TRACE_FILE("%s ; ", MExpr->Dump() );
Size++;
}
for(MExpr=FirstPhysMExpr; MExpr!=NULL; MExpr = MExpr->GetNextMExpr() )
{
TRACE_FILE("%s ; ", MExpr->Dump() );
Size++;
}
TRACE_FILE("\r\n----- has %d MExprs -----\r\n", Size );
//Print Winner's circle
TRACE_FILE("%s", "Winners:\r\n" );
#ifdef IRPROP
TRACE_FILE("\t%s\n", M_WINNER::mc[GroupID]->Dump());
#else
Size = Winners.GetSize();
PHYS_PROP * PhysProp;
if(!Size) TRACE_FILE("%s", "\tNo Winners\r\n" );
for(int i = 0; i < Size; i++)
{
PhysProp = Winners[i] -> GetPhysProp();
TRACE_FILE("\t%s", PhysProp -> Dump() );
TRACE_FILE(", %s", ( Winners[i]->GetMPlan() ? Winners[i]->GetMPlan()-> Dump() : "NULL") );
TRACE_FILE(", %s", (Winners[i]->GetCost() ? Winners[i]->GetCost()->Dump() : "-1") );
TRACE_FILE(", %s\r\n", (Winners[i]->GetDone() ? "Done" : "Not done") );
}
#endif
TRACE_FILE("LowerBound: %s\r\n", LowerBd->Dump() );
TRACE_FILE("log_prop: %s", (*LogProp).Dump() );
}