File: spj_rqg_hypergraph.result

package info (click to toggle)
mysql-8.0 8.0.43-3
  • links: PTS, VCS
  • area: main
  • in suites: sid
  • size: 1,273,924 kB
  • sloc: cpp: 4,684,605; ansic: 412,450; pascal: 108,398; java: 83,641; perl: 30,221; cs: 27,067; sql: 26,594; sh: 24,181; python: 21,816; yacc: 17,169; php: 11,522; xml: 7,388; javascript: 7,076; makefile: 2,194; lex: 1,075; awk: 670; asm: 520; objc: 183; ruby: 97; lisp: 86
file content (370 lines) | stat: -rw-r--r-- 13,255 bytes parent folder | download
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
Table	Op	Msg_type	Msg_text
test.a	analyze	status	OK
test.b	analyze	status	OK
test.c	analyze	status	OK
test.d	analyze	status	OK
test.e	analyze	status	OK
test.f	analyze	status	OK
test.g	analyze	status	OK
test.h	analyze	status	OK
test.i	analyze	status	OK
test.j	analyze	status	OK
test.k	analyze	status	OK
test.l	analyze	status	OK
test.m	analyze	status	OK
test.n	analyze	status	OK
test.o	analyze	status	OK
test.p	analyze	status	OK
test.q	analyze	status	OK
test.r	analyze	status	OK
test.s	analyze	status	OK
test.t	analyze	status	OK
test.u	analyze	status	OK
test.v	analyze	status	OK
test.w	analyze	status	OK
test.x	analyze	status	OK
test.y	analyze	status	OK
test.z	analyze	status	OK
set optimizer_switch='hypergraph_optimizer=on';
explain format=tree SELECT
table1.pk, table2.pk
FROM m AS table1
LEFT JOIN r AS table2 ON table2.col_int IN (4)
WHERE table1.pk = ANY (
SELECT table2s.col_int AS field2
FROM r AS table1s
LEFT JOIN p AS table2s ON table1s.col_int_unique = table2s.col_int_key
GROUP BY field2
);
EXPLAIN
-> Nested loop inner join
    -> Remove duplicates from input grouped on table2s.col_int
        -> Sort: table2s.col_int
            -> Nested loop inner join
                -> Table scan on table1s, activating pushed join of 2 tables
                -> Index lookup on table2s using col_int_key (col_int_key=table1s.col_int_unique), child of table1s in pushed join
    -> Left hash join (no condition)
        -> Single-row index lookup on table1 using PRIMARY (pk=table2s.col_int)
        -> Hash
            -> Index range scan on table2 using PRIMARY over (col_int = 4)

Warnings:
Note	1003	Can't push table 'table1' as child of 'table1s', it is in a sorted-branch which can't be referred.
Note	1003	Can't push table 'table2' as child, access type 'Range-scan' not implemented
SELECT
table1.pk, table2.pk
FROM m AS table1
LEFT JOIN r AS table2 ON table2.col_int IN (4)
WHERE table1.pk = ANY (
SELECT table2s.col_int AS field2
FROM r AS table1s
LEFT JOIN p AS table2s ON table1s.col_int_unique = table2s.col_int_key
GROUP BY field2
);
pk	pk
1	NULL
2	NULL
3	NULL
explain format=tree SELECT
table1.pk, table2.pk, table3.pk
FROM t AS table1
LEFT JOIN g AS table2 ON table1.pk = table2.col_int
LEFT JOIN z AS table3 ON table2.col_int_key = table3.col_int_key
WHERE CHAR_LENGTH(table2.col_varchar_10_unique) IN (
SELECT STRAIGHT_JOIN
table3s.col_int AS field3
FROM m AS table1s JOIN (
p AS table2s JOIN l AS table3s ON table2s.pk = table3s.pk
) ON table1s.col_int_unique = table2s.col_int_unique
);
EXPLAIN
-> Inner hash join (table1.pk = table2.col_int)
    -> Nested loop left join
        -> Filter: <in_optimizer>(char_length(table2.col_varchar_10_unique),char_length(table2.col_varchar_10_unique) in (select #2))
            -> Table scan on table2, activating pushed join of 2 tables
            -> Select #2 (subquery in condition; run only once)
                -> Filter: ((char_length(table2.col_varchar_10_unique) = `<materialized_subquery>`.field3))
                    -> Limit: 1 row(s)
                        -> Index lookup on <materialized_subquery> using <auto_distinct_key> (field3=char_length(table2.col_varchar_10_unique))
                            -> Materialize with deduplication
                                -> Inner hash join (table1s.col_int_unique = table2s.col_int_unique)
                                    -> Table scan on table1s
                                    -> Hash
                                        -> Nested loop inner join
                                            -> Table scan on table3s, activating pushed join of 2 tables
                                            -> Single-row index lookup on table2s using PRIMARY (pk=table3s.pk), child of table3s in pushed join
        -> Index lookup on table3 using col_int_key (col_int_key=table2.col_int_key), child of table2 in pushed join
    -> Hash
        -> Table scan on table1

Warnings:
Note	1003	Can't push table 'table2' as child, 'type' must be a 'ref' access
Note	1003	Can't push table 'table3' as child of 'table1', it is in a hash-bucket-branch which can't be referred.
Note	1003	Can't push table 'table1s' as child, 'type' must be a 'ref' access
SELECT
table1.pk, table2.pk, table3.pk
FROM t AS table1
LEFT JOIN g AS table2 ON table1.pk = table2.col_int
LEFT JOIN z AS table3 ON table2.col_int_key = table3.col_int_key
WHERE CHAR_LENGTH(table2.col_varchar_10_unique) IN (
SELECT STRAIGHT_JOIN
table3s.col_int AS field3
FROM m AS table1s JOIN (
p AS table2s JOIN l AS table3s ON table2s.pk = table3s.pk
) ON table1s.col_int_unique = table2s.col_int_unique
);
pk	pk	pk
explain format=tree SELECT
table1.pk
FROM y AS table1
WHERE table1.col_int IN (
SELECT STRAIGHT_JOIN
table2s.col_int_unique
FROM r AS table1s
JOIN z AS table2s ON table1s.pk = table2s.col_int_key
);
EXPLAIN
-> Filter: <in_optimizer>(table1.col_int,table1.col_int in (select #2))
    -> Table scan on table1
    -> Select #2 (subquery in condition; run only once)
        -> Filter: ((table1.col_int = `<materialized_subquery>`.col_int_unique))
            -> Limit: 1 row(s)
                -> Index lookup on <materialized_subquery> using <auto_distinct_key> (col_int_unique=table1.col_int)
                    -> Materialize with deduplication
                        -> Nested loop inner join
                            -> Table scan on table1s, activating pushed join of 2 tables
                            -> Index lookup on table2s using col_int_key (col_int_key=table1s.pk), child of table1s in pushed join

SELECT
table1.pk
FROM y AS table1
WHERE table1.col_int IN (
SELECT STRAIGHT_JOIN
table2s.col_int_unique
FROM r AS table1s
JOIN z AS table2s ON table1s.pk = table2s.col_int_key
);
pk
11
13
14
15
16
19
2
20
23
24
25
26
27
30
33
4
explain format=tree SELECT
table1.pk, table2.pk
FROM c AS table1
JOIN c AS table2 ON table1.col_int = table2.col_int_key
WHERE EXISTS (
SELECT * FROM d
);
EXPLAIN
-> Nested loop inner join
    -> Limit: 1 row(s)
        -> Table scan on d
    -> Nested loop inner join
        -> Table scan on table2, activating pushed join of 2 tables
        -> Index lookup on table1 using PRIMARY (col_int=table2.col_int_key), child of table2 in pushed join

Warnings:
Note	1003	Can't push table 'table2' as child, 'type' must be a 'ref' access
Note	1003	Can't push table 'table1' as child of 'd', column 'table2.col_int_key' refers a table which was not pushed
SELECT
table1.pk, table2.pk
FROM c AS table1
JOIN c AS table2 ON table1.col_int = table2.col_int_key
WHERE EXISTS (
SELECT * FROM d
);
pk	pk
1	3
2	1
2	2
2	5
3	3
4	3
5	1
5	2
5	5
explain format=tree SELECT
table1.pk, table2.pk, table3.pk, table4.pk
FROM b AS table1
LEFT JOIN s AS table2
LEFT JOIN x AS table3 ON table2.col_int = table3.col_int
ON table1.col_int_key = table2.col_int_key AND
table1.col_int_unique = table2.pk
LEFT JOIN e AS table4 ON table2.col_int_key = table4.pk;
EXPLAIN
-> Left hash join (table2.col_int_key = table4.pk)
    -> Nested loop left join
        -> Nested loop left join
            -> Table scan on table1, activating pushed join of 3 tables
            -> Single-row index lookup on table2 using PRIMARY (pk=table1.col_int_unique), child of table1 in pushed join, with pushed condition: (table1.col_int_key = table2.col_int_key)
        -> Index lookup on table3 using PRIMARY (col_int=table2.col_int), child of table2 in pushed join
    -> Hash
        -> Table scan on table4

Warnings:
Note	1003	Can't push table 'table4' as child, 'type' must be a 'ref' access
SELECT
table1.pk, table2.pk, table3.pk, table4.pk
FROM b AS table1
LEFT JOIN s AS table2
LEFT JOIN x AS table3 ON table2.col_int = table3.col_int
ON table1.col_int_key = table2.col_int_key AND
table1.col_int_unique = table2.pk
LEFT JOIN e AS table4 ON table2.col_int_key = table4.pk;
pk	pk	pk	pk
1	NULL	NULL	NULL
explain format=tree SELECT DISTINCT
table1.col_char_16_key AS field1
FROM m AS table1
JOIN k AS table2 ON table1.col_int_key = table2.col_int AND
table1.col_int_unique = table2.col_int_unique
WHERE table2.col_int_key <> 5;
EXPLAIN
-> Sort with duplicate removal: table1.col_char_16_key
    -> Inner hash join (table1.col_int_key = table2.col_int), (table1.col_int_unique = table2.col_int_unique)
        -> Index scan on table1 using col_char_16_key
        -> Hash
            -> Index range scan on table2 using col_int_key over (NULL < col_int_key < 5) OR (5 < col_int_key)

Warnings:
Note	1003	Can't push table 'table1' as child, can't provide rows in index order
SELECT DISTINCT
table1.col_char_16_key AS field1
FROM m AS table1
JOIN k AS table2 ON table1.col_int_key = table2.col_int AND
table1.col_int_unique = table2.col_int_unique
WHERE table2.col_int_key <> 5;
field1
will
explain format=tree SELECT DISTINCT
'auq' AS field1, table1.col_varchar_10_unique AS field2
FROM j AS table1
LEFT JOIN r AS table2 ON table1.pk = table2.col_int_key
WHERE table1.col_int BETWEEN 6 AND 7 OR table2.pk <= 7;
EXPLAIN
-> Remove duplicates from input grouped on table1.col_varchar_10_unique
    -> Filter: ((table1.col_int between 6 and 7) or (table2.pk <= 7))
        -> Nested loop left join
            -> Index scan on table1 using col_varchar_10_unique, activating pushed join of 2 tables
            -> Index lookup on table2 using col_int_key (col_int_key=table1.pk), child of table1 in pushed join

SELECT DISTINCT
'auq' AS field1, table1.col_varchar_10_unique AS field2
FROM j AS table1
LEFT JOIN r AS table2 ON table1.pk = table2.col_int_key
WHERE table1.col_int BETWEEN 6 AND 7 OR table2.pk <= 7;
field1	field2
auq	qqjwasfkve
auq	tfobocgpft
auq	this
explain format=tree SELECT
table1.col_int_key AS field1, table2.pk AS field2
FROM h AS table1
LEFT OUTER JOIN w AS table2 ON  table1.col_int_key =  table2.col_int_key
WHERE #table1.col_int = 8 AND
EXISTS (
SELECT *
#table1s.col_int_key AS field3, table1s.col_int_unique AS field4, table1s.pk AS field5
FROM a AS table1s
WHERE table1.pk = table1s.col_int_key)
GROUP BY field1, field2;
EXPLAIN
-> Group (no aggregates)
    -> Sort: table1.col_int_key, table2.pk
        -> Nested loop left join
            -> Nested loop inner join
                -> Remove duplicates from input grouped on table1s.col_int_key
                    -> Index scan on table1s using col_int_key, activating pushed join of 2 tables
                -> Single-row index lookup on table1 using PRIMARY (pk=table1s.col_int_key), child of table1s in pushed join
            -> Index lookup on table2 using col_int_key (col_int_key=table1.col_int_key)

Warnings:
Note	1276	Field or reference 'test.table1.pk' of SELECT #2 was resolved in SELECT #1
Note	1003	Can't push table 'table2' as scan-child of 'table1s', depends on tables being 'skip-read'
SELECT
table1.col_int_key AS field1, table2.pk AS field2
FROM h AS table1
LEFT OUTER JOIN w AS table2 ON  table1.col_int_key =  table2.col_int_key
WHERE #table1.col_int = 8 AND
EXISTS (
SELECT *
#table1s.col_int_key AS field3, table1s.col_int_unique AS field4, table1s.pk AS field5
FROM a AS table1s
WHERE table1.pk = table1s.col_int_key)
GROUP BY field1, field2;
field1	field2
explain format=tree SELECT
table1.col_int_unique
FROM q AS table1
JOIN j AS table2 ON table1.pk = table2.col_int_unique
WHERE EXISTS (
SELECT
table1s.col_int_unique
FROM s AS table1s
JOIN p AS table2s ON table1s.col_int_key = table2s.col_int_key
WHERE table1s.col_int_unique = table1.col_int_unique
);
EXPLAIN
-> Hash semijoin (table1.col_int_unique = table1s.col_int_unique)
    -> Nested loop inner join
        -> Table scan on table2, activating pushed join of 2 tables
        -> Single-row index lookup on table1 using PRIMARY (pk=table2.col_int_unique), child of table2 in pushed join
    -> Hash
        -> Nested loop inner join
            -> Table scan on table2s, activating pushed join of 2 tables
            -> Index lookup on table1s using ix2 (col_int_key=table2s.col_int_key), child of table2s in pushed join

Warnings:
Note	1276	Field or reference 'test.table1.col_int_unique' of SELECT #2 was resolved in SELECT #1
Note	1003	Can't push table 'table2s' as child, 'type' must be a 'ref' access
Note	1003	Can't push table 'table1s' as child of 'table2', it is in a hash-probe-branch which can't be referred.
SELECT
table1.col_int_unique
FROM q AS table1
JOIN j AS table2 ON table1.pk = table2.col_int_unique
WHERE EXISTS (
SELECT
table1s.col_int_unique
FROM s AS table1s
JOIN p AS table2s ON table1s.col_int_key = table2s.col_int_key
WHERE table1s.col_int_unique = table1.col_int_unique
);
col_int_unique
0
11
2
4
9
explain format=tree SELECT
table1.pk, table2.pk
FROM i AS table1
JOIN d AS table2 ON table1.pk = table2.col_int
WHERE table1.col_int_key BETWEEN 5 AND 5+4;
EXPLAIN
-> Nested loop inner join
    -> Table scan on table2
    -> Index range scan on table1 using col_int_key over (5 <= col_int_key <= 9), with pushed condition: ((table1.col_int_key between 5 and <cache>((5 + 4))) and (table1.pk = table2.col_int))

Warnings:
Note	1003	Can't push table 'table1' as child, access type 'Range-scan' not implemented
SELECT
table1.pk, table2.pk
FROM i AS table1
JOIN d AS table2 ON table1.pk = table2.col_int
WHERE table1.col_int_key BETWEEN 5 AND 5+4;
pk	pk
set optimizer_switch='hypergraph_optimizer=default';
DROP TABLE a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,u,v,w,x,y,z;