mirror of
https://github.com/MariaDB/server.git
synced 2025-01-27 01:04:19 +01:00
b6215b9b20
Before this patch, when calculating the cost of fetching and using a
row/key from the engine, we took into account the cost of finding a
row or key from the engine, but did not consistently take into account
index only accessed, clustered key or covered keys for all access
paths.
The cost of the WHERE clause (TIME_FOR_COMPARE) was not consistently
considered in best_access_path(). TIME_FOR_COMPARE was used in
calculation in other places, like greedy_search(), but was in some
cases (like scans) done an a different number of rows than was
accessed.
The cost calculation of row and index scans didn't take into account
the number of rows that where accessed, only the number of accepted
rows.
When using a filter, the cost of index_only_reads and cost of
accessing and disregarding 'filtered rows' where not taken into
account, which made filters cost less than there actually where.
To remedy the above, the following key & row fetch related costs
has been added:
- The cost of fetching and using a row is now split into different costs:
- key + Row fetch cost (as before) but multiplied with the variable
'optimizer_cache_cost' (default to 0.5). This allows the user to
tell the optimizer the likehood of finding the key and row in the
engine cache.
- ROW_COPY_COST, The cost copying a row from the engine to the
sql layer or creating a row from the join_cache to the record
buffer. Mostly affects table scan costs.
- ROW_LOOKUP_COST, the cost of fetching a row by rowid.
- KEY_COPY_COST the cost of finding the next key and copying it from
the engine to the SQL layer. This is used when we calculate the cost
index only reads. It makes index scans more expensive than before if
they cover a lot of rows. (main.index_merge_myisam)
- KEY_LOOKUP_COST, the cost of finding the first key in a range.
This replaces the old define IDX_LOOKUP_COST, but with a higher cost.
- KEY_NEXT_FIND_COST, the cost of finding the next key (and rowid).
when doing a index scan and comparing the rowid to the filter.
Before this cost was assumed to be 0.
All of the above constants/variables are now tuned to be somewhat in
proportion of executing complexity to each other. There is tuning
need for these in the future, but that can wait until the above are
made user variables as that will make tuning much easier.
To make the usage of the above easy, there are new (not virtual)
cost calclation functions in handler:
- ha_read_time(), like read_time(), but take optimizer_cache_cost into
account.
- ha_read_and_copy_time(), like ha_read_time() but take into account
ROW_COPY_TIME
- ha_read_and_compare_time(), like ha_read_and_copy_time() but take
TIME_FOR_COMPARE into account.
- ha_rnd_pos_time(). Read row with row id, taking ROW_COPY_COST
into account. This is used with filesort where we don't need
to execute the WHERE clause again.
- ha_keyread_time(), like keyread_time() but take
optimizer_cache_cost into account.
- ha_keyread_and_copy_time(), like ha_keyread_time(), but add
KEY_COPY_COST.
- ha_key_scan_time(), like key_scan_time() but take
optimizer_cache_cost nto account.
- ha_key_scan_and_compare_time(), like ha_key_scan_time(), but add
KEY_COPY_COST & TIME_FOR_COMPARE.
I also added some setup costs for doing different types of scans and
creating temporary tables (on disk and in memory). This encourages
the optimizer to not use these for simple 'a few row' lookups if
there are adequate key lookup strategies.
- TABLE_SCAN_SETUP_COST, cost of starting a table scan.
- INDEX_SCAN_SETUP_COST, cost of starting an index scan.
- HEAP_TEMPTABLE_CREATE_COST, cost of creating in memory
temporary table.
- DISK_TEMPTABLE_CREATE_COST, cost of creating an on disk temporary
table.
When calculating cost of fetching ranges, we had a cost of
IDX_LOOKUP_COST (0.125) for doing a key div for a new range. This is
now replaced with 'io_cost * KEY_LOOKUP_COST (1.0) *
optimizer_cache_cost', which matches the cost we use for 'ref' and
other key lookups. The effect is that the cost is now a bit higher
when we have many ranges for a key.
Allmost all calculation with TIME_FOR_COMPARE is now done in
best_access_path(). 'JOIN::read_time' now includes the full
cost for finding the rows in the table.
In the result files, many of the changes are now again close to what
they where before the "Update cost for hash and cached joins" commit,
as that commit didn't fix the filter cost (too complex to do
everything in one commit).
The above changes showed a lot of a lot of inconsistencies in
optimizer cost calculation. The main objective with the other changes
was to do calculation as similar (and accurate) as possible and to make
different plans more comparable.
Detailed list of changes:
- Calculate index_only_cost consistently and correctly for all scan
and ref accesses. The row fetch_cost and index_only_cost now
takes into account clustered keys, covered keys and index
only accesses.
- cost_for_index_read now returns both full cost and index_only_cost
- Fixed cost calculation of get_sweep_read_cost() to match other
similar costs. This is bases on the assumption that data is more
often stored on SSD than a hard disk.
- Replaced constant 2.0 with new define TABLE_SCAN_SETUP_COST.
- Some scan cost estimates did not take into account
TIME_FOR_COMPARE. Now all scan costs takes this into
account. (main.show_explain)
- Added session variable optimizer_cache_hit_ratio (default 50%). By
adjusting this on can reduce or increase the cost of index or direct
record lookups. The effect of the default is that key lookups is now
a bit cheaper than before. See usage of 'optimizer_cache_cost' in
handler.h.
- JOIN_TAB::scan_time() did not take into account index only scans,
which produced a wrong cost when index scan was used. Changed
JOIN_TAB:::scan_time() to take into consideration clustered and
covered keys. The values are now cached and we only have to call
this function once. Other calls are changed to use the cached
values. Function renamed to JOIN_TAB::estimate_scan_time().
- Fixed that most index cost calculations are done the same way and
more close to 'range' calculations. The cost is now lower than
before for small data sets and higher for large data sets as we take
into account how many keys are read (main.opt_trace_selectivity,
main.limit_rows_examined).
- Ensured that index_scan_cost() ==
range(scan_of_all_rows_in_table_using_one_range) +
MULTI_RANGE_READ_INFO_CONST. One effect of this is that if there
is choice of doing a full index scan and a range-index scan over
almost the whole table then index scan will be preferred (no
range-read setup cost). (innodb.innodb, main.show_explain,
main.range)
- Fixed the EQ_REF and REF takes into account clustered and covered
keys. This changes some plans to use covered or clustered indexes
as these are much cheaper. (main.subselect_mat_cost,
main.state_tables_innodb, main.limit_rows_examined)
- Rowid filter setup cost and filter compare cost now takes into
account fetching and checking the rowid (KEY_NEXT_FIND_COST).
(main.partition_pruning heap.heap_btree main.log_state)
- Added KEY_NEXT_FIND_COST to
Range_rowid_filter_cost_info::lookup_cost to account of the time
to find and check the next key value against the container
- Introduced ha_keyread_time(rows) that takes into account finding
the next row and copying the key value to 'record'
(KEY_COPY_COST).
- Introduced ha_key_scan_time() for calculating an index scan over
all rows.
- Added IDX_LOOKUP_COST to keyread_time() as a startup cost.
- Added index_only_fetch_cost() as a convenience function to
OPT_RANGE.
- keyread_time() cost is slightly reduced to prefer shorter keys.
(main.index_merge_myisam)
- All of the above caused some index_merge combinations to be
rejected because of cost (main.index_intersect). In some cases
'ref' where replaced with index_merge because of the low
cost calculation of get_sweep_read_cost().
- Some index usage moved from PRIMARY to a covering index.
(main.subselect_innodb)
- Changed cost calculation of filter to take KEY_LOOKUP_COST and
TIME_FOR_COMPARE into account. See sql_select.cc::apply_filter().
filter parameters and costs are now written to optimizer_trace.
- Don't use matchings_records_in_range() to try to estimate the number
of filtered rows for ranges. The reason is that we want to ensure
that 'range' is calculated similar to 'ref'. There is also more work
needed to calculate the selectivity when using ranges and ranges and
filtering. This causes filtering column in EXPLAIN EXTENDED to be
100.00 for some cases where range cannot use filtering.
(main.rowid_filter)
- Introduced ha_scan_time() that takes into account the CPU cost of
finding the next row and copying the row from the engine to
'record'. This causes costs of table scan to slightly increase and
some test to changed their plan from ALL to RANGE or ALL to ref.
(innodb.innodb_mysql, main.select_pkeycache)
In a few cases where scan time of very small tables have lower cost
than a ref or range, things changed from ref/range to ALL.
(main.myisam, main.func_group, main.limit_rows_examined,
main.subselect2)
- Introduced ha_scan_and_compare_time() which is like ha_scan_time()
but also adds the cost of the where clause (TIME_FOR_COMPARE).
- Added small cost for creating temporary table for
materialization. This causes some very small tables to use scan
instead of materialization.
- Added checking of the WHERE clause (TIME_FOR_COMPARE) of the
accepted rows to ROR costs in get_best_ror_intersect()
- Removed '- 0.001' from 'join->best_read' and optimize_straight_join()
to ensure that the 'Last_query_cost' status variable contains the
same value as the one that was calculated by the optimizer.
- Take avg_io_cost() into account in handler::keyread_time() and
handler::read_time(). This should have no effect as it's 1.0 by
default, except for heap that overrides these functions.
- Some 'ref_or_null' accesses changed to 'range' because of cost
adjustments (main.order_by)
- Added scan type "scan_with_join_cache" for optimizer_trace. This is
just to show in the trace what kind of scan was used.
- When using 'scan_with_join_cache' take into account number of
preceding tables (as have to restore all fields for all previous
table combination when checking the where clause)
The new cost added is:
(row_combinations * ROW_COPY_COST * number_of_cached_tables).
This increases the cost of join buffering in proportion of the
number of tables in the join buffer. One effect is that full scans
are now done earlier as the cost is then smaller.
(main.join_outer_innodb, main.greedy_optimizer)
- Removed the usage of 'worst_seeks' in cost_for_index_read as it
caused wrong plans to be created; It prefered JT_EQ_REF even if it
would be much more expensive than a full table scan. A related
issue was that worst_seeks only applied to full lookup, not to
clustered or index only lookups, which is not consistent. This
caused some plans to use index scan instead of eq_ref (main.union)
- Changed federated block size from 4096 to 1500, which is the
typical size of an IO packet.
- Added costs for reading rows to Federated. Needed as there is no
caching of rows in the federated engine.
- Added ha_innobase::rnd_pos_time() cost function.
- A lot of extra things added to optimizer trace
- More costs, especially for materialization and index_merge.
- Make lables more uniform
- Fixed a lot of minor bugs
- Added 'trace_started()' around a lot of trace blocks.
- When calculating ORDER BY with LIMIT cost for using an index
the cost did not take into account the number of row retrivals
that has to be done or the cost of comparing the rows with the
WHERE clause. The cost calculated would be just a fraction of
the real cost. Now we calculate the cost as we do for ranges
and 'ref'.
- 'Using index for group-by' is used a bit more than before as
now take into account the WHERE clause cost when comparing
with 'ref' and prefer the method with fewer row combinations.
(main.group_min_max).
Bugs fixed:
- Fixed that we don't calculate TIME_FOR_COMPARE twice for some plans,
like in optimize_straight_join() and greedy_search()
- Fixed bug in save_explain_data where we could test for the wrong
index when displaying 'Using index'. This caused some old plans to
show 'Using index'. (main.subselect_innodb, main.subselect2)
- Fixed bug in get_best_ror_intersect() where 'min_cost' was not
updated, and the cost we compared with was not the one that was
used.
- Fixed very wrong cost calculation for priority queues in
check_if_pq_applicable(). (main.order_by now correctly uses priority
queue)
- When calculating cost of EQ_REF or REF, we added the cost of
comparing the WHERE clause with the found rows, not all row
combinations. This made ref and eq_ref to be regarded way to cheap
compared to other access methods.
- FORCE INDEX cost calculation didn't take into account clustered or
covered indexes.
- JT_EQ_REF cost was estimated as avg_io_cost(), which is half the
cost of a JT_REF key. This may be true for InnoDB primary key, but
not for other unique keys or other engines. Now we use handler
function to calculate the cost, which allows us to handle
consistently clustered, covered keys and not covered keys.
- ha_start_keyread() didn't call extra_opt() if keyread was already
enabled but still changed the 'keyread' variable (which is wrong).
Fixed by not doing anything if keyread is already enabled.
- multi_range_read_info_cost() didn't take into account io_cost when
calculating the cost of ranges.
- fix_semijoin_strategies_for_picked_join_order() used the wrong
record_count when calling best_access_path() for SJ_OPT_FIRST_MATCH
and SJ_OPT_LOOSE_SCAN.
- Hash joins didn't provide correct best_cost to the upper level, which
means that the cost for hash_joins more expensive than calculated
in best_access_path (a difference of 10x * TIME_OF_COMPARE).
This is fixed in the new code thanks to that we now include
TIME_OF_COMPARE cost in 'read_time'.
Other things:
- Added some 'if (thd->trace_started())' to speed up code
- Removed not used function Cost_estimate::is_zero()
- Simplified testing of HA_POS_ERROR in get_best_ror_intersect().
(No cost changes)
- Moved ha_start_keyread() from join_read_const_table() to join_read_const()
to enable keyread for all types of JT_CONST tables.
- Made a few very short functions inline in handler.h
Notes:
- In main.rowid_filter the join order of order and lineitem is swapped.
This is because the cost of doing a range fetch of lineitem(98 rows) is
almost as big as the whole join of order,lineitem. The filtering will
also ensure that we only have to do very small key fetches of the rows
in lineitem.
- main.index_merge_myisam had a few changes where we are now using
less keys for index_merge. This is because index scans are now more
expensive than before.
- handler->optimizer_cache_cost is updated in ha_external_lock().
This ensures that it is up to date per statements.
Not an optimal solution (for locked tables), but should be ok for now.
- 'DELETE FROM t1 WHERE t1.a > 0 ORDER BY t1.a' does not take cost of
filesort into consideration when table scan is chosen.
(main.myisam_explain_non_select_all)
- perfschema.table_aggregate_global_* has changed because an update
on a table with 1 row will now use table scan instead of key lookup.
TODO in upcomming commits:
- Fix selectivity calculation for ranges with and without filtering and
when there is a ref access but scan is chosen.
For this we have to store the lowest known value for
'accepted_records' in the OPT_RANGE structure.
- Change that records_read does not include filtered rows.
- test_if_cheaper_ordering() needs to be updated to properly calculate
costs. This will fix tests like main.order_by_innodb,
main.single_delete_update
- Extend get_range_limit_read_cost() to take into considering
cost_for_index_read() if there where no quick keys. This will reduce
the computed cost for ORDER BY with LIMIT in some cases.
(main.innodb_ext_key)
- Fix that we take into account selectivity when counting the number
of rows we have to read when considering using a index table scan to
resolve ORDER BY.
- Add new calculation for rnd_pos_time() where we take into account the
benefit of reading multiple rows from the same page.
1461 lines
40 KiB
Text
1461 lines
40 KiB
Text
|
|
--disable_warnings
|
|
DROP TABLE IF EXISTS t0,t1,t2,t3,t4,t5,t6,t7,t8,t9;
|
|
--enable_warnings
|
|
|
|
SET @save_optimizer_switch=@@optimizer_switch;
|
|
SET optimizer_switch=ifnull(@optimizer_switch_for_join_nested_test,'outer_join_with_cache=off');
|
|
if (`select @join_cache_level_for_join_nested_test is null`)
|
|
{
|
|
set join_cache_level=1;
|
|
}
|
|
if (`select @join_cache_level_for_join_nested_test is not null`)
|
|
{
|
|
set join_cache_level=@join_cache_level_for_join_nested_test;
|
|
}
|
|
|
|
|
|
CREATE TABLE t0 (a int, b int, c int);
|
|
CREATE TABLE t1 (a int, b int, c int);
|
|
CREATE TABLE t2 (a int, b int, c int);
|
|
CREATE TABLE t3 (a int, b int, c int);
|
|
CREATE TABLE t4 (a int, b int, c int);
|
|
CREATE TABLE t5 (a int, b int, c int);
|
|
CREATE TABLE t6 (a int, b int, c int);
|
|
CREATE TABLE t7 (a int, b int, c int);
|
|
CREATE TABLE t8 (a int, b int, c int);
|
|
CREATE TABLE t9 (a int, b int, c int);
|
|
|
|
INSERT INTO t0 VALUES (1,1,0), (1,2,0), (2,2,0);
|
|
INSERT INTO t1 VALUES (1,3,0), (2,2,0), (3,2,0);
|
|
INSERT INTO t2 VALUES (3,3,0), (4,2,0), (5,3,0);
|
|
INSERT INTO t3 VALUES (1,2,0), (2,2,0);
|
|
INSERT INTO t4 VALUES (3,2,0), (4,2,0);
|
|
INSERT INTO t5 VALUES (3,1,0), (2,2,0), (3,3,0);
|
|
INSERT INTO t6 VALUES (3,2,0), (6,2,0), (6,1,0);
|
|
INSERT INTO t7 VALUES (1,1,0), (2,2,0);
|
|
INSERT INTO t8 VALUES (0,2,0), (1,2,0);
|
|
INSERT INTO t9 VALUES (1,1,0), (1,2,0), (3,3,0);
|
|
|
|
|
|
SELECT t2.a,t2.b
|
|
FROM t2;
|
|
|
|
SELECT t3.a,t3.b
|
|
FROM t3;
|
|
|
|
SELECT t4.a,t4.b
|
|
FROM t4;
|
|
|
|
SELECT t3.a,t3.b,t4.a,t4.b
|
|
FROM t3,t4;
|
|
|
|
SELECT t2.a,t2.b,t3.a,t3.b,t4.a,t4.b
|
|
FROM t2
|
|
LEFT JOIN
|
|
(t3, t4)
|
|
ON t2.b=t4.b;
|
|
|
|
SELECT t2.a,t2.b,t3.a,t3.b,t4.a,t4.b
|
|
FROM t2
|
|
LEFT JOIN
|
|
(t3, t4)
|
|
ON t3.a=1 AND t2.b=t4.b;
|
|
|
|
EXPLAIN EXTENDED
|
|
SELECT t2.a,t2.b,t3.a,t3.b,t4.a,t4.b
|
|
FROM t2
|
|
LEFT JOIN
|
|
(t3, t4)
|
|
ON t2.b=t4.b
|
|
WHERE t3.a=1 OR t3.c IS NULL;
|
|
|
|
SELECT t2.a,t2.b,t3.a,t3.b,t4.a,t4.b
|
|
FROM t2
|
|
LEFT JOIN
|
|
(t3, t4)
|
|
ON t2.b=t4.b
|
|
WHERE t3.a=1 OR t3.c IS NULL;
|
|
|
|
SELECT t2.a,t2.b,t3.a,t3.b,t4.a,t4.b
|
|
FROM t2
|
|
LEFT JOIN
|
|
(t3, t4)
|
|
ON t2.b=t4.b
|
|
WHERE t3.a>1 OR t3.c IS NULL;
|
|
|
|
SELECT t5.a,t5.b
|
|
FROM t5;
|
|
|
|
SELECT t3.a,t3.b,t4.a,t4.b,t5.a,t5.b
|
|
FROM t3,t4,t5;
|
|
|
|
SELECT t2.a,t2.b,t3.a,t3.b,t4.a,t4.b,t5.a,t5.b
|
|
FROM t2
|
|
LEFT JOIN
|
|
(t3, t4, t5)
|
|
ON t2.b=t4.b;
|
|
|
|
EXPLAIN EXTENDED
|
|
SELECT t2.a,t2.b,t3.a,t3.b,t4.a,t4.b,t5.a,t5.b
|
|
FROM t2
|
|
LEFT JOIN
|
|
(t3, t4, t5)
|
|
ON t2.b=t4.b
|
|
WHERE t3.a>1 OR t3.c IS NULL;
|
|
|
|
SELECT t2.a,t2.b,t3.a,t3.b,t4.a,t4.b,t5.a,t5.b
|
|
FROM t2
|
|
LEFT JOIN
|
|
(t3, t4, t5)
|
|
ON t2.b=t4.b
|
|
WHERE t3.a>1 OR t3.c IS NULL;
|
|
|
|
EXPLAIN EXTENDED
|
|
SELECT t2.a,t2.b,t3.a,t3.b,t4.a,t4.b,t5.a,t5.b
|
|
FROM t2
|
|
LEFT JOIN
|
|
(t3, t4, t5)
|
|
ON t2.b=t4.b
|
|
WHERE (t3.a>1 OR t3.c IS NULL) AND
|
|
(t5.a<3 OR t5.c IS NULL);
|
|
|
|
SELECT t2.a,t2.b,t3.a,t3.b,t4.a,t4.b,t5.a,t5.b
|
|
FROM t2
|
|
LEFT JOIN
|
|
(t3, t4, t5)
|
|
ON t2.b=t4.b
|
|
WHERE (t3.a>1 OR t3.c IS NULL) AND
|
|
(t5.a<3 OR t5.c IS NULL);
|
|
|
|
SELECT t6.a,t6.b
|
|
FROM t6;
|
|
|
|
SELECT t7.a,t7.b
|
|
FROM t7;
|
|
|
|
SELECT t6.a,t6.b,t7.a,t7.b
|
|
FROM t6,t7;
|
|
|
|
SELECT t8.a,t8.b
|
|
FROM t8;
|
|
|
|
EXPLAIN EXTENDED
|
|
SELECT t6.a,t6.b,t7.a,t7.b,t8.a,t8.b
|
|
FROM (t6, t7)
|
|
LEFT JOIN
|
|
t8
|
|
ON t7.b=t8.b AND t6.b < 10;
|
|
|
|
SELECT t6.a,t6.b,t7.a,t7.b,t8.a,t8.b
|
|
FROM (t6, t7)
|
|
LEFT JOIN
|
|
t8
|
|
ON t7.b=t8.b AND t6.b < 10;
|
|
|
|
SELECT t5.a,t5.b
|
|
FROM t5;
|
|
|
|
SELECT t5.a,t5.b,t6.a,t6.b,t7.a,t7.b,t8.a,t8.b
|
|
FROM t5
|
|
LEFT JOIN
|
|
(
|
|
(t6, t7)
|
|
LEFT JOIN
|
|
t8
|
|
ON t7.b=t8.b AND t6.b < 10
|
|
)
|
|
ON t6.b >= 2 AND t5.b=t7.b;
|
|
|
|
SELECT t5.a,t5.b,t6.a,t6.b,t7.a,t7.b,t8.a,t8.b
|
|
FROM t5
|
|
LEFT JOIN
|
|
(
|
|
(t6, t7)
|
|
LEFT JOIN
|
|
t8
|
|
ON t7.b=t8.b AND t6.b < 10
|
|
)
|
|
ON t6.b >= 2 AND t5.b=t7.b AND
|
|
(t8.a < 1 OR t8.c IS NULL);
|
|
|
|
SELECT t2.a,t2.b,t3.a,t3.b,t4.a,t4.b
|
|
FROM t2
|
|
LEFT JOIN
|
|
(t3, t4)
|
|
ON t3.a=1 AND t2.b=t4.b;
|
|
|
|
SELECT t2.a,t2.b,t3.a,t3.b,t4.a,t4.b,
|
|
t5.a,t5.b,t6.a,t6.b,t7.a,t7.b,t8.a,t8.b
|
|
FROM t2
|
|
LEFT JOIN
|
|
(t3, t4)
|
|
ON t3.a=1 AND t2.b=t4.b,
|
|
t5
|
|
LEFT JOIN
|
|
(
|
|
(t6, t7)
|
|
LEFT JOIN
|
|
t8
|
|
ON t7.b=t8.b AND t6.b < 10
|
|
)
|
|
ON t6.b >= 2 AND t5.b=t7.b;
|
|
|
|
SELECT t2.a,t2.b,t3.a,t3.b,t4.a,t4.b,
|
|
t5.a,t5.b,t6.a,t6.b,t7.a,t7.b,t8.a,t8.b
|
|
FROM t2
|
|
LEFT JOIN
|
|
(t3, t4)
|
|
ON t3.a=1 AND t2.b=t4.b,
|
|
t5
|
|
LEFT JOIN
|
|
(
|
|
(t6, t7)
|
|
LEFT JOIN
|
|
t8
|
|
ON t7.b=t8.b AND t6.b < 10
|
|
)
|
|
ON t6.b >= 2 AND t5.b=t7.b
|
|
WHERE t2.a > 3 AND
|
|
(t6.a < 6 OR t6.c IS NULL);
|
|
|
|
SELECT t1.a,t1.b
|
|
FROM t1;
|
|
|
|
SELECT t1.a,t1.b,t2.a,t2.b,t3.a,t3.b,t4.a,t4.b,
|
|
t5.a,t5.b,t6.a,t6.b,t7.a,t7.b,t8.a,t8.b
|
|
FROM t1
|
|
LEFT JOIN
|
|
(
|
|
t2
|
|
LEFT JOIN
|
|
(t3, t4)
|
|
ON t3.a=1 AND t2.b=t4.b,
|
|
t5
|
|
LEFT JOIN
|
|
(
|
|
(t6, t7)
|
|
LEFT JOIN
|
|
t8
|
|
ON t7.b=t8.b AND t6.b < 10
|
|
)
|
|
ON t6.b >= 2 AND t5.b=t7.b
|
|
)
|
|
ON (t3.b=2 OR t3.c IS NULL) AND (t6.b=2 OR t6.c IS NULL) AND
|
|
(t1.b=t5.b OR t3.c IS NULL OR t6.c IS NULL or t8.c IS NULL) AND
|
|
(t1.a != 2);
|
|
|
|
SELECT t1.a,t1.b,t2.a,t2.b,t3.a,t3.b,t4.a,t4.b,
|
|
t5.a,t5.b,t6.a,t6.b,t7.a,t7.b,t8.a,t8.b
|
|
FROM t1
|
|
LEFT JOIN
|
|
(
|
|
t2
|
|
LEFT JOIN
|
|
(t3, t4)
|
|
ON t3.a=1 AND t2.b=t4.b,
|
|
t5
|
|
LEFT JOIN
|
|
(
|
|
(t6, t7)
|
|
LEFT JOIN
|
|
t8
|
|
ON t7.b=t8.b AND t6.b < 10
|
|
)
|
|
ON t6.b >= 2 AND t5.b=t7.b
|
|
)
|
|
ON (t3.b=2 OR t3.c IS NULL) AND (t6.b=2 OR t6.c IS NULL) AND
|
|
(t1.b=t5.b OR t3.c IS NULL OR t6.c IS NULL or t8.c IS NULL) AND
|
|
(t1.a != 2)
|
|
WHERE (t2.a >= 4 OR t2.c IS NULL);
|
|
|
|
SELECT t0.a,t0.b
|
|
FROM t0;
|
|
|
|
EXPLAIN EXTENDED
|
|
SELECT t0.a,t0.b,t1.a,t1.b,t2.a,t2.b,t3.a,t3.b,t4.a,t4.b,
|
|
t5.a,t5.b,t6.a,t6.b,t7.a,t7.b,t8.a,t8.b
|
|
FROM t0,t1
|
|
LEFT JOIN
|
|
(
|
|
t2
|
|
LEFT JOIN
|
|
(t3, t4)
|
|
ON t3.a=1 AND t2.b=t4.b,
|
|
t5
|
|
LEFT JOIN
|
|
(
|
|
(t6, t7)
|
|
LEFT JOIN
|
|
t8
|
|
ON t7.b=t8.b AND t6.b < 10
|
|
)
|
|
ON t6.b >= 2 AND t5.b=t7.b
|
|
)
|
|
ON (t3.b=2 OR t3.c IS NULL) AND (t6.b=2 OR t6.c IS NULL) AND
|
|
(t1.b=t5.b OR t3.c IS NULL OR t6.c IS NULL or t8.c IS NULL) AND
|
|
(t1.a != 2)
|
|
WHERE t0.a=1 AND
|
|
t0.b=t1.b AND
|
|
(t2.a >= 4 OR t2.c IS NULL);
|
|
|
|
SELECT t0.a,t0.b,t1.a,t1.b,t2.a,t2.b,t3.a,t3.b,t4.a,t4.b,
|
|
t5.a,t5.b,t6.a,t6.b,t7.a,t7.b,t8.a,t8.b
|
|
FROM t0,t1
|
|
LEFT JOIN
|
|
(
|
|
t2
|
|
LEFT JOIN
|
|
(t3, t4)
|
|
ON t3.a=1 AND t2.b=t4.b,
|
|
t5
|
|
LEFT JOIN
|
|
(
|
|
(t6, t7)
|
|
LEFT JOIN
|
|
t8
|
|
ON t7.b=t8.b AND t6.b < 10
|
|
)
|
|
ON t6.b >= 2 AND t5.b=t7.b
|
|
)
|
|
ON (t3.b=2 OR t3.c IS NULL) AND (t6.b=2 OR t6.c IS NULL) AND
|
|
(t1.b=t5.b OR t3.c IS NULL OR t6.c IS NULL or t8.c IS NULL) AND
|
|
(t1.a != 2)
|
|
WHERE t0.a=1 AND
|
|
t0.b=t1.b AND
|
|
(t2.a >= 4 OR t2.c IS NULL);
|
|
|
|
EXPLAIN EXTENDED
|
|
SELECT t0.a,t0.b,t1.a,t1.b,t2.a,t2.b,t3.a,t3.b,t4.a,t4.b,
|
|
t5.a,t5.b,t6.a,t6.b,t7.a,t7.b,t8.a,t8.b,t9.a,t9.b
|
|
FROM t0,t1
|
|
LEFT JOIN
|
|
(
|
|
t2
|
|
LEFT JOIN
|
|
(t3, t4)
|
|
ON t3.a=1 AND t2.b=t4.b,
|
|
t5
|
|
LEFT JOIN
|
|
(
|
|
(t6, t7)
|
|
LEFT JOIN
|
|
t8
|
|
ON t7.b=t8.b AND t6.b < 10
|
|
)
|
|
ON t6.b >= 2 AND t5.b=t7.b
|
|
)
|
|
ON (t3.b=2 OR t3.c IS NULL) AND (t6.b=2 OR t6.c IS NULL) AND
|
|
(t1.b=t5.b OR t3.c IS NULL OR t6.c IS NULL or t8.c IS NULL) AND
|
|
(t1.a != 2),
|
|
t9
|
|
WHERE t0.a=1 AND
|
|
t0.b=t1.b AND
|
|
(t2.a >= 4 OR t2.c IS NULL) AND
|
|
(t3.a < 5 OR t3.c IS NULL) AND
|
|
(t3.b=t4.b OR t3.c IS NULL OR t4.c IS NULL) AND
|
|
(t5.a >=2 OR t5.c IS NULL) AND
|
|
(t6.a >=4 OR t6.c IS NULL) AND
|
|
(t7.a <= 2 OR t7.c IS NULL) AND
|
|
(t8.a < 1 OR t8.c IS NULL) AND
|
|
(t8.b=t9.b OR t8.c IS NULL) AND
|
|
(t9.a=1);
|
|
|
|
SELECT t9.a,t9.b
|
|
FROM t9;
|
|
|
|
--sorted_result
|
|
SELECT t0.a,t0.b,t1.a,t1.b,t2.a,t2.b,t3.a,t3.b,t4.a,t4.b,
|
|
t5.a,t5.b,t6.a,t6.b,t7.a,t7.b,t8.a,t8.b,t9.a,t9.b
|
|
FROM t0,t1
|
|
LEFT JOIN
|
|
(
|
|
t2
|
|
LEFT JOIN
|
|
(t3, t4)
|
|
ON t3.a=1 AND t2.b=t4.b,
|
|
t5
|
|
LEFT JOIN
|
|
(
|
|
(t6, t7)
|
|
LEFT JOIN
|
|
t8
|
|
ON t7.b=t8.b AND t6.b < 10
|
|
)
|
|
ON t6.b >= 2 AND t5.b=t7.b
|
|
)
|
|
ON (t3.b=2 OR t3.c IS NULL) AND (t6.b=2 OR t6.c IS NULL) AND
|
|
(t1.b=t5.b OR t3.c IS NULL OR t6.c IS NULL or t8.c IS NULL) AND
|
|
(t1.a != 2),
|
|
t9
|
|
WHERE t0.a=1 AND
|
|
t0.b=t1.b AND
|
|
(t2.a >= 4 OR t2.c IS NULL) AND
|
|
(t3.a < 5 OR t3.c IS NULL) AND
|
|
(t3.b=t4.b OR t3.c IS NULL OR t4.c IS NULL) AND
|
|
(t5.a >=2 OR t5.c IS NULL) AND
|
|
(t6.a >=4 OR t6.c IS NULL) AND
|
|
(t7.a <= 2 OR t7.c IS NULL) AND
|
|
(t8.a < 1 OR t8.c IS NULL) AND
|
|
(t8.b=t9.b OR t8.c IS NULL) AND
|
|
(t9.a=1);
|
|
|
|
SELECT t1.a,t1.b
|
|
FROM t1;
|
|
|
|
SELECT t2.a,t2.b
|
|
FROM t2;
|
|
|
|
SELECT t3.a,t3.b
|
|
FROM t3;
|
|
|
|
SELECT t2.a,t2.b,t3.a,t3.b
|
|
FROM t2
|
|
LEFT JOIN
|
|
t3
|
|
ON t2.b=t3.b;
|
|
|
|
SELECT t1.a,t1.b,t2.a,t2.b,t3.a,t3.b
|
|
FROM t1, t2
|
|
LEFT JOIN
|
|
t3
|
|
ON t2.b=t3.b
|
|
WHERE t1.a <= 2;
|
|
|
|
SELECT t1.a,t1.b,t2.a,t2.b,t3.a,t3.b
|
|
FROM t1, t3
|
|
RIGHT JOIN
|
|
t2
|
|
ON t2.b=t3.b
|
|
WHERE t1.a <= 2;
|
|
|
|
SELECT t3.a,t3.b,t4.a,t4.b
|
|
FROM t3,t4;
|
|
|
|
SELECT t2.a,t2.b,t3.a,t3.b,t4.a,t4.b
|
|
FROM t2
|
|
LEFT JOIN
|
|
(t3, t4)
|
|
ON t3.a=1 AND t2.b=t4.b;
|
|
|
|
SELECT t1.a,t1.b,t2.a,t2.b,t3.a,t3.b,t4.a,t4.b
|
|
FROM t1, t2
|
|
LEFT JOIN
|
|
(t3, t4)
|
|
ON t3.a=1 AND t2.b=t4.b
|
|
WHERE t1.a <= 2;
|
|
|
|
SELECT t1.a,t1.b,t2.a,t2.b,t3.a,t3.b,t4.a,t4.b
|
|
FROM t1, (t3, t4)
|
|
RIGHT JOIN
|
|
t2
|
|
ON t3.a=1 AND t2.b=t4.b
|
|
WHERE t1.a <= 2;
|
|
|
|
SELECT t1.a,t1.b,t2.a,t2.b,t3.a,t3.b,t4.a,t4.b
|
|
FROM t1, (t3, t4)
|
|
RIGHT JOIN
|
|
t2
|
|
ON t3.a=1 AND t2.b=t4.b
|
|
WHERE t1.a <= 2;
|
|
|
|
EXPLAIN EXTENDED
|
|
SELECT t1.a,t1.b,t2.a,t2.b,t3.a,t3.b,t4.a,t4.b
|
|
FROM t1, (t3, t4)
|
|
RIGHT JOIN
|
|
t2
|
|
ON t3.a=1 AND t2.b=t4.b
|
|
WHERE t1.a <= 2;
|
|
|
|
INSERT INTO t2 VALUES (-1,9,0), (-3,10,0), (-2,8,0), (-4,11,0), (-5,15,0);
|
|
CREATE INDEX idx_b ON t2(b);
|
|
|
|
EXPLAIN EXTENDED
|
|
SELECT t2.a,t2.b,t3.a,t3.b,t4.a,t4.b
|
|
FROM (t3,t4)
|
|
LEFT JOIN
|
|
(t1,t2)
|
|
ON t3.a=1 AND t3.b=t2.b AND t2.b=t4.b AND t2.a>0;
|
|
SELECT t2.a,t2.b,t3.a,t3.b,t4.a,t4.b
|
|
FROM (t3,t4)
|
|
LEFT JOIN
|
|
(t1,t2)
|
|
ON t3.a=1 AND t3.b=t2.b AND t2.b=t4.b AND t2.a>0;
|
|
|
|
EXPLAIN EXTENDED
|
|
SELECT t0.a,t0.b,t1.a,t1.b,t2.a,t2.b,t3.a,t3.b,t4.a,t4.b,
|
|
t5.a,t5.b,t6.a,t6.b,t7.a,t7.b,t8.a,t8.b,t9.a,t9.b
|
|
FROM t0,t1
|
|
LEFT JOIN
|
|
(
|
|
t2
|
|
LEFT JOIN
|
|
(t3, t4)
|
|
ON t3.a=1 AND t2.b=t4.b AND t2.a>0,
|
|
t5
|
|
LEFT JOIN
|
|
(
|
|
(t6, t7)
|
|
LEFT JOIN
|
|
t8
|
|
ON t7.b=t8.b AND t6.b < 10
|
|
)
|
|
ON t6.b >= 2 AND t5.b=t7.b
|
|
)
|
|
ON (t3.b=2 OR t3.c IS NULL) AND (t6.b=2 OR t6.c IS NULL) AND
|
|
(t1.b=t5.b OR t3.c IS NULL OR t6.c IS NULL or t8.c IS NULL) AND
|
|
(t1.a != 2),
|
|
t9
|
|
WHERE t0.a=1 AND
|
|
t0.b=t1.b AND
|
|
(t2.a >= 4 OR t2.c IS NULL) AND
|
|
(t3.a < 5 OR t3.c IS NULL) AND
|
|
(t3.b=t4.b OR t3.c IS NULL OR t4.c IS NULL) AND
|
|
(t5.a >=2 OR t5.c IS NULL) AND
|
|
(t6.a >=4 OR t6.c IS NULL) AND
|
|
(t7.a <= 2 OR t7.c IS NULL) AND
|
|
(t8.a < 1 OR t8.c IS NULL) AND
|
|
(t8.b=t9.b OR t8.c IS NULL) AND
|
|
(t9.a=1);
|
|
|
|
INSERT INTO t4 VALUES (-3,12,0), (-4,13,0), (-1,11,0), (-3,11,0), (-5,15,0);
|
|
INSERT INTO t5 VALUES (-3,11,0), (-2,12,0), (-3,13,0), (-4,12,0);
|
|
CREATE INDEX idx_b ON t4(b);
|
|
CREATE INDEX idx_b ON t5(b);
|
|
|
|
EXPLAIN EXTENDED
|
|
SELECT t0.a,t0.b,t1.a,t1.b,t2.a,t2.b,t3.a,t3.b,t4.a,t4.b,
|
|
t5.a,t5.b,t6.a,t6.b,t7.a,t7.b,t8.a,t8.b,t9.a,t9.b
|
|
FROM t0,t1
|
|
LEFT JOIN
|
|
(
|
|
t2
|
|
LEFT JOIN
|
|
(t3, t4)
|
|
ON t3.a=1 AND t2.b=t4.b AND t2.a>0 AND t4.a>0,
|
|
t5
|
|
LEFT JOIN
|
|
(
|
|
(t6, t7)
|
|
LEFT JOIN
|
|
t8
|
|
ON t7.b=t8.b AND t6.b < 10
|
|
)
|
|
ON t6.b >= 2 AND t5.b=t7.b AND t5.a>0
|
|
)
|
|
ON (t3.b=2 OR t3.c IS NULL) AND (t6.b=2 OR t6.c IS NULL) AND
|
|
(t1.b=t5.b OR t3.c IS NULL OR t6.c IS NULL or t8.c IS NULL) AND
|
|
(t1.a != 2),
|
|
t9
|
|
WHERE t0.a=1 AND
|
|
t0.b=t1.b AND
|
|
(t2.a >= 4 OR t2.c IS NULL) AND
|
|
(t3.a < 5 OR t3.c IS NULL) AND
|
|
(t3.b=t4.b OR t3.c IS NULL OR t4.c IS NULL) AND
|
|
(t5.a >=2 OR t5.c IS NULL) AND
|
|
(t6.a >=4 OR t6.c IS NULL) AND
|
|
(t7.a <= 2 OR t7.c IS NULL) AND
|
|
(t8.a < 1 OR t8.c IS NULL) AND
|
|
(t8.b=t9.b OR t8.c IS NULL) AND
|
|
(t9.a=1);
|
|
|
|
INSERT INTO t8 VALUES (-3,12,0), (-1,14,0), (-5,15,0), (-1,11,0), (-4,13,0);
|
|
CREATE INDEX idx_b ON t8(b);
|
|
|
|
EXPLAIN EXTENDED
|
|
SELECT t0.a,t0.b,t1.a,t1.b,t2.a,t2.b,t3.a,t3.b,t4.a,t4.b,
|
|
t5.a,t5.b,t6.a,t6.b,t7.a,t7.b,t8.a,t8.b,t9.a,t9.b
|
|
FROM t0,t1
|
|
LEFT JOIN
|
|
(
|
|
t2
|
|
LEFT JOIN
|
|
(t3, t4)
|
|
ON t3.a=1 AND t2.b=t4.b AND t2.a>0 AND t4.a>0,
|
|
t5
|
|
LEFT JOIN
|
|
(
|
|
(t6, t7)
|
|
LEFT JOIN
|
|
t8
|
|
ON t7.b=t8.b AND t6.b < 10 AND t8.a>=0
|
|
)
|
|
ON t6.b >= 2 AND t5.b=t7.b AND t5.a>0
|
|
)
|
|
ON (t3.b=2 OR t3.c IS NULL) AND (t6.b=2 OR t6.c IS NULL) AND
|
|
(t1.b=t5.b OR t3.c IS NULL OR t6.c IS NULL or t8.c IS NULL) AND
|
|
(t1.a != 2),
|
|
t9
|
|
WHERE t0.a=1 AND
|
|
t0.b=t1.b AND
|
|
(t2.a >= 4 OR t2.c IS NULL) AND
|
|
(t3.a < 5 OR t3.c IS NULL) AND
|
|
(t3.b=t4.b OR t3.c IS NULL OR t4.c IS NULL) AND
|
|
(t5.a >=2 OR t5.c IS NULL) AND
|
|
(t6.a >=4 OR t6.c IS NULL) AND
|
|
(t7.a <= 2 OR t7.c IS NULL) AND
|
|
(t8.a < 1 OR t8.c IS NULL) AND
|
|
(t8.b=t9.b OR t8.c IS NULL) AND
|
|
(t9.a=1);
|
|
|
|
INSERT INTO t1 VALUES (-1,133,0), (-2,12,0), (-3,11,0), (-5,15,0);
|
|
CREATE INDEX idx_b ON t1(b);
|
|
CREATE INDEX idx_a ON t0(a);
|
|
|
|
EXPLAIN EXTENDED
|
|
SELECT t0.a,t0.b,t1.a,t1.b,t2.a,t2.b,t3.a,t3.b,t4.a,t4.b,
|
|
t5.a,t5.b,t6.a,t6.b,t7.a,t7.b,t8.a,t8.b,t9.a,t9.b
|
|
FROM t0,t1
|
|
LEFT JOIN
|
|
(
|
|
t2
|
|
LEFT JOIN
|
|
(t3, t4)
|
|
ON t3.a=1 AND t2.b=t4.b,
|
|
t5
|
|
LEFT JOIN
|
|
(
|
|
(t6, t7)
|
|
LEFT JOIN
|
|
t8
|
|
ON t7.b=t8.b AND t6.b < 10
|
|
)
|
|
ON t6.b >= 2 AND t5.b=t7.b
|
|
)
|
|
ON (t3.b=2 OR t3.c IS NULL) AND (t6.b=2 OR t6.c IS NULL) AND
|
|
(t1.b=t5.b OR t3.c IS NULL OR t6.c IS NULL or t8.c IS NULL) AND
|
|
(t1.a != 2) AND t1.a>0,
|
|
t9
|
|
WHERE t0.a=1 AND
|
|
t0.b=t1.b AND
|
|
(t2.a >= 4 OR t2.c IS NULL) AND
|
|
(t3.a < 5 OR t3.c IS NULL) AND
|
|
(t3.b=t4.b OR t3.c IS NULL OR t4.c IS NULL) AND
|
|
(t5.a >=2 OR t5.c IS NULL) AND
|
|
(t6.a >=4 OR t6.c IS NULL) AND
|
|
(t7.a <= 2 OR t7.c IS NULL) AND
|
|
(t8.a < 1 OR t8.c IS NULL) AND
|
|
(t8.b=t9.b OR t8.c IS NULL) AND
|
|
(t9.a=1);
|
|
|
|
--sorted_result
|
|
SELECT t0.a,t0.b,t1.a,t1.b,t2.a,t2.b,t3.a,t3.b,t4.a,t4.b,
|
|
t5.a,t5.b,t6.a,t6.b,t7.a,t7.b,t8.a,t8.b,t9.a,t9.b
|
|
FROM t0,t1
|
|
LEFT JOIN
|
|
(
|
|
t2
|
|
LEFT JOIN
|
|
(t3, t4)
|
|
ON t3.a=1 AND t2.b=t4.b,
|
|
t5
|
|
LEFT JOIN
|
|
(
|
|
(t6, t7)
|
|
LEFT JOIN
|
|
t8
|
|
ON t7.b=t8.b AND t6.b < 10
|
|
)
|
|
ON t6.b >= 2 AND t5.b=t7.b
|
|
)
|
|
ON (t3.b=2 OR t3.c IS NULL) AND (t6.b=2 OR t6.c IS NULL) AND
|
|
(t1.b=t5.b OR t3.c IS NULL OR t6.c IS NULL or t8.c IS NULL) AND
|
|
(t1.a != 2) AND t1.a>0,
|
|
t9
|
|
WHERE t0.a=1 AND
|
|
t0.b=t1.b AND
|
|
(t2.a >= 4 OR t2.c IS NULL) AND
|
|
(t3.a < 5 OR t3.c IS NULL) AND
|
|
(t3.b=t4.b OR t3.c IS NULL OR t4.c IS NULL) AND
|
|
(t5.a >=2 OR t5.c IS NULL) AND
|
|
(t6.a >=4 OR t6.c IS NULL) AND
|
|
(t7.a <= 2 OR t7.c IS NULL) AND
|
|
(t8.a < 1 OR t8.c IS NULL) AND
|
|
(t8.b=t9.b OR t8.c IS NULL) AND
|
|
(t9.a=1);
|
|
|
|
SELECT t2.a,t2.b
|
|
FROM t2;
|
|
|
|
SELECT t3.a,t3.b
|
|
FROM t3;
|
|
|
|
SELECT t2.a,t2.b,t3.a,t3.b
|
|
FROM t2 LEFT JOIN t3 ON t2.b=t3.b
|
|
WHERE t2.a = 4 OR (t2.a > 4 AND t3.a IS NULL);
|
|
|
|
SELECT t2.a,t2.b,t3.a,t3.b
|
|
FROM t2 LEFT JOIN t3 ON t2.b=t3.b
|
|
WHERE t2.a = 4 OR (t2.a > 4 AND t3.a IS NULL);
|
|
|
|
ALTER TABLE t3
|
|
CHANGE COLUMN a a1 int,
|
|
CHANGE COLUMN c c1 int;
|
|
|
|
SELECT t2.a,t2.b,t3.a1,t3.b
|
|
FROM t2 LEFT JOIN t3 ON t2.b=t3.b
|
|
WHERE t2.a = 4 OR (t2.a > 4 AND t3.a1 IS NULL);
|
|
|
|
SELECT t2.a,t2.b,t3.a1,t3.b
|
|
FROM t2 NATURAL LEFT JOIN t3
|
|
WHERE t2.a = 4 OR (t2.a > 4 AND t3.a1 IS NULL);
|
|
|
|
DROP TABLE t0,t1,t2,t3,t4,t5,t6,t7,t8,t9;
|
|
|
|
CREATE TABLE t1 (a int);
|
|
CREATE TABLE t2 (a int);
|
|
CREATE TABLE t3 (a int);
|
|
|
|
INSERT INTO t1 VALUES (1);
|
|
INSERT INTO t2 VALUES (2);
|
|
INSERT INTO t3 VALUES (2);
|
|
INSERT INTO t1 VALUES (2);
|
|
|
|
#check proper syntax for nested outer joins
|
|
|
|
SELECT * FROM t1 LEFT JOIN (t2 LEFT JOIN t3 ON t2.a=t3.a) ON t1.a=t3.a;
|
|
|
|
#must be equivalent to:
|
|
|
|
SELECT * FROM t1 LEFT JOIN t2 LEFT JOIN t3 ON t2.a=t3.a ON t1.a=t3.a;
|
|
|
|
#check that everything is al right when all tables contain not more than 1 row
|
|
#(bug #4922)
|
|
|
|
DELETE FROM t1 WHERE a=2;
|
|
SELECT * FROM t1 LEFT JOIN t2 LEFT JOIN t3 ON t2.a=t3.a ON t1.a=t3.a;
|
|
DELETE FROM t2;
|
|
SELECT * FROM t1 LEFT JOIN t2 LEFT JOIN t3 ON t2.a=t3.a ON t1.a=t3.a;
|
|
|
|
DROP TABLE t1,t2,t3;
|
|
|
|
#on expression for a nested outer join does not depend on the outer table
|
|
#bug #4976
|
|
|
|
CREATE TABLE t1(a int, key (a));
|
|
CREATE TABLE t2(b int, key (b));
|
|
CREATE TABLE t3(c int, key (c));
|
|
|
|
INSERT INTO t1 VALUES (NULL), (0), (1), (2), (3), (4), (5), (6), (7), (8), (9),
|
|
(10), (11), (12), (13), (14), (15), (16), (17), (18), (19);
|
|
|
|
INSERT INTO t2 VALUES (NULL), (0), (1), (2), (3), (4), (5), (6), (7), (8), (9),
|
|
(10), (11), (12), (13), (14), (15), (16), (17), (18), (19);
|
|
|
|
INSERT INTO t3 VALUES (0), (1), (2), (3), (4), (5);
|
|
|
|
EXPLAIN SELECT a, b, c FROM t1 LEFT JOIN (t2, t3) ON c < 3 and b = c;
|
|
EXPLAIN SELECT a, b, c FROM t1 LEFT JOIN (t2, t3) ON b < 3 and b = c;
|
|
SELECT a, b, c FROM t1 LEFT JOIN (t2, t3) ON b < 3 and b = c;
|
|
|
|
DELETE FROM t3;
|
|
EXPLAIN SELECT a, b, c FROM t1 LEFT JOIN (t2, t3) ON b < 3 and b = c;
|
|
SELECT a, b, c FROM t1 LEFT JOIN (t2, t3) ON b < 3 and b = c;
|
|
|
|
DROP TABLE t1,t2,t3;
|
|
|
|
#
|
|
# Test for bug #11284: empty table in a nested left join
|
|
#
|
|
|
|
CREATE TABLE t1 (c11 int);
|
|
CREATE TABLE t2 (c21 int);
|
|
CREATE TABLE t3 (c31 int);
|
|
|
|
INSERT INTO t1 VALUES (4), (5);
|
|
|
|
SELECT * FROM t1 LEFT JOIN t2 ON c11=c21;
|
|
EXPLAIN SELECT * FROM t1 LEFT JOIN t2 ON c11=c21;
|
|
|
|
SELECT * FROM t1 LEFT JOIN (t2 LEFT JOIN t3 ON c21=c31) ON c11=c21;
|
|
EXPLAIN SELECT * FROM t1 LEFT JOIN (t2 LEFT JOIN t3 ON c21=c31) ON c11=c21;
|
|
|
|
DROP TABLE t1,t2,t3;
|
|
|
|
#
|
|
# Bug #12154: creation of temp table for a query with nested outer join
|
|
#
|
|
|
|
CREATE TABLE t1 (goods int(12) NOT NULL, price varchar(128) NOT NULL);
|
|
INSERT INTO t1 VALUES (23, 2340), (26, 9900);
|
|
|
|
CREATE TABLE t2 (goods int(12), name varchar(50), shop char(2));
|
|
INSERT INTO t2 VALUES (23, 'as300', 'fr'), (26, 'as600', 'fr');
|
|
|
|
create table t3 (groupid int(12) NOT NULL, goodsid int(12) NOT NULL);
|
|
INSERT INTO t3 VALUES (3,23), (6,26);
|
|
|
|
CREATE TABLE t4 (groupid int(12));
|
|
INSERT INTO t4 VALUES (1), (2), (3), (4), (5), (6);
|
|
|
|
SELECT * FROM
|
|
(SELECT DISTINCT gl.groupid, gp.price
|
|
FROM t4 gl
|
|
LEFT JOIN
|
|
(t3 g INNER JOIN t2 p ON g.goodsid = p.goods
|
|
INNER JOIN t1 gp ON p.goods = gp.goods)
|
|
ON gl.groupid = g.groupid and p.shop = 'fr') t;
|
|
|
|
CREATE VIEW v1 AS
|
|
SELECT g.groupid groupid, p.goods goods,
|
|
p.name name, p.shop shop,
|
|
gp.price price
|
|
FROM t3 g INNER JOIN t2 p ON g.goodsid = p.goods
|
|
INNER JOIN t1 gp on p.goods = gp.goods;
|
|
|
|
CREATE VIEW v2 AS
|
|
SELECT DISTINCT g.groupid, fr.price
|
|
FROM t4 g
|
|
LEFT JOIN
|
|
v1 fr on g.groupid = fr.groupid and fr.shop = 'fr';
|
|
|
|
SELECT * FROM v2;
|
|
|
|
SELECT * FROM
|
|
(SELECT DISTINCT g.groupid, fr.price
|
|
FROM t4 g
|
|
LEFT JOIN
|
|
v1 fr on g.groupid = fr.groupid and fr.shop = 'fr') t;
|
|
|
|
DROP VIEW v1,v2;
|
|
DROP TABLE t1,t2,t3,t4;
|
|
|
|
#
|
|
# Bug #13545: problem with NATURAL/USING joins.
|
|
#
|
|
|
|
CREATE TABLE t1(a int);
|
|
CREATE TABLE t2(b int);
|
|
CREATE TABLE t3(c int, d int);
|
|
CREATE TABLE t4(d int);
|
|
CREATE TABLE t5(e int, f int);
|
|
CREATE TABLE t6(f int);
|
|
CREATE VIEW v1 AS
|
|
SELECT e FROM t5 JOIN t6 ON t5.e=t6.f;
|
|
CREATE VIEW v2 AS
|
|
SELECT e FROM t5 NATURAL JOIN t6;
|
|
|
|
SELECT t1.a FROM t1 JOIN t2 ON a=b JOIN t3 ON a=c JOIN t4 USING(d);
|
|
--error 1054
|
|
SELECT t1.x FROM t1 JOIN t2 ON a=b JOIN t3 ON a=c JOIN t4 USING(d);
|
|
SELECT t1.a FROM t1 JOIN t2 ON a=b JOIN t3 ON a=c NATURAL JOIN t4;
|
|
--error 1054
|
|
SELECT t1.x FROM t1 JOIN t2 ON a=b JOIN t3 ON a=c NATURAL JOIN t4;
|
|
SELECT v1.e FROM v1 JOIN t2 ON e=b JOIN t3 ON e=c JOIN t4 USING(d);
|
|
--error 1054
|
|
SELECT v1.x FROM v1 JOIN t2 ON e=b JOIN t3 ON e=c JOIN t4 USING(d);
|
|
SELECT v2.e FROM v2 JOIN t2 ON e=b JOIN t3 ON e=c JOIN t4 USING(d);
|
|
--error 1054
|
|
SELECT v2.x FROM v2 JOIN t2 ON e=b JOIN t3 ON e=c JOIN t4 USING(d);
|
|
|
|
DROP VIEW v1, v2;
|
|
DROP TABLE t1, t2, t3, t4, t5, t6;
|
|
|
|
#
|
|
# BUG#13126 -test case from bug report
|
|
#
|
|
create table t1 (id1 int(11) not null);
|
|
insert into t1 values (1),(2);
|
|
|
|
create table t2 (id2 int(11) not null);
|
|
insert into t2 values (1),(2),(3),(4);
|
|
|
|
create table t3 (id3 char(16) not null);
|
|
insert into t3 values ('100');
|
|
|
|
create table t4 (id2 int(11) not null, id3 char(16));
|
|
|
|
create table t5 (id1 int(11) not null, key (id1));
|
|
insert into t5 values (1),(2),(1);
|
|
|
|
create view v1 as
|
|
select t4.id3 from t4 join t2 on t4.id2 = t2.id2;
|
|
|
|
select t1.id1 from t1 inner join (t3 left join v1 on t3.id3 = v1.id3);
|
|
|
|
drop view v1;
|
|
drop table t1, t2, t3, t4, t5;
|
|
|
|
create table t0 (a int);
|
|
insert into t0 values (0),(1),(2),(3);
|
|
create table t1(a int);
|
|
insert into t1 select A.a + 10*(B.a) from t0 A, t0 B;
|
|
|
|
create table t2 (a int, b int);
|
|
insert into t2 values (1,1), (2,2), (3,3);
|
|
|
|
create table t3(a int, b int, filler char(200), key(a));
|
|
insert into t3 select a,a,'filler' from t1;
|
|
insert into t3 select a,a,'filler' from t1;
|
|
|
|
create table t4 like t3;
|
|
insert into t4 select * from t3;
|
|
insert into t4 select * from t3;
|
|
|
|
create table t5 like t4;
|
|
insert into t5 select * from t4;
|
|
insert into t5 select * from t4;
|
|
|
|
create table t6 like t5;
|
|
insert into t6 select * from t5;
|
|
insert into t6 select * from t5;
|
|
|
|
create table t7 like t6;
|
|
insert into t7 select * from t6;
|
|
insert into t7 select * from t6;
|
|
|
|
--replace_column 9 X
|
|
explain select * from t4 join
|
|
t2 left join (t3 join t5 on t5.a=t3.b) on t3.a=t2.b where t4.a<=>t3.b;
|
|
|
|
--replace_column 9 X
|
|
explain select * from (t4 join t6 on t6.a=t4.b) right join t3 on t4.a=t3.b
|
|
join t2 left join (t5 join t7 on t7.a=t5.b) on t5.a=t2.b where t3.a<=>t2.b;
|
|
|
|
--replace_column 9 X
|
|
explain select * from t2 left join
|
|
(t3 left join (t4 join t6 on t6.a=t4.b) on t4.a=t3.b
|
|
join t5 on t5.a=t3.b) on t3.a=t2.b;
|
|
|
|
drop table t0, t1, t2, t3, t4, t5, t6, t7;
|
|
|
|
# BUG#16393
|
|
create table t1 (a int);
|
|
insert into t1 values (0),(1),(2),(3),(4),(5),(6),(7),(8),(9);
|
|
create table t2 (a int, filler char(100), key(a));
|
|
insert into t2 select A.a + 10*B.a, '' from t1 A, t1 B;
|
|
create table t3 like t2;
|
|
insert into t3 select * from t2;
|
|
|
|
explain select * from t1 left join
|
|
(t2 left join t3 on (t2.a = t3.a))
|
|
on (t1.a = t2.a);
|
|
drop table t1, t2, t3;
|
|
|
|
#
|
|
# Bug #16260: single row table in the inner nest of an outer join
|
|
#
|
|
|
|
CREATE TABLE t1 (id int NOT NULL PRIMARY KEY, type varchar(10));
|
|
CREATE TABLE t2 (pid int NOT NULL PRIMARY KEY, type varchar(10));
|
|
CREATE TABLE t3 (cid int NOT NULL PRIMARY KEY,
|
|
id int NOT NULL,
|
|
pid int NOT NULL);
|
|
|
|
INSERT INTO t1 VALUES (1, 'A'), (3, 'C');
|
|
INSERT INTO t2 VALUES (1, 'A'), (3, 'C');
|
|
INSERT INTO t3 VALUES (1, 1, 1), (3, 3, 3);
|
|
|
|
SELECT * FROM t1 p LEFT JOIN (t3 JOIN t1)
|
|
ON (t1.id=t3.id AND t1.type='B' AND p.id=t3.id)
|
|
LEFT JOIN t2 ON (t3.pid=t2.pid)
|
|
WHERE p.id=1;
|
|
|
|
CREATE VIEW v1 AS
|
|
SELECT t3.* FROM t3 JOIN t1 ON t1.id=t3.id AND t1.type='B';
|
|
|
|
SELECT * FROM t1 p LEFT JOIN v1 ON p.id=v1.id
|
|
LEFT JOIN t2 ON v1.pid=t2.pid
|
|
WHERE p.id=1;
|
|
|
|
DROP VIEW v1;
|
|
DROP TABLE t1,t2,t3;
|
|
|
|
|
|
#
|
|
# Test for bug #18279: crash when on conditions are moved out of a nested join
|
|
# to the on conditions for the nest
|
|
|
|
CREATE TABLE t1 (id1 int PRIMARY KEY, id2 int);
|
|
CREATE TABLE t2 (id1 int PRIMARY KEY, id2 int);
|
|
CREATE TABLE t3 (id1 int PRIMARY KEY, id2 int);
|
|
CREATE TABLE t4 (id1 int PRIMARY KEY, id2 int);
|
|
CREATE TABLE t5 (id1 int PRIMARY KEY, id2 int);
|
|
|
|
SELECT t1.id1 AS id, t5.id1 AS ngroupbynsa
|
|
FROM t1 INNER JOIN t2 ON t2.id2 = t1.id1
|
|
LEFT OUTER JOIN
|
|
(t3 INNER JOIN t4 ON t4.id1 = t3.id2 INNER JOIN t5 ON t4.id2 = t5.id1)
|
|
ON t3.id2 IS NOT NULL
|
|
WHERE t1.id1=2;
|
|
|
|
PREPARE stmt FROM
|
|
"SELECT t1.id1 AS id, t5.id1 AS ngroupbynsa
|
|
FROM t1 INNER JOIN t2 ON t2.id2 = t1.id1
|
|
LEFT OUTER JOIN
|
|
(t3 INNER JOIN t4 ON t4.id1 = t3.id2 INNER JOIN t5 ON t4.id2 = t5.id1)
|
|
ON t3.id2 IS NOT NULL
|
|
WHERE t1.id1=2";
|
|
|
|
EXECUTE stmt;
|
|
EXECUTE stmt;
|
|
EXECUTE stmt;
|
|
EXECUTE stmt;
|
|
|
|
INSERT INTO t1 VALUES (1,1), (2,1), (3,2);
|
|
INSERT INTO t2 VALUES (2,1), (3,2), (4,3);
|
|
INSERT INTO t3 VALUES (1,1), (3,2), (2,NULL);
|
|
INSERT INTO t4 VALUES (1,1), (2,1), (3,3);
|
|
INSERT INTO t5 VALUES (1,1), (2,2), (3,3), (4,3);
|
|
|
|
EXECUTE stmt;
|
|
EXECUTE stmt;
|
|
EXECUTE stmt;
|
|
EXECUTE stmt;
|
|
|
|
SELECT t1.id1 AS id, t5.id1 AS ngroupbynsa
|
|
FROM t1 INNER JOIN t2 ON t2.id2 = t1.id1
|
|
LEFT OUTER JOIN
|
|
(t3 INNER JOIN t4 ON t4.id1 = t3.id2 INNER JOIN t5 ON t4.id2 = t5.id1)
|
|
ON t3.id2 IS NOT NULL
|
|
WHERE t1.id1=2;
|
|
|
|
DROP TABLE t1,t2,t3,t4,t5;
|
|
|
|
#
|
|
# Test for bug #24345: crash with nested left outer join when outer table is substituted
|
|
# for a row that happens to have a null value for the join attribute.
|
|
#
|
|
|
|
CREATE TABLE t1 (
|
|
id int NOT NULL PRIMARY KEY,
|
|
ct int DEFAULT NULL,
|
|
pc int DEFAULT NULL,
|
|
INDEX idx_ct (ct),
|
|
INDEX idx_pc (pc)
|
|
);
|
|
INSERT INTO t1 VALUES
|
|
(1,NULL,NULL),(2,NULL,NULL),(3,NULL,NULL),(4,NULL,NULL),(5,NULL,NULL);
|
|
|
|
CREATE TABLE t2 (
|
|
id int NOT NULL PRIMARY KEY,
|
|
sr int NOT NULL,
|
|
nm varchar(255) NOT NULL,
|
|
INDEX idx_sr (sr)
|
|
);
|
|
INSERT INTO t2 VALUES
|
|
(2441905,4308,'LesAbymes'),(2441906,4308,'Anse-Bertrand');
|
|
|
|
CREATE TABLE t3 (
|
|
id int NOT NULL PRIMARY KEY,
|
|
ct int NOT NULL,
|
|
ln int NOT NULL,
|
|
INDEX idx_ct (ct),
|
|
INDEX idx_ln (ln)
|
|
);
|
|
|
|
CREATE TABLE t4 (
|
|
id int NOT NULL PRIMARY KEY,
|
|
nm varchar(255) NOT NULL
|
|
);
|
|
|
|
INSERT INTO t4 VALUES (4308,'Guadeloupe'),(4309,'Martinique');
|
|
|
|
SELECT t1.*
|
|
FROM t1 LEFT JOIN
|
|
(t2 LEFT JOIN t3 ON t3.ct=t2.id AND t3.ln='5') ON t1.ct=t2.id
|
|
WHERE t1.id='5';
|
|
|
|
SELECT t1.*, t4.nm
|
|
FROM t1 LEFT JOIN
|
|
(t2 LEFT JOIN t3 ON t3.ct=t2.id AND t3.ln='5') ON t1.ct=t2.id
|
|
LEFT JOIN t4 ON t2.sr=t4.id
|
|
WHERE t1.id='5';
|
|
|
|
DROP TABLE t1,t2,t3,t4;
|
|
|
|
#
|
|
# BUG#25575: ERROR 1052 (Column in from clause is ambiguous) with sub-join
|
|
#
|
|
CREATE TABLE t1 (a INT, b INT);
|
|
CREATE TABLE t2 (a INT);
|
|
CREATE TABLE t3 (a INT, c INT);
|
|
CREATE TABLE t4 (a INT, c INT);
|
|
CREATE TABLE t5 (a INT, c INT);
|
|
|
|
SELECT b FROM t1 JOIN (t2 LEFT JOIN t3 USING (a) LEFT JOIN t4 USING (a)
|
|
LEFT JOIN t5 USING (a)) USING (a);
|
|
|
|
--error ER_NON_UNIQ_ERROR
|
|
SELECT c FROM t1 JOIN (t2 LEFT JOIN t3 USING (a) LEFT JOIN t4 USING (a)
|
|
LEFT JOIN t5 USING (a)) USING (a);
|
|
|
|
SELECT b FROM t1 JOIN (t2 JOIN t3 USING (a) JOIN t4 USING (a)
|
|
JOIN t5 USING (a)) USING (a);
|
|
|
|
--error ER_NON_UNIQ_ERROR
|
|
SELECT c FROM t1 JOIN (t2 JOIN t3 USING (a) JOIN t4 USING (a)
|
|
JOIN t5 USING (a)) USING (a);
|
|
|
|
DROP TABLE t1,t2,t3,t4,t5;
|
|
CREATE TABLE t1 (a INT, b INT);
|
|
CREATE TABLE t2 (a INT, b INT);
|
|
CREATE TABLE t3 (a INT, b INT);
|
|
|
|
INSERT INTO t1 VALUES (1,1);
|
|
INSERT INTO t2 VALUES (1,1);
|
|
INSERT INTO t3 VALUES (1,1);
|
|
|
|
--error ER_NON_UNIQ_ERROR
|
|
SELECT * FROM t1 JOIN (t2 JOIN t3 USING (b)) USING (a);
|
|
|
|
DROP TABLE t1,t2,t3;
|
|
|
|
#
|
|
# BUG#29604: inner nest of left join interleaves with outer tables
|
|
#
|
|
|
|
CREATE TABLE t1 (
|
|
carrier char(2) default NULL,
|
|
id int NOT NULL auto_increment PRIMARY KEY
|
|
);
|
|
INSERT INTO t1 VALUES
|
|
('CO',235371754),('CO',235376554),('CO',235376884),('CO',235377874),
|
|
('CO',231060394),('CO',231059224),('CO',231059314),('CO',231060484),
|
|
('CO',231060274),('CO',231060124),('CO',231060244),('CO',231058594),
|
|
('CO',231058924),('CO',231058504),('CO',231059344),('CO',231060424),
|
|
('CO',231059554),('CO',231060304),('CO',231059644),('CO',231059464),
|
|
('CO',231059764),('CO',231058294),('CO',231058624),('CO',231058864),
|
|
('CO',231059374),('CO',231059584),('CO',231059734),('CO',231059014),
|
|
('CO',231059854),('CO',231059494),('CO',231059794),('CO',231058534),
|
|
('CO',231058324),('CO',231058684),('CO',231059524),('CO',231059974);
|
|
|
|
CREATE TABLE t2 (
|
|
scan_date date default NULL,
|
|
package_id int default NULL,
|
|
INDEX scan_date(scan_date),
|
|
INDEX package_id(package_id)
|
|
);
|
|
INSERT INTO t2 VALUES
|
|
('2008-12-29',231062944),('2008-12-29',231065764),('2008-12-29',231066124),
|
|
('2008-12-29',231060094),('2008-12-29',231061054),('2008-12-29',231065644),
|
|
('2008-12-29',231064384),('2008-12-29',231064444),('2008-12-29',231073774),
|
|
('2008-12-29',231058594),('2008-12-29',231059374),('2008-12-29',231066004),
|
|
('2008-12-29',231068494),('2008-12-29',231070174),('2008-12-29',231071884),
|
|
('2008-12-29',231063274),('2008-12-29',231063754),('2008-12-29',231064144),
|
|
('2008-12-29',231069424),('2008-12-29',231073714),('2008-12-29',231058414),
|
|
('2008-12-29',231060994),('2008-12-29',231069154),('2008-12-29',231068614),
|
|
('2008-12-29',231071464),('2008-12-29',231074014),('2008-12-29',231059614),
|
|
('2008-12-29',231059074),('2008-12-29',231059464),('2008-12-29',231069094),
|
|
('2008-12-29',231067294),('2008-12-29',231070144),('2008-12-29',231073804),
|
|
('2008-12-29',231072634),('2008-12-29',231058294),('2008-12-29',231065344),
|
|
('2008-12-29',231066094),('2008-12-29',231069034),('2008-12-29',231058594),
|
|
('2008-12-29',231059854),('2008-12-29',231059884),('2008-12-29',231059914),
|
|
('2008-12-29',231063664),('2008-12-29',231063814),('2008-12-29',231063904);
|
|
|
|
CREATE TABLE t3 (
|
|
package_id int default NULL,
|
|
INDEX package_id(package_id)
|
|
);
|
|
INSERT INTO t3 VALUES
|
|
(231058294),(231058324),(231058354),(231058384),(231058414),(231058444),
|
|
(231058474),(231058504),(231058534),(231058564),(231058594),(231058624),
|
|
(231058684),(231058744),(231058804),(231058864),(231058924),(231058954),
|
|
(231059014),(231059074),(231059104),(231059134),(231059164),(231059194),
|
|
(231059224),(231059254),(231059284),(231059314),(231059344),(231059374),
|
|
(231059404),(231059434),(231059464),(231059494),(231059524),(231059554),
|
|
(231059584),(231059614),(231059644),(231059674),(231059704),(231059734),
|
|
(231059764),(231059794),(231059824),(231059854),(231059884),(231059914),
|
|
(231059944),(231059974),(231060004),(231060034),(231060064),(231060094),
|
|
(231060124),(231060154),(231060184),(231060214),(231060244),(231060274),
|
|
(231060304),(231060334),(231060364),(231060394),(231060424),(231060454),
|
|
(231060484),(231060514),(231060544),(231060574),(231060604),(231060634),
|
|
(231060664),(231060694),(231060724),(231060754),(231060784),(231060814),
|
|
(231060844),(231060874),(231060904),(231060934),(231060964),(231060994),
|
|
(231061024),(231061054),(231061084),(231061144),(231061174),(231061204),
|
|
(231061234),(231061294),(231061354),(231061384),(231061414),(231061474),
|
|
(231061564),(231061594),(231061624),(231061684),(231061714),(231061774),
|
|
(231061804),(231061894),(231061984),(231062074),(231062134),(231062224),
|
|
(231062254),(231062314),(231062374),(231062434),(231062494),(231062554),
|
|
(231062584),(231062614),(231062644),(231062704),(231062734),(231062794),
|
|
(231062854),(231062884),(231062944),(231063004),(231063034),(231063064),
|
|
(231063124),(231063154),(231063184),(231063214),(231063274),(231063334),
|
|
(231063394),(231063424),(231063454),(231063514),(231063574),(231063664);
|
|
|
|
CREATE TABLE t4 (
|
|
carrier char(2) NOT NULL default '' PRIMARY KEY,
|
|
id int(11) default NULL,
|
|
INDEX id(id)
|
|
);
|
|
INSERT INTO t4 VALUES
|
|
('99',6),('SK',456),('UA',486),('AI',1081),('OS',1111),('VS',1510);
|
|
|
|
CREATE TABLE t5 (
|
|
carrier_id int default NULL,
|
|
INDEX carrier_id(carrier_id)
|
|
);
|
|
INSERT INTO t5 VALUES
|
|
(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),
|
|
(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),
|
|
(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),
|
|
(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),
|
|
(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),
|
|
(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),(6),(456),(456),(456),
|
|
(456),(456),(456),(456),(456),(456),(456),(456),(456),(456),(456),(456),
|
|
(456),(486),(1081),(1111),(1111),(1111),(1111),(1510);
|
|
|
|
SELECT COUNT(*)
|
|
FROM((t2 JOIN t1 ON t2.package_id = t1.id)
|
|
JOIN t3 ON t3.package_id = t1.id);
|
|
|
|
EXPLAIN
|
|
SELECT COUNT(*)
|
|
FROM ((t2 JOIN t1 ON t2.package_id = t1.id)
|
|
JOIN t3 ON t3.package_id = t1.id)
|
|
LEFT JOIN
|
|
(t5 JOIN t4 ON t5.carrier_id = t4.id)
|
|
ON t4.carrier = t1.carrier;
|
|
SELECT COUNT(*)
|
|
FROM ((t2 JOIN t1 ON t2.package_id = t1.id)
|
|
JOIN t3 ON t3.package_id = t1.id)
|
|
LEFT JOIN
|
|
(t5 JOIN t4 ON t5.carrier_id = t4.id)
|
|
ON t4.carrier = t1.carrier;
|
|
|
|
DROP TABLE t1,t2,t3,t4,t5;
|
|
|
|
#
|
|
# BUG#49322: Nested left joins + not-exist optimization
|
|
#
|
|
|
|
CREATE TABLE t1 (
|
|
pk int NOT NULL AUTO_INCREMENT PRIMARY KEY,
|
|
a int DEFAULT NULL,
|
|
KEY idx(a)
|
|
);
|
|
CREATE TABLE t2 (
|
|
pk int NOT NULL AUTO_INCREMENT PRIMARY KEY,
|
|
a int DEFAULT NULL,
|
|
KEY idx(a)
|
|
);
|
|
CREATE TABLE t3 (
|
|
pk int NOT NULL AUTO_INCREMENT PRIMARY KEY,
|
|
a int DEFAULT NULL,
|
|
KEY idx(a)
|
|
);
|
|
|
|
INSERT INTO t1 VALUES
|
|
(1,2), (2,7), (3,5), (4,7), (5,5), (6,NULL), (7,NULL), (8,9);
|
|
INSERT INTO t2 VALUES
|
|
(1,NULL), (4,2), (5,2), (3,4), (2,8);
|
|
INSERT INTO t3 VALUES
|
|
(1,9), (2,2), (3,5), (4,2), (5,7), (6,0), (7,5);
|
|
|
|
SELECT t1.pk, t1.a, t2.pk, t2.a,t3.pk, t3.a
|
|
FROM t1 LEFT JOIN (t2 LEFT JOIN t3 ON t3.a=t2.a) ON t2.a=t1.a;
|
|
|
|
SELECT t1.pk, t1.a, t2.pk, t2.a,t3.pk, t3.a
|
|
FROM t1 LEFT JOIN (t2 LEFT JOIN t3 ON t3.a=t2.a) ON t2.a=t1.a
|
|
WHERE t2.pk IS NULL;
|
|
|
|
SELECT t1.pk, t1.a, t2.pk, t2.a,t3.pk, t3.a
|
|
FROM t1 LEFT JOIN (t2 LEFT JOIN t3 ON t3.a=t2.a) ON t2.a=t1.a
|
|
WHERE t3.pk IS NULL;
|
|
|
|
DROP TABLE t1, t2, t3;
|
|
|
|
|
|
#
|
|
# LP BUG#817360: Nested left joins + not-exist optimization
|
|
#
|
|
|
|
CREATE TABLE t1 (a int NOT NULL );
|
|
INSERT INTO t1 VALUES (9), (9);
|
|
|
|
CREATE TABLE t2 (a int NOT NULL );
|
|
INSERT INTO t2 VALUES (9);
|
|
|
|
CREATE TABLE t3 (a int NOT NULL, b int);
|
|
INSERT INTO t3 VALUES (19,9);
|
|
|
|
CREATE TABLE t4 (b int) ;
|
|
|
|
SELECT * FROM t1 LEFT JOIN
|
|
((t2 LEFT JOIN t3 ON t2.a=t3.b) LEFT JOIN t4 ON t3.a=t4.b)
|
|
ON t1.a=t2.a;
|
|
SELECT * FROM t1 LEFT JOIN
|
|
((t2 LEFT JOIN t3 ON t2.a=t3.b) LEFT JOIN t4 ON t3.a=t4.b)
|
|
ON t1.a=t2.a
|
|
WHERE t3.a IS NULL;
|
|
EXPLAIN EXTENDED
|
|
SELECT * FROM t1 LEFT JOIN
|
|
((t2 LEFT JOIN t3 ON t2.a=t3.b) LEFT JOIN t4 ON t3.a=t4.b)
|
|
ON t1.a=t2.a
|
|
WHERE t3.a IS NULL;
|
|
|
|
DROP TABLE t1,t2,t3,t4;
|
|
|
|
SET optimizer_switch=@save_optimizer_switch;
|
|
|
|
--echo End of 5.0 tests
|
|
|
|
--echo #
|
|
--echo # MDEV-621: LP:693329 - Assertion `!is_interleave_error' failed on low optimizer_search_depth
|
|
--echo #
|
|
set @tmp_mdev621= @@optimizer_search_depth;
|
|
SET SESSION optimizer_search_depth = 4;
|
|
|
|
CREATE TABLE t1 (f1 int,f2 int,f3 int,f4 int) ;
|
|
INSERT IGNORE INTO t1 VALUES (0,0,2,0),(NULL,0,2,0);
|
|
CREATE TABLE t2 (f1 int) ;
|
|
CREATE TABLE t3 (f3 int,PRIMARY KEY (f3)) ;
|
|
CREATE TABLE t4 (f5 int) ;
|
|
CREATE TABLE t5 (f2 int) ;
|
|
|
|
SELECT alias2.f4 FROM t1 AS alias1
|
|
LEFT JOIN t1 AS alias2
|
|
LEFT JOIN t2 AS alias3
|
|
LEFT JOIN t3 AS alias4 ON alias3.f1 = alias4.f3
|
|
ON alias2.f1
|
|
LEFT JOIN t4 AS alias5
|
|
JOIN t5 ON alias5.f5
|
|
ON alias2.f3 ON alias1.f2;
|
|
DROP TABLE t1,t2,t3,t4,t5;
|
|
|
|
--echo #
|
|
--echo # MDEV-7992: Nested left joins + 'not exists' optimization
|
|
--echo #
|
|
|
|
#view protocol gives different query plan (it doesnt' contain database name)
|
|
--disable_view_protocol
|
|
|
|
CREATE TABLE t1(
|
|
K1 INT PRIMARY KEY,
|
|
Name VARCHAR(15)
|
|
);
|
|
|
|
INSERT INTO t1 VALUES
|
|
(1,'T1Row1'), (2,'T1Row2');
|
|
|
|
|
|
CREATE TABLE t2(
|
|
K2 INT PRIMARY KEY,
|
|
K1r INT,
|
|
rowTimestamp DATETIME,
|
|
Event VARCHAR(15)
|
|
);
|
|
|
|
INSERT INTO t2 VALUES
|
|
(1, 1, '2015-04-13 10:42:11' ,'T1Row1Event1'),
|
|
(2, 1, '2015-04-13 10:42:12' ,'T1Row1Event2'),
|
|
(3, 1, '2015-04-13 10:42:12' ,'T1Row1Event3');
|
|
|
|
let $q1=
|
|
SELECT t1a.*, t2a.*,
|
|
t2i.K2 AS K2B, t2i.K1r AS K1rB,
|
|
t2i.rowTimestamp AS rowTimestampB, t2i.Event AS EventB
|
|
FROM
|
|
t1 t1a JOIN t2 t2a ON t2a.K1r = t1a.K1
|
|
LEFT JOIN
|
|
( t1 t1i LEFT JOIN t2 t2i ON t2i.K1r = t1i.K1)
|
|
ON (t1i.K1 = 1) AND
|
|
(((t2i.K1r = t1a.K1 AND t2i.rowTimestamp > t2a.rowTimestamp ) OR
|
|
(t2i.rowTimestamp = t2a.rowTimestamp AND t2i.K2 > t2a.K2))
|
|
OR (t2i.K2 IS NULL))
|
|
WHERE
|
|
t2a.K1r = 1 AND t2i.K2 IS NULL;
|
|
|
|
eval $q1;
|
|
eval EXPLAIN EXTENDED $q1;
|
|
|
|
CREATE VIEW v1 AS
|
|
SELECT t2i.*
|
|
FROM t1 as t1i LEFT JOIN t2 as t2i ON t2i.K1r = t1i.K1
|
|
WHERE t1i.K1 = 1 ;
|
|
|
|
let $q2=
|
|
SELECT
|
|
t1a.*, t2a.*, t2b.K2 as K2B, t2b.K1r as K1rB,
|
|
t2b.rowTimestamp as rowTimestampB, t2b.Event as EventB
|
|
FROM
|
|
t1 as t1a JOIN t2 as t2a ON t2a.K1r = t1a.K1
|
|
LEFT JOIN
|
|
v1 as t2b
|
|
ON ((t2b.K1r = t1a.K1 AND t2b.rowTimestamp > t2a.rowTimestamp) OR
|
|
(t2b.rowTimestamp = t2a.rowTimestamp AND t2b.K2 > t2a.K2))
|
|
OR (t2b.K2 IS NULL)
|
|
WHERE
|
|
t1a.K1 = 1 AND
|
|
t2b.K2 IS NULL;
|
|
|
|
eval $q2;
|
|
eval EXPLAIN EXTENDED $q2;
|
|
|
|
DROP VIEW v1;
|
|
DROP TABLE t1,t2;
|
|
|
|
--enable_view_protocol
|
|
|
|
set optimizer_search_depth= @tmp_mdev621;
|
|
|
|
--echo #
|
|
--echo # MDEV-19588: Nested left joins using optimized join cache
|
|
--echo #
|
|
|
|
set optimizer_switch='optimize_join_buffer_size=on';
|
|
|
|
set @save_join_cache_level= @@join_cache_level;
|
|
set join_cache_level=2;
|
|
|
|
CREATE TABLE t1 (i1 int, c1 varchar(20), pk int) engine=myisam;
|
|
|
|
CREATE TABLE t2 (pk int, c1 varchar(20), i1 int) engine=myisam;
|
|
INSERT INTO t2 VALUES (7,'a',-912),(8,'a',5);
|
|
|
|
CREATE TABLE t3 (pk int, c1 varchar(20), i1 int) engine=myisam;
|
|
INSERT INTO t3 VALUES
|
|
(1,'a',-145),(2,'a',6),(3,'a',1),(7,'a',NULL),(8,'a',889),(9,'a',146),
|
|
(10,'a',177),(16,'a',-433),(17,'a',NULL),(18,'a',2),(19,'a',3),(20,'a',5),
|
|
(21,'a',-484),(22,'a',369),(23,'a',-192),(24,'a',-163),(25,'a',5),(26,'a',NULL);
|
|
|
|
let $q=
|
|
SELECT t3.*
|
|
FROM t3 LEFT JOIN t1 LEFT JOIN t2 ON t1.i1 = t2.i1 ON t3.i1 = t1.i1
|
|
WHERE t2.pk < 13 OR t3.i1 IS NULL;
|
|
|
|
eval $q;
|
|
eval explain extended $q;
|
|
|
|
DROP TABLE t1,t2,t3;
|
|
|
|
set join_cache_level= @save_join_cache_level;
|
|
|
|
set optimizer_switch=@save_optimizer_switch;
|
|
|
|
--echo #
|
|
--echo # MDEV-27624: Nested left joins with not_exists optimization
|
|
--echo # for most inner left join
|
|
--echo #
|
|
|
|
set @save_join_cache_level= @@join_cache_level;
|
|
|
|
CREATE TABLE t1 (a INT NOT NULL, b INT, c INT);
|
|
INSERT INTO t1 VALUES (1,1,1), (1,2,1), (1,3,1);
|
|
|
|
CREATE TABLE t2(a INT NOT NULL);
|
|
INSERT INTO t2 VALUES (1), (2);
|
|
|
|
CREATE TABLE t3(a INT not null, b INT);
|
|
INSERT INTO t3 VALUES (1, 1), (2, 1), (3, 1);
|
|
|
|
let $q=
|
|
SELECT *
|
|
FROM t1
|
|
LEFT JOIN
|
|
( t2 LEFT JOIN t3 ON t2.a = t3.b )
|
|
ON t2.a = 1 AND (t3.b = t1.a AND t3.a > t1.b OR t3.a is NULL)
|
|
WHERE t1.c = 1 AND t3.a is NULL;
|
|
|
|
set join_cache_level = 0;
|
|
eval EXPLAIN $q;
|
|
eval $q;
|
|
|
|
set join_cache_level = 2;
|
|
eval EXPLAIN $q;
|
|
eval $q;
|
|
|
|
DROP TABLE t1, t2, t3;
|
|
|
|
set join_cache_level= @save_join_cache_level;
|
|
|
|
--echo # end of 10.3 tests
|