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
|
|
|
|
2017-03-21 14:48:04 +01:00
|
|
|
-- Check UPDATE with *partitioned* inherited target and an appendrel subquery
|
|
|
|
create table some_tab (a int);
|
|
|
|
insert into some_tab values (0);
|
|
|
|
create table some_tab_child () inherits (some_tab);
|
|
|
|
insert into some_tab_child values (1);
|
|
|
|
create table parted_tab (a int, b char) partition by list (a);
|
|
|
|
create table parted_tab_part1 partition of parted_tab for values in (1);
|
|
|
|
create table parted_tab_part2 partition of parted_tab for values in (2);
|
|
|
|
create table parted_tab_part3 partition of parted_tab for values in (3);
|
|
|
|
insert into parted_tab values (1, 'a'), (2, 'a'), (3, 'a');
|
|
|
|
|
|
|
|
update parted_tab set b = 'b'
|
|
|
|
from
|
|
|
|
(select a from some_tab union all select a+1 from some_tab) ss (a)
|
|
|
|
where parted_tab.a = ss.a;
|
|
|
|
select tableoid::regclass::text as relname, parted_tab.* from parted_tab order by 1,2;
|
|
|
|
|
|
|
|
truncate parted_tab;
|
|
|
|
insert into parted_tab values (1, 'a'), (2, 'a'), (3, 'a');
|
|
|
|
update parted_tab set b = 'b'
|
|
|
|
from
|
|
|
|
(select 0 from parted_tab union all select 1 from parted_tab) ss (a)
|
|
|
|
where parted_tab.a = ss.a;
|
|
|
|
select tableoid::regclass::text as relname, parted_tab.* from parted_tab order by 1,2;
|
|
|
|
|
|
|
|
drop table parted_tab;
|
2017-09-14 21:41:08 +02:00
|
|
|
|
|
|
|
-- Check UPDATE with multi-level partitioned inherited target
|
|
|
|
create table mlparted_tab (a int, b char, c text) partition by list (a);
|
|
|
|
create table mlparted_tab_part1 partition of mlparted_tab for values in (1);
|
|
|
|
create table mlparted_tab_part2 partition of mlparted_tab for values in (2) partition by list (b);
|
|
|
|
create table mlparted_tab_part3 partition of mlparted_tab for values in (3);
|
|
|
|
create table mlparted_tab_part2a partition of mlparted_tab_part2 for values in ('a');
|
|
|
|
create table mlparted_tab_part2b partition of mlparted_tab_part2 for values in ('b');
|
|
|
|
insert into mlparted_tab values (1, 'a'), (2, 'a'), (2, 'b'), (3, 'a');
|
|
|
|
|
|
|
|
update mlparted_tab mlp set c = 'xxx'
|
|
|
|
from
|
|
|
|
(select a from some_tab union all select a+1 from some_tab) ss (a)
|
|
|
|
where (mlp.a = ss.a and mlp.b = 'b') or mlp.a = 3;
|
|
|
|
select tableoid::regclass::text as relname, mlparted_tab.* from mlparted_tab order by 1,2;
|
|
|
|
|
|
|
|
drop table mlparted_tab;
|
2017-03-21 14:48:04 +01:00
|
|
|
drop table some_tab cascade;
|
|
|
|
|
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
|
|
|
|
2017-01-05 00:00:11 +01:00
|
|
|
-- check that oid column is handled properly during alter table inherit
|
|
|
|
create table oid_parent (a int) with oids;
|
|
|
|
|
|
|
|
create table oid_child () inherits (oid_parent);
|
|
|
|
select attinhcount, attislocal from pg_attribute
|
|
|
|
where attrelid = 'oid_child'::regclass and attname = 'oid';
|
|
|
|
drop table oid_child;
|
|
|
|
|
|
|
|
create table oid_child (a int) without oids;
|
|
|
|
alter table oid_child inherit oid_parent; -- fail
|
|
|
|
alter table oid_child set with oids;
|
|
|
|
select attinhcount, attislocal from pg_attribute
|
|
|
|
where attrelid = 'oid_child'::regclass and attname = 'oid';
|
|
|
|
alter table oid_child inherit oid_parent;
|
|
|
|
select attinhcount, attislocal from pg_attribute
|
|
|
|
where attrelid = 'oid_child'::regclass and attname = 'oid';
|
|
|
|
alter table oid_child set without oids; -- fail
|
|
|
|
alter table oid_parent set without oids;
|
|
|
|
select attinhcount, attislocal from pg_attribute
|
|
|
|
where attrelid = 'oid_child'::regclass and attname = 'oid';
|
|
|
|
alter table oid_child set without oids;
|
|
|
|
select attinhcount, attislocal from pg_attribute
|
|
|
|
where attrelid = 'oid_child'::regclass and attname = 'oid';
|
|
|
|
|
|
|
|
drop table oid_parent cascade;
|
|
|
|
|
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
|
|
|
|
|
2016-10-13 23:05:14 +02:00
|
|
|
-- Test that child does not override inheritable constraints of the parent
|
|
|
|
create table c2 (constraint p2chk check (ff1 > 10) no inherit) inherits (p1); --fails
|
|
|
|
|
2011-12-05 19:10:18 +01:00
|
|
|
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;
|
2017-03-12 00:36:50 +01:00
|
|
|
select NULL::derived::base;
|
2004-12-12 23:49:50 +01:00
|
|
|
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
|
|
|
|
2016-03-15 23:06:11 +01:00
|
|
|
-- Test non-inheritable indices [UNIQUE, EXCLUDE] constraints
|
2012-07-20 18:33:34 +02:00
|
|
|
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
|
|
|
|
2016-03-15 23:06:11 +01:00
|
|
|
-- Test non-inheritable foreign key constraints
|
2012-07-20 18:33:34 +02:00
|
|
|
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;
|
|
|
|
|
Fix two bugs in merging of inherited CHECK constraints.
Historically, we've allowed users to add a CHECK constraint to a child
table and then add an identical CHECK constraint to the parent. This
results in "merging" the two constraints so that the pre-existing
child constraint ends up with both conislocal = true and coninhcount > 0.
However, if you tried to do it in the other order, you got a duplicate
constraint error. This is problematic for pg_dump, which needs to issue
separated ADD CONSTRAINT commands in some cases, but has no good way to
ensure that the constraints will be added in the required order.
And it's more than a bit arbitrary, too. The goal of complaining about
duplicated ADD CONSTRAINT commands can be served if we reject the case of
adding a constraint when the existing one already has conislocal = true;
but if it has conislocal = false, let's just make the ADD CONSTRAINT set
conislocal = true. In this way, either order of adding the constraints
has the same end result.
Another problem was that the code allowed creation of a parent constraint
marked convalidated that is merged with a child constraint that is
!convalidated. In this case, an inheritance scan of the parent table could
emit some rows violating the constraint condition, which would be an
unexpected result given the marking of the parent constraint as validated.
Hence, forbid merging of constraints in this case. (Note: valid child and
not-valid parent seems fine, so continue to allow that.)
Per report from Benedikt Grundmann. Back-patch to 9.2 where we introduced
possibly-not-valid check constraints. The second bug obviously doesn't
apply before that, and I think the first doesn't either, because pg_dump
only gets into this situation when dealing with not-valid constraints.
Report: <CADbMkNPT-Jz5PRSQ4RbUASYAjocV_KHUWapR%2Bg8fNvhUAyRpxA%40mail.gmail.com>
Discussion: <22108.1475874586@sss.pgh.pa.us>
2016-10-09 01:29:27 +02:00
|
|
|
-- Test that parent and child CHECK constraints can be created in either order
|
|
|
|
create table p1(f1 int);
|
|
|
|
create table p1_c1() inherits(p1);
|
|
|
|
|
|
|
|
alter table p1 add constraint inh_check_constraint1 check (f1 > 0);
|
|
|
|
alter table p1_c1 add constraint inh_check_constraint1 check (f1 > 0);
|
|
|
|
|
|
|
|
alter table p1_c1 add constraint inh_check_constraint2 check (f1 < 10);
|
|
|
|
alter table p1 add constraint inh_check_constraint2 check (f1 < 10);
|
|
|
|
|
|
|
|
select conrelid::regclass::text as relname, conname, conislocal, coninhcount
|
|
|
|
from pg_constraint where conname like 'inh\_check\_constraint%'
|
|
|
|
order by 1, 2;
|
|
|
|
|
|
|
|
drop table p1 cascade;
|
|
|
|
|
|
|
|
-- Test that a valid child can have not-valid parent, but not vice versa
|
|
|
|
create table invalid_check_con(f1 int);
|
|
|
|
create table invalid_check_con_child() inherits(invalid_check_con);
|
|
|
|
|
|
|
|
alter table invalid_check_con_child add constraint inh_check_constraint check(f1 > 0) not valid;
|
|
|
|
alter table invalid_check_con add constraint inh_check_constraint check(f1 > 0); -- fail
|
|
|
|
alter table invalid_check_con_child drop constraint inh_check_constraint;
|
|
|
|
|
|
|
|
insert into invalid_check_con values(0);
|
|
|
|
|
|
|
|
alter table invalid_check_con_child add constraint inh_check_constraint check(f1 > 0);
|
|
|
|
alter table invalid_check_con add constraint inh_check_constraint check(f1 > 0) not valid;
|
|
|
|
|
|
|
|
insert into invalid_check_con values(0); -- fail
|
|
|
|
insert into invalid_check_con_child values(0); -- fail
|
|
|
|
|
|
|
|
select conrelid::regclass::text as relname, conname,
|
|
|
|
convalidated, conislocal, coninhcount, connoinherit
|
|
|
|
from pg_constraint where conname like 'inh\_check\_constraint%'
|
|
|
|
order by 1, 2;
|
|
|
|
|
|
|
|
-- We don't drop the invalid_check_con* tables, to test dump/reload with
|
|
|
|
|
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;
|
Implement table partitioning.
Table partitioning is like table inheritance and reuses much of the
existing infrastructure, but there are some important differences.
The parent is called a partitioned table and is always empty; it may
not have indexes or non-inherited constraints, since those make no
sense for a relation with no data of its own. The children are called
partitions and contain all of the actual data. Each partition has an
implicit partitioning constraint. Multiple inheritance is not
allowed, and partitioning and inheritance can't be mixed. Partitions
can't have extra columns and may not allow nulls unless the parent
does. Tuples inserted into the parent are automatically routed to the
correct partition, so tuple-routing ON INSERT triggers are not needed.
Tuple routing isn't yet supported for partitions which are foreign
tables, and it doesn't handle updates that cross partition boundaries.
Currently, tables can be range-partitioned or list-partitioned. List
partitioning is limited to a single column, but range partitioning can
involve multiple columns. A partitioning "column" can be an
expression.
Because table partitioning is less general than table inheritance, it
is hoped that it will be easier to reason about properties of
partitions, and therefore that this will serve as a better foundation
for a variety of possible optimizations, including query planner
optimizations. The tuple routing based which this patch does based on
the implicit partitioning constraints is an example of this, but it
seems likely that many other useful optimizations are also possible.
Amit Langote, reviewed and tested by Robert Haas, Ashutosh Bapat,
Amit Kapila, Rajkumar Raghuwanshi, Corey Huinker, Jaime Casanova,
Rushabh Lathia, Erik Rijkers, among others. Minor revisions by me.
2016-12-07 19:17:43 +01:00
|
|
|
|
|
|
|
--
|
|
|
|
-- Check that constraint exclusion works correctly with partitions using
|
|
|
|
-- implicit constraints generated from the partition bound information.
|
|
|
|
--
|
|
|
|
create table list_parted (
|
|
|
|
a varchar
|
|
|
|
) partition by list (a);
|
|
|
|
create table part_ab_cd partition of list_parted for values in ('ab', 'cd');
|
|
|
|
create table part_ef_gh partition of list_parted for values in ('ef', 'gh');
|
|
|
|
create table part_null_xy partition of list_parted for values in (null, 'xy');
|
|
|
|
|
|
|
|
explain (costs off) select * from list_parted;
|
|
|
|
explain (costs off) select * from list_parted where a is null;
|
|
|
|
explain (costs off) select * from list_parted where a is not null;
|
|
|
|
explain (costs off) select * from list_parted where a in ('ab', 'cd', 'ef');
|
|
|
|
explain (costs off) select * from list_parted where a = 'ab' or a in (null, 'cd');
|
|
|
|
explain (costs off) select * from list_parted where a = 'ab';
|
|
|
|
|
|
|
|
create table range_list_parted (
|
|
|
|
a int,
|
|
|
|
b char(2)
|
|
|
|
) partition by range (a);
|
|
|
|
create table part_1_10 partition of range_list_parted for values from (1) to (10) partition by list (b);
|
|
|
|
create table part_1_10_ab partition of part_1_10 for values in ('ab');
|
|
|
|
create table part_1_10_cd partition of part_1_10 for values in ('cd');
|
|
|
|
create table part_10_20 partition of range_list_parted for values from (10) to (20) partition by list (b);
|
|
|
|
create table part_10_20_ab partition of part_10_20 for values in ('ab');
|
|
|
|
create table part_10_20_cd partition of part_10_20 for values in ('cd');
|
|
|
|
create table part_21_30 partition of range_list_parted for values from (21) to (30) partition by list (b);
|
|
|
|
create table part_21_30_ab partition of part_21_30 for values in ('ab');
|
|
|
|
create table part_21_30_cd partition of part_21_30 for values in ('cd');
|
Use MINVALUE/MAXVALUE instead of UNBOUNDED for range partition bounds.
Previously, UNBOUNDED meant no lower bound when used in the FROM list,
and no upper bound when used in the TO list, which was OK for
single-column range partitioning, but problematic with multiple
columns. For example, an upper bound of (10.0, UNBOUNDED) would not be
collocated with a lower bound of (10.0, UNBOUNDED), thus making it
difficult or impossible to define contiguous multi-column range
partitions in some cases.
Fix this by using MINVALUE and MAXVALUE instead of UNBOUNDED to
represent a partition column that is unbounded below or above
respectively. This syntax removes any ambiguity, and ensures that if
one partition's lower bound equals another partition's upper bound,
then the partitions are contiguous.
Also drop the constraint prohibiting finite values after an unbounded
column, and just document the fact that any values after MINVALUE or
MAXVALUE are ignored. Previously it was necessary to repeat UNBOUNDED
multiple times, which was needlessly verbose.
Note: Forces a post-PG 10 beta2 initdb.
Report by Amul Sul, original patch by Amit Langote with some
additional hacking by me.
Discussion: https://postgr.es/m/CAAJ_b947mowpLdxL3jo3YLKngRjrq9+Ej4ymduQTfYR+8=YAYQ@mail.gmail.com
2017-07-21 10:20:47 +02:00
|
|
|
create table part_40_inf partition of range_list_parted for values from (40) to (maxvalue) partition by list (b);
|
Implement table partitioning.
Table partitioning is like table inheritance and reuses much of the
existing infrastructure, but there are some important differences.
The parent is called a partitioned table and is always empty; it may
not have indexes or non-inherited constraints, since those make no
sense for a relation with no data of its own. The children are called
partitions and contain all of the actual data. Each partition has an
implicit partitioning constraint. Multiple inheritance is not
allowed, and partitioning and inheritance can't be mixed. Partitions
can't have extra columns and may not allow nulls unless the parent
does. Tuples inserted into the parent are automatically routed to the
correct partition, so tuple-routing ON INSERT triggers are not needed.
Tuple routing isn't yet supported for partitions which are foreign
tables, and it doesn't handle updates that cross partition boundaries.
Currently, tables can be range-partitioned or list-partitioned. List
partitioning is limited to a single column, but range partitioning can
involve multiple columns. A partitioning "column" can be an
expression.
Because table partitioning is less general than table inheritance, it
is hoped that it will be easier to reason about properties of
partitions, and therefore that this will serve as a better foundation
for a variety of possible optimizations, including query planner
optimizations. The tuple routing based which this patch does based on
the implicit partitioning constraints is an example of this, but it
seems likely that many other useful optimizations are also possible.
Amit Langote, reviewed and tested by Robert Haas, Ashutosh Bapat,
Amit Kapila, Rajkumar Raghuwanshi, Corey Huinker, Jaime Casanova,
Rushabh Lathia, Erik Rijkers, among others. Minor revisions by me.
2016-12-07 19:17:43 +01:00
|
|
|
create table part_40_inf_ab partition of part_40_inf for values in ('ab');
|
|
|
|
create table part_40_inf_cd partition of part_40_inf for values in ('cd');
|
|
|
|
create table part_40_inf_null partition of part_40_inf for values in (null);
|
|
|
|
|
|
|
|
explain (costs off) select * from range_list_parted;
|
|
|
|
explain (costs off) select * from range_list_parted where a = 5;
|
|
|
|
explain (costs off) select * from range_list_parted where b = 'ab';
|
|
|
|
explain (costs off) select * from range_list_parted where a between 3 and 23 and b in ('ab');
|
|
|
|
|
|
|
|
/* Should select no rows because range partition key cannot be null */
|
|
|
|
explain (costs off) select * from range_list_parted where a is null;
|
|
|
|
|
|
|
|
/* Should only select rows from the null-accepting partition */
|
|
|
|
explain (costs off) select * from range_list_parted where b is null;
|
|
|
|
explain (costs off) select * from range_list_parted where a is not null and a < 67;
|
|
|
|
explain (costs off) select * from range_list_parted where a >= 30;
|
|
|
|
|
2017-03-06 11:20:53 +01:00
|
|
|
drop table list_parted;
|
|
|
|
drop table range_list_parted;
|
2017-05-13 17:35:30 +02:00
|
|
|
|
|
|
|
-- check that constraint exclusion is able to cope with the partition
|
|
|
|
-- constraint emitted for multi-column range partitioned tables
|
|
|
|
create table mcrparted (a int, b int, c int) partition by range (a, abs(b), c);
|
2017-11-28 16:51:01 +01:00
|
|
|
create table mcrparted_def partition of mcrparted default;
|
2017-09-16 03:15:55 +02:00
|
|
|
create table mcrparted0 partition of mcrparted for values from (minvalue, minvalue, minvalue) to (1, 1, 1);
|
2017-05-13 17:35:30 +02:00
|
|
|
create table mcrparted1 partition of mcrparted for values from (1, 1, 1) to (10, 5, 10);
|
|
|
|
create table mcrparted2 partition of mcrparted for values from (10, 5, 10) to (10, 10, 10);
|
|
|
|
create table mcrparted3 partition of mcrparted for values from (11, 1, 1) to (20, 10, 10);
|
|
|
|
create table mcrparted4 partition of mcrparted for values from (20, 10, 10) to (20, 20, 20);
|
2017-09-16 03:15:55 +02:00
|
|
|
create table mcrparted5 partition of mcrparted for values from (20, 20, 20) to (maxvalue, maxvalue, maxvalue);
|
2017-11-28 16:51:01 +01:00
|
|
|
explain (costs off) select * from mcrparted where a = 0; -- scans mcrparted0, mcrparted_def
|
|
|
|
explain (costs off) select * from mcrparted where a = 10 and abs(b) < 5; -- scans mcrparted1, mcrparted_def
|
|
|
|
explain (costs off) select * from mcrparted where a = 10 and abs(b) = 5; -- scans mcrparted1, mcrparted2, mcrparted_def
|
2017-05-13 17:35:30 +02:00
|
|
|
explain (costs off) select * from mcrparted where abs(b) = 5; -- scans all partitions
|
|
|
|
explain (costs off) select * from mcrparted where a > -1; -- scans all partitions
|
|
|
|
explain (costs off) select * from mcrparted where a = 20 and abs(b) = 10 and c > 10; -- scans mcrparted4
|
2017-11-28 16:51:01 +01:00
|
|
|
explain (costs off) select * from mcrparted where a = 20 and c > 20; -- scans mcrparted3, mcrparte4, mcrparte5, mcrparted_def
|
2017-05-13 17:35:30 +02:00
|
|
|
drop table mcrparted;
|
2017-05-19 21:23:42 +02:00
|
|
|
|
|
|
|
-- check that partitioned table Appends cope with being referenced in
|
|
|
|
-- subplans
|
|
|
|
create table parted_minmax (a int, b varchar(16)) partition by range (a);
|
|
|
|
create table parted_minmax1 partition of parted_minmax for values from (1) to (10);
|
|
|
|
create index parted_minmax1i on parted_minmax1 (a, b);
|
|
|
|
insert into parted_minmax values (1,'12345');
|
|
|
|
explain (costs off) select min(a), max(a) from parted_minmax where b = '12345';
|
|
|
|
select min(a), max(a) from parted_minmax where b = '12345';
|
|
|
|
drop table parted_minmax;
|