forked from pingcap/tidb
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathjoin_result_generators.go
396 lines (352 loc) · 14.1 KB
/
join_result_generators.go
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
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
// Copyright 2017 PingCAP, Inc.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// See the License for the specific language governing permissions and
// limitations under the License.
package executor
import (
"github.com/juju/errors"
"github.com/pingcap/tidb/context"
"github.com/pingcap/tidb/expression"
"github.com/pingcap/tidb/plan"
"github.com/pingcap/tidb/types"
)
var (
_ joinResultGenerator = &semiJoinResultGenerator{}
_ joinResultGenerator = &antiSemiJoinResultGenerator{}
_ joinResultGenerator = &leftOuterSemiJoinResultGenerator{}
_ joinResultGenerator = &antiLeftOuterSemiJoinResultGenerator{}
_ joinResultGenerator = &leftOuterJoinResultGenerator{}
_ joinResultGenerator = &rightOuterJoinResultGenerator{}
_ joinResultGenerator = &innerJoinResultGenerator{}
)
// joinResultGenerator is used to generate join results according the join type, see every implementor for detailed information.
type joinResultGenerator interface {
// emitMatchedInners should be called when key in outer row is equal to key in every inner row.
// Reutrn true if outer row can be joined with any input inner row.
emitMatchedInners(outer Row, inners []Row, resultBuffer []Row) ([]Row, bool, error)
// emitUnMatchedOuter should be called when outer row is not matched to any inner row.
emitUnMatchedOuter(outer Row, resultBuffer []Row) []Row
// emitUnMatchedOuters should be called when outer row is not matched to any inner row.
emitUnMatchedOuters(outers []Row, resultBuffer []Row) []Row
}
func newJoinResultGenerator(ctx context.Context, joinType plan.JoinType, outerIsRight bool, defaultInner Row, filter []expression.Expression) joinResultGenerator {
baseGenerator := baseJoinResultGenerator{ctx, filter, defaultInner, outerIsRight}
switch joinType {
case plan.SemiJoin:
return &semiJoinResultGenerator{baseGenerator}
case plan.AntiSemiJoin:
return &antiSemiJoinResultGenerator{baseGenerator}
case plan.LeftOuterSemiJoin:
return &leftOuterSemiJoinResultGenerator{baseGenerator}
case plan.AntiLeftOuterSemiJoin:
return &antiLeftOuterSemiJoinResultGenerator{baseGenerator}
case plan.LeftOuterJoin:
return &leftOuterJoinResultGenerator{baseGenerator}
case plan.RightOuterJoin:
return &rightOuterJoinResultGenerator{baseGenerator}
case plan.InnerJoin:
return &innerJoinResultGenerator{baseGenerator}
}
panic("unsupported join type in func newJoinResultGenerator()")
}
type baseJoinResultGenerator struct {
ctx context.Context
filter []expression.Expression
defaultInner Row
outerIsRight bool
}
// makeJoinRowToBuffer concatenates "lhs" and "rhs" to "buffer" and return that buffer.
// With the help of this function, we can make all of the joined rows to a consecutive
// memory buffer and explore the best cache performance.
func (outputer *baseJoinResultGenerator) makeJoinRowToBuffer(buffer []types.Datum, lhs, rhs Row) []types.Datum {
buffer = append(buffer, lhs...)
buffer = append(buffer, rhs...)
return buffer
}
// growResultBufferIfNecessary grows resultBuffer if necessary.
func (outputer *baseJoinResultGenerator) growResultBufferIfNecessary(resultBuffer []Row, numToAppend int) []Row {
length := len(resultBuffer)
if cap(resultBuffer)-length >= numToAppend {
return resultBuffer
}
newResultBuffer := make([]Row, length, length+numToAppend)
copy(newResultBuffer, resultBuffer)
return newResultBuffer
}
// filterResult filters resultBuffer according to filter.
func (outputer *baseJoinResultGenerator) filterResult(resultBuffer []Row, originLen int) ([]Row, bool, error) {
if outputer.filter == nil {
return resultBuffer, len(resultBuffer) > originLen, nil
}
curLen := originLen
for _, joinedRow := range resultBuffer[originLen:] {
matched, err := expression.EvalBool(outputer.filter, joinedRow, outputer.ctx)
if err != nil {
return nil, false, errors.Trace(err)
}
if matched {
resultBuffer[curLen] = joinedRow
curLen++
}
}
return resultBuffer[:curLen], curLen > originLen, nil
}
type semiJoinResultGenerator struct {
baseJoinResultGenerator
}
// emitMatchedInners implements joinResultGenerator interface.
func (outputer *semiJoinResultGenerator) emitMatchedInners(outer Row, inners []Row, resultBuffer []Row) ([]Row, bool, error) {
if len(inners) == 0 {
return resultBuffer, false, nil
}
if outputer.filter == nil {
return append(resultBuffer, outer), true, nil
}
buffer := make(Row, 0, len(inners[0])+len(outer))
for _, inner := range inners {
if outputer.outerIsRight {
buffer = outputer.makeJoinRowToBuffer(buffer[:0], inner, outer)
} else {
buffer = outputer.makeJoinRowToBuffer(buffer[:0], outer, inner)
}
matched, err := expression.EvalBool(outputer.filter, buffer, outputer.ctx)
if err != nil {
return resultBuffer, false, errors.Trace(err)
}
if matched {
return append(resultBuffer, outer), true, nil
}
}
return resultBuffer, false, nil
}
// emitUnMatchedOuter implements joinResultGenerator interface.
func (outputer *semiJoinResultGenerator) emitUnMatchedOuter(outer Row, resultBuffer []Row) []Row {
return resultBuffer
}
// emitUnMatchedOuters implements joinResultGenerator interface.
func (outputer *semiJoinResultGenerator) emitUnMatchedOuters(outers []Row, resultBuffer []Row) []Row {
return resultBuffer
}
type antiSemiJoinResultGenerator struct {
baseJoinResultGenerator
}
// emitMatchedInners implements joinResultGenerator interface.
func (outputer *antiSemiJoinResultGenerator) emitMatchedInners(outer Row, inners []Row, resultBuffer []Row) (_ []Row, matched bool, err error) {
if len(inners) == 0 {
return resultBuffer, false, nil
}
if outputer.filter == nil {
return resultBuffer, true, nil
}
buffer := make(Row, 0, len(outer)+len(inners[0]))
for _, inner := range inners {
if outputer.outerIsRight {
buffer = outputer.makeJoinRowToBuffer(buffer[:0], inner, outer)
} else {
buffer = outputer.makeJoinRowToBuffer(buffer[:0], outer, inner)
}
matched, err = expression.EvalBool(outputer.filter, buffer, outputer.ctx)
if err != nil {
return resultBuffer, false, errors.Trace(err)
}
if matched {
return resultBuffer, true, nil
}
}
return resultBuffer, false, nil
}
// emitUnMatchedOuter implements joinResultGenerator interface.
func (outputer *antiSemiJoinResultGenerator) emitUnMatchedOuter(outer Row, resultBuffer []Row) []Row {
return append(resultBuffer, outer)
}
// emitUnMatchedOuters implements joinResultGenerator interface.
func (outputer *antiSemiJoinResultGenerator) emitUnMatchedOuters(outers []Row, resultBuffer []Row) []Row {
for _, outer := range outers {
resultBuffer = append(resultBuffer, outer)
}
return resultBuffer
}
type leftOuterSemiJoinResultGenerator struct {
baseJoinResultGenerator
}
// emitMatchedInners implements joinResultGenerator interface.
func (outputer *leftOuterSemiJoinResultGenerator) emitMatchedInners(outer Row, inners []Row, resultBuffer []Row) ([]Row, bool, error) {
if len(inners) == 0 {
return resultBuffer, false, nil
}
if outputer.filter == nil {
joinedRow := append(outer, types.NewDatum(true))
return append(resultBuffer, joinedRow), true, nil
}
buffer := make(Row, 0, len(outer)+len(inners[0]))
for _, inner := range inners {
buffer = outputer.makeJoinRowToBuffer(buffer[:0], outer, inner)
matched, err := expression.EvalBool(outputer.filter, buffer, outputer.ctx)
if err != nil {
return resultBuffer, false, errors.Trace(err)
}
if matched {
buffer = append(buffer[:len(outer)], types.NewDatum(true))
return append(resultBuffer, buffer), true, nil
}
}
return resultBuffer, false, nil
}
// emitUnMatchedOuter implements joinResultGenerator interface.
func (outputer *leftOuterSemiJoinResultGenerator) emitUnMatchedOuter(outer Row, resultBuffer []Row) []Row {
outer = append(outer, types.NewDatum(false))
return append(resultBuffer, outer)
}
// emitUnMatchedOuters implements joinResultGenerator interface.
func (outputer *leftOuterSemiJoinResultGenerator) emitUnMatchedOuters(outers []Row, resultBuffer []Row) []Row {
for _, outer := range outers {
resultBuffer = append(resultBuffer, append(outer, types.NewDatum(false)))
}
return resultBuffer
}
type antiLeftOuterSemiJoinResultGenerator struct {
baseJoinResultGenerator
}
// emitMatchedInners implements joinResultGenerator interface.
func (outputer *antiLeftOuterSemiJoinResultGenerator) emitMatchedInners(outer Row, inners []Row, resultBuffer []Row) ([]Row, bool, error) {
if len(inners) == 0 {
return resultBuffer, false, nil
}
if outputer.filter == nil {
joinedRow := append(outer, types.NewDatum(false))
return append(resultBuffer, joinedRow), true, nil
}
buffer := make(Row, 0, len(outer)+len(inners[0]))
for _, inner := range inners {
buffer = outputer.makeJoinRowToBuffer(buffer[:0], outer, inner)
matched, err := expression.EvalBool(outputer.filter, buffer, outputer.ctx)
if err != nil {
return resultBuffer, false, errors.Trace(err)
}
if matched {
buffer = append(buffer[:len(outer)], types.NewDatum(false))
return append(resultBuffer, buffer), true, nil
}
}
return resultBuffer, false, nil
}
// emitUnMatchedOuter implements joinResultGenerator interface.
func (outputer *antiLeftOuterSemiJoinResultGenerator) emitUnMatchedOuter(outer Row, resultBuffer []Row) []Row {
outer = append(outer, types.NewDatum(true))
return append(resultBuffer, outer)
}
// emitUnMatchedOuters implements joinResultGenerator interface.
func (outputer *antiLeftOuterSemiJoinResultGenerator) emitUnMatchedOuters(outers []Row, resultBuffer []Row) []Row {
for _, outer := range outers {
resultBuffer = append(resultBuffer, append(outer, types.NewDatum(true)))
}
return resultBuffer
}
type leftOuterJoinResultGenerator struct {
baseJoinResultGenerator
}
// emitMatchedInners implements joinResultGenerator interface.
func (outputer *leftOuterJoinResultGenerator) emitMatchedInners(outer Row, inners []Row, resultBuffer []Row) ([]Row, bool, error) {
if len(inners) == 0 {
return resultBuffer, false, nil
}
resultBuffer = outputer.growResultBufferIfNecessary(resultBuffer, len(inners))
originLen := len(resultBuffer)
buffer := make([]types.Datum, 0, len(inners)*(len(outer)+len(inners[0])))
for _, inner := range inners {
buffer = outputer.makeJoinRowToBuffer(buffer[len(buffer):], outer, inner)
resultBuffer = append(resultBuffer, buffer)
}
return outputer.filterResult(resultBuffer, originLen)
}
// emitUnMatchedOuter implements joinResultGenerator interface.
func (outputer *leftOuterJoinResultGenerator) emitUnMatchedOuter(outer Row, resultBuffer []Row) []Row {
return append(resultBuffer, makeJoinRow(outer, outputer.defaultInner))
}
// emitUnMatchedOuters implements joinResultGenerator interface.
func (outputer *leftOuterJoinResultGenerator) emitUnMatchedOuters(outers []Row, resultBuffer []Row) []Row {
if len(outers) == 0 {
return resultBuffer
}
resultBuffer = outputer.growResultBufferIfNecessary(resultBuffer, len(outers))
buffer := make([]types.Datum, 0, len(outers)*(len(outers[0])+len(outputer.defaultInner)))
for _, outer := range outers {
buffer = outputer.makeJoinRowToBuffer(buffer[len(buffer):], outer, outputer.defaultInner)
resultBuffer = append(resultBuffer, buffer)
}
return resultBuffer
}
type rightOuterJoinResultGenerator struct {
baseJoinResultGenerator
}
// emitMatchedInners implements joinResultGenerator interface.
func (outputer *rightOuterJoinResultGenerator) emitMatchedInners(outer Row, inners []Row, resultBuffer []Row) ([]Row, bool, error) {
if len(inners) == 0 {
return resultBuffer, false, nil
}
resultBuffer = outputer.growResultBufferIfNecessary(resultBuffer, len(inners))
originLen := len(resultBuffer)
buffer := make([]types.Datum, 0, len(inners)*(len(outer)+len(inners[0])))
for _, inner := range inners {
buffer = outputer.makeJoinRowToBuffer(buffer[len(buffer):], inner, outer)
resultBuffer = append(resultBuffer, buffer)
}
return outputer.filterResult(resultBuffer, originLen)
}
// emitUnMatchedOuter implements joinResultGenerator interface.
func (outputer *rightOuterJoinResultGenerator) emitUnMatchedOuter(outer Row, resultBuffer []Row) []Row {
return append(resultBuffer, makeJoinRow(outputer.defaultInner, outer))
}
// emitUnMatchedOuters implements joinResultGenerator interface.
func (outputer *rightOuterJoinResultGenerator) emitUnMatchedOuters(outers []Row, resultBuffer []Row) []Row {
if len(outers) == 0 {
return resultBuffer
}
resultBuffer = outputer.growResultBufferIfNecessary(resultBuffer, len(outers))
buffer := make([]types.Datum, 0, len(outers)*(len(outers[0])+len(outputer.defaultInner)))
for _, outer := range outers {
buffer = outputer.makeJoinRowToBuffer(buffer[len(buffer):], outputer.defaultInner, outer)
resultBuffer = append(resultBuffer, buffer)
}
return resultBuffer
}
type innerJoinResultGenerator struct {
baseJoinResultGenerator
}
// emitMatchedInners implements joinResultGenerator interface.
func (outputer *innerJoinResultGenerator) emitMatchedInners(outer Row, inners []Row, resultBuffer []Row) ([]Row, bool, error) {
if len(inners) == 0 {
return resultBuffer, false, nil
}
resultBuffer = outputer.growResultBufferIfNecessary(resultBuffer, len(inners))
originLen := len(resultBuffer)
buffer := make([]types.Datum, 0, (len(outer)+len(inners[0]))*len(inners))
if outputer.outerIsRight {
for _, inner := range inners {
buffer = outputer.makeJoinRowToBuffer(buffer[len(buffer):], inner, outer)
resultBuffer = append(resultBuffer, buffer)
}
} else {
for _, inner := range inners {
buffer = outputer.makeJoinRowToBuffer(buffer[len(buffer):], outer, inner)
resultBuffer = append(resultBuffer, buffer)
}
}
return outputer.filterResult(resultBuffer, originLen)
}
// emitUnMatchedOuter implements joinResultGenerator interface.
func (outputer *innerJoinResultGenerator) emitUnMatchedOuter(_ Row, resultBuffer []Row) []Row {
return resultBuffer
}
// emitUnMatchedOuters implements joinResultGenerator interface.
func (outputer *innerJoinResultGenerator) emitUnMatchedOuters(_ []Row, resultBuffer []Row) []Row {
return resultBuffer
}