2000-06-09 13:12:38 +02:00
|
|
|
--
|
|
|
|
-- Test inheritance features
|
|
|
|
--
|
|
|
|
CREATE TABLE a (aa TEXT);
|
2001-01-05 07:34:23 +01:00
|
|
|
CREATE TABLE b (bb TEXT) INHERITS (a);
|
|
|
|
CREATE TABLE c (cc TEXT) INHERITS (a);
|
|
|
|
CREATE TABLE d (dd TEXT) INHERITS (b,c,a);
|
2000-06-09 13:12:38 +02:00
|
|
|
|
|
|
|
INSERT INTO a(aa) VALUES('aaa');
|
|
|
|
INSERT INTO a(aa) VALUES('aaaa');
|
|
|
|
INSERT INTO a(aa) VALUES('aaaaa');
|
|
|
|
INSERT INTO a(aa) VALUES('aaaaaa');
|
|
|
|
INSERT INTO a(aa) VALUES('aaaaaaa');
|
|
|
|
INSERT INTO a(aa) VALUES('aaaaaaaa');
|
|
|
|
|
|
|
|
INSERT INTO b(aa) VALUES('bbb');
|
|
|
|
INSERT INTO b(aa) VALUES('bbbb');
|
|
|
|
INSERT INTO b(aa) VALUES('bbbbb');
|
|
|
|
INSERT INTO b(aa) VALUES('bbbbbb');
|
|
|
|
INSERT INTO b(aa) VALUES('bbbbbbb');
|
|
|
|
INSERT INTO b(aa) VALUES('bbbbbbbb');
|
|
|
|
|
|
|
|
INSERT INTO c(aa) VALUES('ccc');
|
|
|
|
INSERT INTO c(aa) VALUES('cccc');
|
|
|
|
INSERT INTO c(aa) VALUES('ccccc');
|
|
|
|
INSERT INTO c(aa) VALUES('cccccc');
|
|
|
|
INSERT INTO c(aa) VALUES('ccccccc');
|
|
|
|
INSERT INTO c(aa) VALUES('cccccccc');
|
|
|
|
|
|
|
|
INSERT INTO d(aa) VALUES('ddd');
|
|
|
|
INSERT INTO d(aa) VALUES('dddd');
|
|
|
|
INSERT INTO d(aa) VALUES('ddddd');
|
|
|
|
INSERT INTO d(aa) VALUES('dddddd');
|
|
|
|
INSERT INTO d(aa) VALUES('ddddddd');
|
|
|
|
INSERT INTO d(aa) VALUES('dddddddd');
|
|
|
|
|
2000-07-03 00:01:27 +02:00
|
|
|
SELECT relname, a.* FROM a, pg_class where a.tableoid = pg_class.oid;
|
|
|
|
SELECT relname, b.* FROM b, pg_class where b.tableoid = pg_class.oid;
|
|
|
|
SELECT relname, c.* FROM c, pg_class where c.tableoid = pg_class.oid;
|
|
|
|
SELECT relname, d.* FROM d, pg_class where d.tableoid = pg_class.oid;
|
|
|
|
SELECT relname, a.* FROM ONLY a, pg_class where a.tableoid = pg_class.oid;
|
|
|
|
SELECT relname, b.* FROM ONLY b, pg_class where b.tableoid = pg_class.oid;
|
|
|
|
SELECT relname, c.* FROM ONLY c, pg_class where c.tableoid = pg_class.oid;
|
|
|
|
SELECT relname, d.* FROM ONLY d, pg_class where d.tableoid = pg_class.oid;
|
2000-06-09 13:12:38 +02:00
|
|
|
|
|
|
|
UPDATE a SET aa='zzzz' WHERE aa='aaaa';
|
|
|
|
UPDATE ONLY a SET aa='zzzzz' WHERE aa='aaaaa';
|
|
|
|
UPDATE b SET aa='zzz' WHERE aa='aaa';
|
|
|
|
UPDATE ONLY b SET aa='zzz' WHERE aa='aaa';
|
|
|
|
UPDATE a SET aa='zzzzzz' WHERE aa LIKE 'aaa%';
|
|
|
|
|
2000-07-03 00:01:27 +02:00
|
|
|
SELECT relname, a.* FROM a, pg_class where a.tableoid = pg_class.oid;
|
|
|
|
SELECT relname, b.* FROM b, pg_class where b.tableoid = pg_class.oid;
|
|
|
|
SELECT relname, c.* FROM c, pg_class where c.tableoid = pg_class.oid;
|
|
|
|
SELECT relname, d.* FROM d, pg_class where d.tableoid = pg_class.oid;
|
|
|
|
SELECT relname, a.* FROM ONLY a, pg_class where a.tableoid = pg_class.oid;
|
|
|
|
SELECT relname, b.* FROM ONLY b, pg_class where b.tableoid = pg_class.oid;
|
|
|
|
SELECT relname, c.* FROM ONLY c, pg_class where c.tableoid = pg_class.oid;
|
|
|
|
SELECT relname, d.* FROM ONLY d, pg_class where d.tableoid = pg_class.oid;
|
2000-06-09 13:12:38 +02:00
|
|
|
|
|
|
|
UPDATE b SET aa='new';
|
|
|
|
|
2000-07-03 00:01:27 +02:00
|
|
|
SELECT relname, a.* FROM a, pg_class where a.tableoid = pg_class.oid;
|
|
|
|
SELECT relname, b.* FROM b, pg_class where b.tableoid = pg_class.oid;
|
|
|
|
SELECT relname, c.* FROM c, pg_class where c.tableoid = pg_class.oid;
|
|
|
|
SELECT relname, d.* FROM d, pg_class where d.tableoid = pg_class.oid;
|
|
|
|
SELECT relname, a.* FROM ONLY a, pg_class where a.tableoid = pg_class.oid;
|
|
|
|
SELECT relname, b.* FROM ONLY b, pg_class where b.tableoid = pg_class.oid;
|
|
|
|
SELECT relname, c.* FROM ONLY c, pg_class where c.tableoid = pg_class.oid;
|
|
|
|
SELECT relname, d.* FROM ONLY d, pg_class where d.tableoid = pg_class.oid;
|
2000-06-09 13:12:38 +02:00
|
|
|
|
|
|
|
UPDATE a SET aa='new';
|
|
|
|
|
|
|
|
DELETE FROM ONLY c WHERE aa='new';
|
|
|
|
|
2000-07-03 00:01:27 +02:00
|
|
|
SELECT relname, a.* FROM a, pg_class where a.tableoid = pg_class.oid;
|
|
|
|
SELECT relname, b.* FROM b, pg_class where b.tableoid = pg_class.oid;
|
|
|
|
SELECT relname, c.* FROM c, pg_class where c.tableoid = pg_class.oid;
|
|
|
|
SELECT relname, d.* FROM d, pg_class where d.tableoid = pg_class.oid;
|
|
|
|
SELECT relname, a.* FROM ONLY a, pg_class where a.tableoid = pg_class.oid;
|
|
|
|
SELECT relname, b.* FROM ONLY b, pg_class where b.tableoid = pg_class.oid;
|
|
|
|
SELECT relname, c.* FROM ONLY c, pg_class where c.tableoid = pg_class.oid;
|
|
|
|
SELECT relname, d.* FROM ONLY d, pg_class where d.tableoid = pg_class.oid;
|
2000-06-09 13:12:38 +02:00
|
|
|
|
|
|
|
DELETE FROM a;
|
|
|
|
|
2000-07-03 00:01:27 +02:00
|
|
|
SELECT relname, a.* FROM a, pg_class where a.tableoid = pg_class.oid;
|
|
|
|
SELECT relname, b.* FROM b, pg_class where b.tableoid = pg_class.oid;
|
|
|
|
SELECT relname, c.* FROM c, pg_class where c.tableoid = pg_class.oid;
|
|
|
|
SELECT relname, d.* FROM d, pg_class where d.tableoid = pg_class.oid;
|
|
|
|
SELECT relname, a.* FROM ONLY a, pg_class where a.tableoid = pg_class.oid;
|
|
|
|
SELECT relname, b.* FROM ONLY b, pg_class where b.tableoid = pg_class.oid;
|
|
|
|
SELECT relname, c.* FROM ONLY c, pg_class where c.tableoid = pg_class.oid;
|
|
|
|
SELECT relname, d.* FROM ONLY d, pg_class where d.tableoid = pg_class.oid;
|
2003-01-02 20:29:22 +01:00
|
|
|
|
|
|
|
-- Confirm PRIMARY KEY adds NOT NULL constraint to child table
|
|
|
|
CREATE TEMP TABLE z (b TEXT, PRIMARY KEY(aa, b)) inherits (a);
|
|
|
|
INSERT INTO z VALUES (NULL, 'text'); -- should fail
|
2003-03-05 21:01:04 +01:00
|
|
|
|
|
|
|
-- Check UPDATE with inherited target and an inherited source table
|
|
|
|
create temp table foo(f1 int, f2 int);
|
|
|
|
create temp table foo2(f3 int) inherits (foo);
|
|
|
|
create temp table bar(f1 int, f2 int);
|
|
|
|
create temp table bar2(f3 int) inherits (bar);
|
|
|
|
|
|
|
|
insert into foo values(1,1);
|
|
|
|
insert into foo values(3,3);
|
|
|
|
insert into foo2 values(2,2,2);
|
|
|
|
insert into foo2 values(3,3,3);
|
|
|
|
insert into bar values(1,1);
|
|
|
|
insert into bar values(2,2);
|
|
|
|
insert into bar values(3,3);
|
|
|
|
insert into bar values(4,4);
|
|
|
|
insert into bar2 values(1,1,1);
|
|
|
|
insert into bar2 values(2,2,2);
|
|
|
|
insert into bar2 values(3,3,3);
|
|
|
|
insert into bar2 values(4,4,4);
|
|
|
|
|
|
|
|
update bar set f2 = f2 + 100 where f1 in (select f1 from foo);
|
|
|
|
|
2013-12-14 23:33:53 +01:00
|
|
|
select tableoid::regclass::text as relname, bar.* from bar order by 1,2;
|
|
|
|
|
|
|
|
-- Check UPDATE with inherited target and an appendrel subquery
|
|
|
|
update bar set f2 = f2 + 100
|
|
|
|
from
|
|
|
|
( select f1 from foo union all select f1+3 from foo ) ss
|
|
|
|
where bar.f1 = ss.f1;
|
|
|
|
|
|
|
|
select tableoid::regclass::text as relname, bar.* from bar order by 1,2;
|
2003-06-25 05:40:19 +02:00
|
|
|
|
2009-10-06 02:55:26 +02:00
|
|
|
/* Test multiple inheritance of column defaults */
|
|
|
|
|
|
|
|
CREATE TABLE firstparent (tomorrow date default now()::date + 1);
|
|
|
|
CREATE TABLE secondparent (tomorrow date default now() :: date + 1);
|
|
|
|
CREATE TABLE jointchild () INHERITS (firstparent, secondparent); -- ok
|
|
|
|
CREATE TABLE thirdparent (tomorrow date default now()::date - 1);
|
|
|
|
CREATE TABLE otherchild () INHERITS (firstparent, thirdparent); -- not ok
|
|
|
|
CREATE TABLE otherchild (tomorrow date default now())
|
|
|
|
INHERITS (firstparent, thirdparent); -- ok, child resolves ambiguous default
|
|
|
|
|
|
|
|
DROP TABLE firstparent, secondparent, jointchild, thirdparent, otherchild;
|
2003-06-25 05:40:19 +02:00
|
|
|
|
2004-05-05 06:48:48 +02:00
|
|
|
-- Test changing the type of inherited columns
|
|
|
|
insert into d values('test','one','two','three');
|
|
|
|
alter table a alter column aa type integer using bit_length(aa);
|
|
|
|
select * from d;
|
2004-12-12 23:49:50 +01:00
|
|
|
|
2011-12-05 19:10:18 +01:00
|
|
|
-- Test non-inheritable parent constraints
|
|
|
|
create table p1(ff1 int);
|
2012-07-24 21:49:54 +02:00
|
|
|
alter table p1 add constraint p1chk check (ff1 > 0) no inherit;
|
2011-12-05 19:10:18 +01:00
|
|
|
alter table p1 add constraint p2chk check (ff1 > 10);
|
2012-04-21 04:46:20 +02:00
|
|
|
-- connoinherit should be true for NO INHERIT constraint
|
|
|
|
select pc.relname, pgc.conname, pgc.contype, pgc.conislocal, pgc.coninhcount, pgc.connoinherit from pg_class as pc inner join pg_constraint as pgc on (pgc.conrelid = pc.oid) where pc.relname = 'p1' order by 1,2;
|
2011-12-05 19:10:18 +01:00
|
|
|
|
2012-04-21 04:46:20 +02:00
|
|
|
-- Test that child does not inherit NO INHERIT constraints
|
2011-12-05 19:10:18 +01:00
|
|
|
create table c1 () inherits (p1);
|
|
|
|
\d p1
|
|
|
|
\d c1
|
|
|
|
|
|
|
|
drop table p1 cascade;
|
|
|
|
|
2004-12-12 23:49:50 +01:00
|
|
|
-- Tests for casting between the rowtypes of parent and child
|
|
|
|
-- tables. See the pgsql-hackers thread beginning Dec. 4/04
|
|
|
|
create table base (i integer);
|
|
|
|
create table derived () inherits (base);
|
|
|
|
insert into derived (i) values (0);
|
|
|
|
select derived::base from derived;
|
|
|
|
drop table derived;
|
|
|
|
drop table base;
|
|
|
|
|
|
|
|
create table p1(ff1 int);
|
|
|
|
create table p2(f1 text);
|
|
|
|
create function p2text(p2) returns text as 'select $1.f1' language sql;
|
|
|
|
create table c1(f3 int) inherits(p1,p2);
|
|
|
|
insert into c1 values(123456789, 'hi', 42);
|
|
|
|
select p2text(c1.*) from c1;
|
|
|
|
drop function p2text(p2);
|
|
|
|
drop table c1;
|
|
|
|
drop table p2;
|
|
|
|
drop table p1;
|
2008-05-10 01:32:05 +02:00
|
|
|
|
|
|
|
CREATE TABLE ac (aa TEXT);
|
|
|
|
alter table ac add constraint ac_check check (aa is not null);
|
|
|
|
CREATE TABLE bc (bb TEXT) INHERITS (ac);
|
|
|
|
select pc.relname, pgc.conname, pgc.contype, pgc.conislocal, pgc.coninhcount, pgc.consrc from pg_class as pc inner join pg_constraint as pgc on (pgc.conrelid = pc.oid) where pc.relname in ('ac', 'bc') order by 1,2;
|
|
|
|
|
|
|
|
insert into ac (aa) values (NULL);
|
|
|
|
insert into bc (aa) values (NULL);
|
|
|
|
|
|
|
|
alter table bc drop constraint ac_check; -- fail, disallowed
|
|
|
|
alter table ac drop constraint ac_check;
|
|
|
|
select pc.relname, pgc.conname, pgc.contype, pgc.conislocal, pgc.coninhcount, pgc.consrc from pg_class as pc inner join pg_constraint as pgc on (pgc.conrelid = pc.oid) where pc.relname in ('ac', 'bc') order by 1,2;
|
|
|
|
|
|
|
|
-- try the unnamed-constraint case
|
|
|
|
alter table ac add check (aa is not null);
|
|
|
|
select pc.relname, pgc.conname, pgc.contype, pgc.conislocal, pgc.coninhcount, pgc.consrc from pg_class as pc inner join pg_constraint as pgc on (pgc.conrelid = pc.oid) where pc.relname in ('ac', 'bc') order by 1,2;
|
|
|
|
|
|
|
|
insert into ac (aa) values (NULL);
|
|
|
|
insert into bc (aa) values (NULL);
|
|
|
|
|
|
|
|
alter table bc drop constraint ac_aa_check; -- fail, disallowed
|
|
|
|
alter table ac drop constraint ac_aa_check;
|
|
|
|
select pc.relname, pgc.conname, pgc.contype, pgc.conislocal, pgc.coninhcount, pgc.consrc from pg_class as pc inner join pg_constraint as pgc on (pgc.conrelid = pc.oid) where pc.relname in ('ac', 'bc') order by 1,2;
|
|
|
|
|
|
|
|
alter table ac add constraint ac_check check (aa is not null);
|
|
|
|
alter table bc no inherit ac;
|
|
|
|
select pc.relname, pgc.conname, pgc.contype, pgc.conislocal, pgc.coninhcount, pgc.consrc from pg_class as pc inner join pg_constraint as pgc on (pgc.conrelid = pc.oid) where pc.relname in ('ac', 'bc') order by 1,2;
|
|
|
|
alter table bc drop constraint ac_check;
|
|
|
|
select pc.relname, pgc.conname, pgc.contype, pgc.conislocal, pgc.coninhcount, pgc.consrc from pg_class as pc inner join pg_constraint as pgc on (pgc.conrelid = pc.oid) where pc.relname in ('ac', 'bc') order by 1,2;
|
|
|
|
alter table ac drop constraint ac_check;
|
|
|
|
select pc.relname, pgc.conname, pgc.contype, pgc.conislocal, pgc.coninhcount, pgc.consrc from pg_class as pc inner join pg_constraint as pgc on (pgc.conrelid = pc.oid) where pc.relname in ('ac', 'bc') order by 1,2;
|
|
|
|
|
|
|
|
drop table bc;
|
|
|
|
drop table ac;
|
|
|
|
|
|
|
|
create table ac (a int constraint check_a check (a <> 0));
|
|
|
|
create table bc (a int constraint check_a check (a <> 0), b int constraint check_b check (b <> 0)) inherits (ac);
|
|
|
|
select pc.relname, pgc.conname, pgc.contype, pgc.conislocal, pgc.coninhcount, pgc.consrc from pg_class as pc inner join pg_constraint as pgc on (pgc.conrelid = pc.oid) where pc.relname in ('ac', 'bc') order by 1,2;
|
|
|
|
|
|
|
|
drop table bc;
|
|
|
|
drop table ac;
|
|
|
|
|
|
|
|
create table ac (a int constraint check_a check (a <> 0));
|
|
|
|
create table bc (b int constraint check_b check (b <> 0));
|
|
|
|
create table cc (c int constraint check_c check (c <> 0)) inherits (ac, bc);
|
|
|
|
select pc.relname, pgc.conname, pgc.contype, pgc.conislocal, pgc.coninhcount, pgc.consrc from pg_class as pc inner join pg_constraint as pgc on (pgc.conrelid = pc.oid) where pc.relname in ('ac', 'bc', 'cc') order by 1,2;
|
|
|
|
|
|
|
|
alter table cc no inherit bc;
|
|
|
|
select pc.relname, pgc.conname, pgc.contype, pgc.conislocal, pgc.coninhcount, pgc.consrc from pg_class as pc inner join pg_constraint as pgc on (pgc.conrelid = pc.oid) where pc.relname in ('ac', 'bc', 'cc') order by 1,2;
|
|
|
|
|
|
|
|
drop table cc;
|
|
|
|
drop table bc;
|
|
|
|
drop table ac;
|
|
|
|
|
|
|
|
create table p1(f1 int);
|
|
|
|
create table p2(f2 int);
|
|
|
|
create table c1(f3 int) inherits(p1,p2);
|
|
|
|
insert into c1 values(1,-1,2);
|
|
|
|
alter table p2 add constraint cc check (f2>0); -- fail
|
|
|
|
alter table p2 add check (f2>0); -- check it without a name, too
|
|
|
|
delete from c1;
|
|
|
|
insert into c1 values(1,1,2);
|
|
|
|
alter table p2 add check (f2>0);
|
|
|
|
insert into c1 values(1,-1,2); -- fail
|
|
|
|
create table c2(f3 int) inherits(p1,p2);
|
|
|
|
\d c2
|
|
|
|
create table c3 (f4 int) inherits(c1,c2);
|
|
|
|
\d c3
|
|
|
|
drop table p1 cascade;
|
|
|
|
drop table p2 cascade;
|
|
|
|
|
|
|
|
create table pp1 (f1 int);
|
|
|
|
create table cc1 (f2 text, f3 int) inherits (pp1);
|
|
|
|
alter table pp1 add column a1 int check (a1 > 0);
|
|
|
|
\d cc1
|
|
|
|
create table cc2(f4 float) inherits(pp1,cc1);
|
|
|
|
\d cc2
|
|
|
|
alter table pp1 add column a2 int check (a2 > 0);
|
|
|
|
\d cc2
|
|
|
|
drop table pp1 cascade;
|
2009-10-12 21:49:24 +02:00
|
|
|
|
2010-02-01 20:28:56 +01:00
|
|
|
-- Test for renaming in simple multiple inheritance
|
2012-01-07 13:58:13 +01:00
|
|
|
CREATE TABLE inht1 (a int, b int);
|
|
|
|
CREATE TABLE inhs1 (b int, c int);
|
|
|
|
CREATE TABLE inhts (d int) INHERITS (inht1, inhs1);
|
2010-02-01 20:28:56 +01:00
|
|
|
|
2012-01-07 13:58:13 +01:00
|
|
|
ALTER TABLE inht1 RENAME a TO aa;
|
|
|
|
ALTER TABLE inht1 RENAME b TO bb; -- to be failed
|
|
|
|
ALTER TABLE inhts RENAME aa TO aaa; -- to be failed
|
|
|
|
ALTER TABLE inhts RENAME d TO dd;
|
|
|
|
\d+ inhts
|
2010-02-01 20:28:56 +01:00
|
|
|
|
2012-01-07 13:58:13 +01:00
|
|
|
DROP TABLE inhts;
|
2010-02-01 20:28:56 +01:00
|
|
|
|
|
|
|
-- Test for renaming in diamond inheritance
|
2012-01-07 13:58:13 +01:00
|
|
|
CREATE TABLE inht2 (x int) INHERITS (inht1);
|
|
|
|
CREATE TABLE inht3 (y int) INHERITS (inht1);
|
|
|
|
CREATE TABLE inht4 (z int) INHERITS (inht2, inht3);
|
2010-02-01 20:28:56 +01:00
|
|
|
|
2012-01-07 13:58:13 +01:00
|
|
|
ALTER TABLE inht1 RENAME aa TO aaa;
|
|
|
|
\d+ inht4
|
2010-02-01 20:28:56 +01:00
|
|
|
|
2012-01-07 13:58:13 +01:00
|
|
|
CREATE TABLE inhts (d int) INHERITS (inht2, inhs1);
|
|
|
|
ALTER TABLE inht1 RENAME aaa TO aaaa;
|
|
|
|
ALTER TABLE inht1 RENAME b TO bb; -- to be failed
|
|
|
|
\d+ inhts
|
2010-02-01 20:28:56 +01:00
|
|
|
|
|
|
|
WITH RECURSIVE r AS (
|
2012-01-07 13:58:13 +01:00
|
|
|
SELECT 'inht1'::regclass AS inhrelid
|
2010-02-01 20:28:56 +01:00
|
|
|
UNION ALL
|
|
|
|
SELECT c.inhrelid FROM pg_inherits c, r WHERE r.inhrelid = c.inhparent
|
|
|
|
)
|
|
|
|
SELECT a.attrelid::regclass, a.attname, a.attinhcount, e.expected
|
|
|
|
FROM (SELECT inhrelid, count(*) AS expected FROM pg_inherits
|
|
|
|
WHERE inhparent IN (SELECT inhrelid FROM r) GROUP BY inhrelid) e
|
|
|
|
JOIN pg_attribute a ON e.inhrelid = a.attrelid WHERE NOT attislocal
|
2010-02-02 19:16:10 +01:00
|
|
|
ORDER BY a.attrelid::regclass::name, a.attnum;
|
2010-02-01 20:28:56 +01:00
|
|
|
|
2012-01-07 13:58:13 +01:00
|
|
|
DROP TABLE inht1, inhs1 CASCADE;
|
2010-10-14 22:56:39 +02:00
|
|
|
|
2012-07-20 18:33:34 +02:00
|
|
|
|
|
|
|
-- Test non-inheritable indices [UNIQUE, EXCLUDE] contraints
|
|
|
|
CREATE TABLE test_constraints (id int, val1 varchar, val2 int, UNIQUE(val1, val2));
|
|
|
|
CREATE TABLE test_constraints_inh () INHERITS (test_constraints);
|
|
|
|
\d+ test_constraints
|
|
|
|
ALTER TABLE ONLY test_constraints DROP CONSTRAINT test_constraints_val1_val2_key;
|
|
|
|
\d+ test_constraints
|
|
|
|
\d+ test_constraints_inh
|
|
|
|
DROP TABLE test_constraints_inh;
|
|
|
|
DROP TABLE test_constraints;
|
|
|
|
|
2012-07-22 06:01:19 +02:00
|
|
|
CREATE TABLE test_ex_constraints (
|
2012-07-20 18:33:34 +02:00
|
|
|
c circle,
|
|
|
|
EXCLUDE USING gist (c WITH &&)
|
|
|
|
);
|
2012-07-22 06:01:19 +02:00
|
|
|
CREATE TABLE test_ex_constraints_inh () INHERITS (test_ex_constraints);
|
|
|
|
\d+ test_ex_constraints
|
|
|
|
ALTER TABLE test_ex_constraints DROP CONSTRAINT test_ex_constraints_c_excl;
|
|
|
|
\d+ test_ex_constraints
|
|
|
|
\d+ test_ex_constraints_inh
|
|
|
|
DROP TABLE test_ex_constraints_inh;
|
|
|
|
DROP TABLE test_ex_constraints;
|
2012-07-20 18:33:34 +02:00
|
|
|
|
|
|
|
-- Test non-inheritable foreign key contraints
|
|
|
|
CREATE TABLE test_primary_constraints(id int PRIMARY KEY);
|
|
|
|
CREATE TABLE test_foreign_constraints(id1 int REFERENCES test_primary_constraints(id));
|
|
|
|
CREATE TABLE test_foreign_constraints_inh () INHERITS (test_foreign_constraints);
|
|
|
|
\d+ test_primary_constraints
|
|
|
|
\d+ test_foreign_constraints
|
|
|
|
ALTER TABLE test_foreign_constraints DROP CONSTRAINT test_foreign_constraints_id1_fkey;
|
|
|
|
\d+ test_foreign_constraints
|
|
|
|
\d+ test_foreign_constraints_inh
|
|
|
|
DROP TABLE test_foreign_constraints_inh;
|
|
|
|
DROP TABLE test_foreign_constraints;
|
|
|
|
DROP TABLE test_primary_constraints;
|
|
|
|
|
Revise parameterized-path mechanism to fix assorted issues.
This patch adjusts the treatment of parameterized paths so that all paths
with the same parameterization (same set of required outer rels) for the
same relation will have the same rowcount estimate. We cache the rowcount
estimates to ensure that property, and hopefully save a few cycles too.
Doing this makes it practical for add_path_precheck to operate without
a rowcount estimate: it need only assume that paths with different
parameterizations never dominate each other, which is close enough to
true anyway for coarse filtering, because normally a more-parameterized
path should yield fewer rows thanks to having more join clauses to apply.
In add_path, we do the full nine yards of comparing rowcount estimates
along with everything else, so that we can discard parameterized paths that
don't actually have an advantage. This fixes some issues I'd found with
add_path rejecting parameterized paths on the grounds that they were more
expensive than not-parameterized ones, even though they yielded many fewer
rows and hence would be cheaper once subsequent joining was considered.
To make the same-rowcounts assumption valid, we have to require that any
parameterized path enforce *all* join clauses that could be obtained from
the particular set of outer rels, even if not all of them are useful for
indexing. This is required at both base scans and joins. It's a good
thing anyway since the net impact is that join quals are checked at the
lowest practical level in the join tree. Hence, discard the original
rather ad-hoc mechanism for choosing parameterization joinquals, and build
a better one that has a more principled rule for when clauses can be moved.
The original rule was actually buggy anyway for lack of knowledge about
which relations are part of an outer join's outer side; getting this right
requires adding an outer_relids field to RestrictInfo.
2012-04-19 21:52:46 +02:00
|
|
|
--
|
|
|
|
-- Test parameterized append plans for inheritance trees
|
|
|
|
--
|
|
|
|
|
|
|
|
create temp table patest0 (id, x) as
|
|
|
|
select x, x from generate_series(0,1000) x;
|
|
|
|
create temp table patest1() inherits (patest0);
|
|
|
|
insert into patest1
|
|
|
|
select x, x from generate_series(0,1000) x;
|
|
|
|
create temp table patest2() inherits (patest0);
|
|
|
|
insert into patest2
|
|
|
|
select x, x from generate_series(0,1000) x;
|
|
|
|
create index patest0i on patest0(id);
|
|
|
|
create index patest1i on patest1(id);
|
|
|
|
create index patest2i on patest2(id);
|
|
|
|
analyze patest0;
|
|
|
|
analyze patest1;
|
|
|
|
analyze patest2;
|
|
|
|
|
|
|
|
explain (costs off)
|
|
|
|
select * from patest0 join (select f1 from int4_tbl limit 1) ss on id = f1;
|
|
|
|
select * from patest0 join (select f1 from int4_tbl limit 1) ss on id = f1;
|
|
|
|
|
|
|
|
drop index patest2i;
|
|
|
|
|
|
|
|
explain (costs off)
|
|
|
|
select * from patest0 join (select f1 from int4_tbl limit 1) ss on id = f1;
|
|
|
|
select * from patest0 join (select f1 from int4_tbl limit 1) ss on id = f1;
|
|
|
|
|
|
|
|
drop table patest0 cascade;
|
|
|
|
|
2010-10-14 22:56:39 +02:00
|
|
|
--
|
|
|
|
-- Test merge-append plans for inheritance trees
|
|
|
|
--
|
|
|
|
|
|
|
|
create table matest0 (id serial primary key, name text);
|
|
|
|
create table matest1 (id integer primary key) inherits (matest0);
|
|
|
|
create table matest2 (id integer primary key) inherits (matest0);
|
|
|
|
create table matest3 (id integer primary key) inherits (matest0);
|
|
|
|
|
|
|
|
create index matest0i on matest0 ((1-id));
|
|
|
|
create index matest1i on matest1 ((1-id));
|
|
|
|
-- create index matest2i on matest2 ((1-id)); -- intentionally missing
|
|
|
|
create index matest3i on matest3 ((1-id));
|
|
|
|
|
|
|
|
insert into matest1 (name) values ('Test 1');
|
|
|
|
insert into matest1 (name) values ('Test 2');
|
|
|
|
insert into matest2 (name) values ('Test 3');
|
|
|
|
insert into matest2 (name) values ('Test 4');
|
|
|
|
insert into matest3 (name) values ('Test 5');
|
|
|
|
insert into matest3 (name) values ('Test 6');
|
|
|
|
|
|
|
|
set enable_indexscan = off; -- force use of seqscan/sort, so no merge
|
|
|
|
explain (verbose, costs off) select * from matest0 order by 1-id;
|
|
|
|
select * from matest0 order by 1-id;
|
Fix generation of MergeAppend plans for optimized min/max on expressions.
Before jamming a desired targetlist into a plan node, one really ought to
make sure the plan node can handle projections, and insert a buffering
Result plan node if not. planagg.c forgot to do this, which is a hangover
from the days when it only dealt with IndexScan plan types. MergeAppend
doesn't project though, not to mention that it gets unhappy if you remove
its possibly-resjunk sort columns. The code accidentally failed to fail
for cases in which the min/max argument was a simple Var, because the new
targetlist would be equivalent to the original "flat" tlist anyway.
For any more complex case, it's been broken since 9.1 where we introduced
the ability to optimize min/max using MergeAppend, as reported by Raphael
Bauduin. Fix by duplicating the logic from grouping_planner that decides
whether we need a Result node.
In 9.2 and 9.1, this requires back-porting the tlist_same_exprs() function
introduced in commit 4387cf956b9eb13aad569634e0c4df081d76e2e3, else we'd
uselessly add a Result node in cases that worked before. It's rather
tempting to back-patch that whole commit so that we can avoid extra Result
nodes in mainline cases too; but I'll refrain, since that code hasn't
really seen all that much field testing yet.
2013-11-07 19:13:12 +01:00
|
|
|
explain (verbose, costs off) select min(1-id) from matest0;
|
|
|
|
select min(1-id) from matest0;
|
2010-10-14 22:56:39 +02:00
|
|
|
reset enable_indexscan;
|
|
|
|
|
|
|
|
set enable_seqscan = off; -- plan with fewest seqscans should be merge
|
|
|
|
explain (verbose, costs off) select * from matest0 order by 1-id;
|
|
|
|
select * from matest0 order by 1-id;
|
Fix generation of MergeAppend plans for optimized min/max on expressions.
Before jamming a desired targetlist into a plan node, one really ought to
make sure the plan node can handle projections, and insert a buffering
Result plan node if not. planagg.c forgot to do this, which is a hangover
from the days when it only dealt with IndexScan plan types. MergeAppend
doesn't project though, not to mention that it gets unhappy if you remove
its possibly-resjunk sort columns. The code accidentally failed to fail
for cases in which the min/max argument was a simple Var, because the new
targetlist would be equivalent to the original "flat" tlist anyway.
For any more complex case, it's been broken since 9.1 where we introduced
the ability to optimize min/max using MergeAppend, as reported by Raphael
Bauduin. Fix by duplicating the logic from grouping_planner that decides
whether we need a Result node.
In 9.2 and 9.1, this requires back-porting the tlist_same_exprs() function
introduced in commit 4387cf956b9eb13aad569634e0c4df081d76e2e3, else we'd
uselessly add a Result node in cases that worked before. It's rather
tempting to back-patch that whole commit so that we can avoid extra Result
nodes in mainline cases too; but I'll refrain, since that code hasn't
really seen all that much field testing yet.
2013-11-07 19:13:12 +01:00
|
|
|
explain (verbose, costs off) select min(1-id) from matest0;
|
|
|
|
select min(1-id) from matest0;
|
2010-10-14 22:56:39 +02:00
|
|
|
reset enable_seqscan;
|
|
|
|
|
|
|
|
drop table matest0 cascade;
|
2011-11-09 03:14:21 +01:00
|
|
|
|
Fix eclass_useful_for_merging to give valid results for appendrel children.
Formerly, this function would always return "true" for an appendrel child
relation, because it would think that the appendrel parent was a potential
join target for the child. In principle that should only lead to some
inefficiency in planning, but fuzz testing by Andreas Seltenreich disclosed
that it could lead to "could not find pathkey item to sort" planner errors
in odd corner cases. Specifically, we would think that all columns of a
child table's multicolumn index were interesting pathkeys, causing us to
generate a MergeAppend path that sorts by all the columns. However, if any
of those columns weren't actually used above the level of the appendrel,
they would not get added to that rel's targetlist, which would result in
being unable to resolve the MergeAppend's sort keys against its targetlist
during createplan.c.
Backpatch to 9.3. In older versions, columns of an appendrel get added
to its targetlist even if they're not mentioned above the scan level,
so that the failure doesn't occur. It might be worth back-patching this
fix to older versions anyway, but I'll refrain for the moment.
2015-08-07 02:14:37 +02:00
|
|
|
--
|
|
|
|
-- Check that use of an index with an extraneous column doesn't produce
|
|
|
|
-- a plan with extraneous sorting
|
|
|
|
--
|
|
|
|
|
|
|
|
create table matest0 (a int, b int, c int, d int);
|
|
|
|
create table matest1 () inherits(matest0);
|
|
|
|
create index matest0i on matest0 (b, c);
|
|
|
|
create index matest1i on matest1 (b, c);
|
|
|
|
|
|
|
|
set enable_nestloop = off; -- we want a plan with two MergeAppends
|
|
|
|
|
|
|
|
explain (costs off)
|
|
|
|
select t1.* from matest0 t1, matest0 t2
|
|
|
|
where t1.b = t2.b and t2.c = t2.d
|
|
|
|
order by t1.b limit 10;
|
|
|
|
|
|
|
|
reset enable_nestloop;
|
|
|
|
|
|
|
|
drop table matest0 cascade;
|
|
|
|
|
2011-11-09 03:14:21 +01:00
|
|
|
--
|
|
|
|
-- Test merge-append for UNION ALL append relations
|
|
|
|
--
|
|
|
|
|
|
|
|
set enable_seqscan = off;
|
|
|
|
set enable_indexscan = on;
|
|
|
|
set enable_bitmapscan = off;
|
|
|
|
|
Revisit handling of UNION ALL subqueries with non-Var output columns.
In commit 57664ed25e5dea117158a2e663c29e60b3546e1c I tried to fix a bug
reported by Teodor Sigaev by making non-simple-Var output columns distinct
(by wrapping their expressions with dummy PlaceHolderVar nodes). This did
not work too well. Commit b28ffd0fcc583c1811e5295279e7d4366c3cae6c fixed
some ensuing problems with matching to child indexes, but per a recent
report from Claus Stadler, constraint exclusion of UNION ALL subqueries was
still broken, because constant-simplification didn't handle the injected
PlaceHolderVars well either. On reflection, the original patch was quite
misguided: there is no reason to expect that EquivalenceClass child members
will be distinct. So instead of trying to make them so, we should ensure
that we can cope with the situation when they're not.
Accordingly, this patch reverts the code changes in the above-mentioned
commits (though the regression test cases they added stay). Instead, I've
added assorted defenses to make sure that duplicate EC child members don't
cause any problems. Teodor's original problem ("MergeAppend child's
targetlist doesn't match MergeAppend") is addressed more directly by
revising prepare_sort_from_pathkeys to let the parent MergeAppend's sort
list guide creation of each child's sort list.
In passing, get rid of add_sort_column; as far as I can tell, testing for
duplicate sort keys at this stage is dead code. Certainly it doesn't
trigger often enough to be worth expending cycles on in ordinary queries.
And keeping the test would've greatly complicated the new logic in
prepare_sort_from_pathkeys, because comparing pathkey list entries against
a previous output array requires that we not skip any entries in the list.
Back-patch to 9.1, like the previous patches. The only known issue in
this area that wasn't caused by the ill-advised previous patches was the
MergeAppend planning failure, which of course is not relevant before 9.1.
It's possible that we need some of the new defenses against duplicate child
EC entries in older branches, but until there's some clear evidence of that
I'm going to refrain from back-patching further.
2012-03-16 18:11:12 +01:00
|
|
|
-- Check handling of duplicated, constant, or volatile targetlist items
|
2011-11-09 03:14:21 +01:00
|
|
|
explain (costs off)
|
|
|
|
SELECT thousand, tenthous FROM tenk1
|
|
|
|
UNION ALL
|
|
|
|
SELECT thousand, thousand FROM tenk1
|
|
|
|
ORDER BY thousand, tenthous;
|
|
|
|
|
|
|
|
explain (costs off)
|
2011-11-09 06:13:37 +01:00
|
|
|
SELECT thousand, tenthous, thousand+tenthous AS x FROM tenk1
|
2011-11-09 03:14:21 +01:00
|
|
|
UNION ALL
|
2011-11-09 06:13:37 +01:00
|
|
|
SELECT 42, 42, hundred FROM tenk1
|
2011-11-09 03:14:21 +01:00
|
|
|
ORDER BY thousand, tenthous;
|
|
|
|
|
|
|
|
explain (costs off)
|
|
|
|
SELECT thousand, tenthous FROM tenk1
|
|
|
|
UNION ALL
|
|
|
|
SELECT thousand, random()::integer FROM tenk1
|
|
|
|
ORDER BY thousand, tenthous;
|
|
|
|
|
Revisit handling of UNION ALL subqueries with non-Var output columns.
In commit 57664ed25e5dea117158a2e663c29e60b3546e1c I tried to fix a bug
reported by Teodor Sigaev by making non-simple-Var output columns distinct
(by wrapping their expressions with dummy PlaceHolderVar nodes). This did
not work too well. Commit b28ffd0fcc583c1811e5295279e7d4366c3cae6c fixed
some ensuing problems with matching to child indexes, but per a recent
report from Claus Stadler, constraint exclusion of UNION ALL subqueries was
still broken, because constant-simplification didn't handle the injected
PlaceHolderVars well either. On reflection, the original patch was quite
misguided: there is no reason to expect that EquivalenceClass child members
will be distinct. So instead of trying to make them so, we should ensure
that we can cope with the situation when they're not.
Accordingly, this patch reverts the code changes in the above-mentioned
commits (though the regression test cases they added stay). Instead, I've
added assorted defenses to make sure that duplicate EC child members don't
cause any problems. Teodor's original problem ("MergeAppend child's
targetlist doesn't match MergeAppend") is addressed more directly by
revising prepare_sort_from_pathkeys to let the parent MergeAppend's sort
list guide creation of each child's sort list.
In passing, get rid of add_sort_column; as far as I can tell, testing for
duplicate sort keys at this stage is dead code. Certainly it doesn't
trigger often enough to be worth expending cycles on in ordinary queries.
And keeping the test would've greatly complicated the new logic in
prepare_sort_from_pathkeys, because comparing pathkey list entries against
a previous output array requires that we not skip any entries in the list.
Back-patch to 9.1, like the previous patches. The only known issue in
this area that wasn't caused by the ill-advised previous patches was the
MergeAppend planning failure, which of course is not relevant before 9.1.
It's possible that we need some of the new defenses against duplicate child
EC entries in older branches, but until there's some clear evidence of that
I'm going to refrain from back-patching further.
2012-03-16 18:11:12 +01:00
|
|
|
-- Check min/max aggregate optimization
|
|
|
|
explain (costs off)
|
|
|
|
SELECT min(x) FROM
|
|
|
|
(SELECT unique1 AS x FROM tenk1 a
|
|
|
|
UNION ALL
|
|
|
|
SELECT unique2 AS x FROM tenk1 b) s;
|
|
|
|
|
|
|
|
explain (costs off)
|
|
|
|
SELECT min(y) FROM
|
|
|
|
(SELECT unique1 AS x, unique1 AS y FROM tenk1 a
|
|
|
|
UNION ALL
|
|
|
|
SELECT unique2 AS x, unique2 AS y FROM tenk1 b) s;
|
|
|
|
|
|
|
|
-- XXX planner doesn't recognize that index on unique2 is sufficiently sorted
|
|
|
|
explain (costs off)
|
|
|
|
SELECT x, y FROM
|
|
|
|
(SELECT thousand AS x, tenthous AS y FROM tenk1 a
|
|
|
|
UNION ALL
|
|
|
|
SELECT unique2 AS x, unique2 AS y FROM tenk1 b) s
|
|
|
|
ORDER BY x, y;
|
|
|
|
|
2013-08-31 01:27:40 +02:00
|
|
|
-- exercise rescan code path via a repeatedly-evaluated subquery
|
|
|
|
explain (costs off)
|
|
|
|
SELECT
|
2013-08-31 03:40:21 +02:00
|
|
|
ARRAY(SELECT f.i FROM (
|
|
|
|
(SELECT d + g.i FROM generate_series(4, 30, 3) d ORDER BY 1)
|
2013-08-31 01:27:40 +02:00
|
|
|
UNION ALL
|
2013-08-31 03:40:21 +02:00
|
|
|
(SELECT d + g.i FROM generate_series(0, 30, 5) d ORDER BY 1)
|
2013-08-31 01:27:40 +02:00
|
|
|
) f(i)
|
2013-08-31 03:40:21 +02:00
|
|
|
ORDER BY f.i LIMIT 10)
|
2013-08-31 01:27:40 +02:00
|
|
|
FROM generate_series(1, 3) g(i);
|
|
|
|
|
|
|
|
SELECT
|
2013-08-31 03:40:21 +02:00
|
|
|
ARRAY(SELECT f.i FROM (
|
|
|
|
(SELECT d + g.i FROM generate_series(4, 30, 3) d ORDER BY 1)
|
2013-08-31 01:27:40 +02:00
|
|
|
UNION ALL
|
2013-08-31 03:40:21 +02:00
|
|
|
(SELECT d + g.i FROM generate_series(0, 30, 5) d ORDER BY 1)
|
2013-08-31 01:27:40 +02:00
|
|
|
) f(i)
|
2013-08-31 03:40:21 +02:00
|
|
|
ORDER BY f.i LIMIT 10)
|
2013-08-31 01:27:40 +02:00
|
|
|
FROM generate_series(1, 3) g(i);
|
|
|
|
|
2011-11-09 03:14:21 +01:00
|
|
|
reset enable_seqscan;
|
|
|
|
reset enable_indexscan;
|
|
|
|
reset enable_bitmapscan;
|