目的是允许插入脚本向模式中的所有表添加数据,这样它就不会在约束中产生任何冲突。我从 information_schema.tables 获取表并从 information_schema.table_constraints 获取约束,但不确定如何按外键约束的顺序比较排序表。请赐教。
下面产生重复的表名:
select a.table_name,b.ordinal_position
from information_schema.tables a left outer join
information_schema.key_column_usage b
on a.table_name = b.table_name
Run Code Online (Sandbox Code Playgroud)
您需要一个遍历外键关系的整个依赖树的递归查询。
以下查询针对简单的依赖项执行此操作。它并不能处理循环外键
with recursive fk_tree as (
-- All tables not referencing anything else
select t.oid as reloid,
t.relname as table_name,
s.nspname as schema_name,
null::text as referenced_table_name,
null::text as referenced_schema_name,
1 as level
from pg_class t
join pg_namespace s on s.oid = t.relnamespace
where relkind = 'r'
and not exists (select *
from pg_constraint
where contype = 'f'
and conrelid = t.oid)
and s.nspname = 'public' -- limit to one schema
union all
select ref.oid,
ref.relname,
rs.nspname,
p.table_name,
p.schema_name,
p.level + 1
from pg_class ref
join pg_namespace rs on rs.oid = ref.relnamespace
join pg_constraint c on c.contype = 'f' and c.conrelid = ref.oid
join fk_tree p on p.reloid = c.confrelid
where ref.oid != p.reloid -- do not enter to tables referencing theirselves.
), all_tables as (
-- this picks the highest level for each table
select schema_name, table_name,
level,
row_number() over (partition by schema_name, table_name order by level desc) as last_table_row
from fk_tree
)
select schema_name, table_name, level
from all_tables at
where last_table_row = 1
order by level;
Run Code Online (Sandbox Code Playgroud)
对于下表结构:
create table customer (id integer primary key);
create table product (id integer primary key);
create table manufacturer (id integer primary key);
create table manufactured_by (product_id integer references product, manufacturer_id integer references manufacturer);
create table distributor (id integer primary key);
create table orders (id integer primary key, customer_id integer references customer);
create table order_line (id integer primary key, order_id integer references orders);
create table invoice (id integer, order_id integer references orders);
create table delivery (oder_line_id integer references order_line, distributor_id integer references distributor);
Run Code Online (Sandbox Code Playgroud)
这将返回以下结果:
with recursive fk_tree as (
-- All tables not referencing anything else
select t.oid as reloid,
t.relname as table_name,
s.nspname as schema_name,
null::text as referenced_table_name,
null::text as referenced_schema_name,
1 as level
from pg_class t
join pg_namespace s on s.oid = t.relnamespace
where relkind = 'r'
and not exists (select *
from pg_constraint
where contype = 'f'
and conrelid = t.oid)
and s.nspname = 'public' -- limit to one schema
union all
select ref.oid,
ref.relname,
rs.nspname,
p.table_name,
p.schema_name,
p.level + 1
from pg_class ref
join pg_namespace rs on rs.oid = ref.relnamespace
join pg_constraint c on c.contype = 'f' and c.conrelid = ref.oid
join fk_tree p on p.reloid = c.confrelid
where ref.oid != p.reloid -- do not enter to tables referencing theirselves.
), all_tables as (
-- this picks the highest level for each table
select schema_name, table_name,
level,
row_number() over (partition by schema_name, table_name order by level desc) as last_table_row
from fk_tree
)
select schema_name, table_name, level
from all_tables at
where last_table_row = 1
order by level;
Run Code Online (Sandbox Code Playgroud)
这意味着您需要先插入 intocustomer才能插入orders. 具有相同级别的表的插入顺序无关紧要。
all_tables需要使用 CTE 的中间步骤来仅列出每个表一次。否则该表manufactured_by将被列出两次:
create table customer (id integer primary key);
create table product (id integer primary key);
create table manufacturer (id integer primary key);
create table manufactured_by (product_id integer references product, manufacturer_id integer references manufacturer);
create table distributor (id integer primary key);
create table orders (id integer primary key, customer_id integer references customer);
create table order_line (id integer primary key, order_id integer references orders);
create table invoice (id integer, order_id integer references orders);
create table delivery (oder_line_id integer references order_line, distributor_id integer references distributor);
Run Code Online (Sandbox Code Playgroud)
这个查询可能需要更多的调整(特别是为了防止依赖树中的循环),但它应该给你一个开始。