File: reopenScan.sql

package info (click to toggle)
derby 10.14.2.0-3
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 79,056 kB
  • sloc: java: 691,961; sql: 42,686; xml: 20,512; sh: 3,373; sed: 96; makefile: 60
file content (122 lines) | stat: -rw-r--r-- 3,319 bytes parent folder | download | duplicates (4)
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
--
--   Licensed to the Apache Software Foundation (ASF) under one or more
--   contributor license agreements.  See the NOTICE file distributed with
--   this work for additional information regarding copyright ownership.
--   The ASF licenses this file to You 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,
--   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
--   See the License for the specific language governing permissions and
--   limitations under the License.
--
--
-- Test reopening scans.  A in subquery generates
-- a lot of reopen requests to the underlying scan.
-- We are used to having to reopen something like a
-- base table scan, but we need to be careful reopening
-- things like join nodes.  This test is to ensure
-- that we don't leave around any state when reopening
-- various complex nodes.


drop table x;
drop table y;
drop table z;
create table x (x int);
create table y (x int);
create table z (x int);

insert into x values 1,2,3;
insert into y values 1,2,3;
insert into z values 3,2,3,2;

select x from y where x in (select x from x);
select x from z where x in (1,2,3);

--
-- nested loop
--

-- one row right side
select x from z where x in (select x from y where x in (select x from x));

-- not one row right side
select x from z where x in (select x.x from x,y where x.x=y.x);

--
-- hash join
--
select x from z where x in (select x.x from x,y where x.x=y.x);

--
-- outer join
--
select x from z where x in (select x.x from x left outer join y on (y.x=x.x));

delete from y;
insert into y values 0,1,5,2,2;
select x.x from x left outer join y on (y.x=x.x);
select x from z where x in (select x.x from x left outer join y on (y.x=x.x));

delete from x;
insert into x values 0,1,5,2,2;
delete from y;
insert into y values 1,2,3;
select x.x from x left outer join y on (y.x=x.x);
select x from z where x in (select x.x from x left outer join y on (y.x=x.x));

insert into z values 1,5;
select x from z where x in (select x.x from x left outer join y on (y.x=x.x));


--
-- aggregate result set
--
delete from x;
delete from y;
delete from z;

insert into x values 1,2,3;
insert into y values 1,2,3;
insert into z values 3,2,666,3,2,null,2;

select x from z where x in (select x from x group by x);
select x from z where x in (select max(x) from x group by x);
select x from z where x in (select max(x) from x);
select x from z where x in (select sum(distinct x) from x group by x);
insert into x values 1,1,2,2,2,5,5,null,6;
select x from z where x in (select sum(distinct x) from x group by x);

--
-- union
--
delete from x;
delete from y;
delete from z;

insert into x values null,2,3;
insert into y values 1,2,null;
insert into z values 3,2,666,3,2,null,2;

select x from z where x in (select x from x union select x from y);

--
-- normalize
--
delete from x;
delete from y;
delete from z;

create table n (x smallint);
insert into n values 1,2,3;
insert into x values 1,2,3;

select * from x where x in (select x from n);