MAH*_*AHI 6 sql postgresql tree function
我有一个树状结构表,列id
,category
,parent_id
现在我需要一个节点和它的子节点复制到另一个节点,而复制时,类别必须相同,但是有新的id和parent_id ..
我的意见是node to copy
&destination node to copy
我已经解释了图像文件中的树结构..
我需要一个功能这样做..,
PostgreSQL版本9.1.2
Column | Type | Modifiers
-----------+---------+-------------------------------------------------
id | integer | not null default nextval('t1_id_seq'::regclass)
category | text |
parent_id | integer |
Indexes:
"t1_pkey" PRIMARY KEY, btree (id)
Foreign-key constraints:
"fk_t1_1" FOREIGN KEY (parent_id) REFERENCES t1(id)
Referenced by:
TABLE "t1" CONSTRAINT "fk_t1_1" FOREIGN KEY (parent_id) REFERENCES t1(id)
Run Code Online (Sandbox Code Playgroud)
(在PostgreSQL 8.4.3下测试)
以下查询将新ID分配给节点4下的子树(请参阅nextval
参考资料),然后查找父项的相应新ID (请参阅参考资料LEFT JOIN
).
WITH RECURSIVE CTE AS (
SELECT *, nextval('t1_id_seq') new_id FROM t1 WHERE id = 4
UNION ALL
SELECT t1.*, nextval('t1_id_seq') new_id FROM CTE JOIN t1 ON CTE.id = t1.parent_id
)
SELECT C1.new_id, C1.category, C2.new_id new_parent_id
FROM CTE C1 LEFT JOIN CTE C2 ON C1.parent_id = C2.id
Run Code Online (Sandbox Code Playgroud)
结果(在您的测试数据上):
new_id category new_parent_id
------ -------- -------------
9 C4
10 C5 9
11 C6 9
12 C7 10
Run Code Online (Sandbox Code Playgroud)
一旦你有了它,很容易将它插回到表中,你只需要小心重新连接子树根与适当的父(在这种情况下为8,请参阅COALESCE(new_parent_id, 8)
):
INSERT INTO t1
SELECT new_id, category, COALESCE(new_parent_id, 8) FROM (
WITH RECURSIVE CTE AS (
SELECT *, nextval('t1_id_seq') new_id FROM t1 WHERE id = 4
UNION ALL
SELECT t1.*, nextval('t1_id_seq') new_id FROM CTE JOIN t1 ON CTE.id = t1.parent_id
)
SELECT C1.new_id, C1.category, C2.new_id new_parent_id
FROM CTE C1 LEFT JOIN CTE C2 ON C1.parent_id = C2.id
) Q1
Run Code Online (Sandbox Code Playgroud)
之后,该表包含以下数据:
new_id category new_parent_id
------ -------- -------------
1 C1
2 C2 1
3 C3 1
4 C4 2
5 C5 4
6 C6 4
7 C7 5
8 C8 3
9 C4 8
10 C5 9
11 C6 9
12 C7 10
Run Code Online (Sandbox Code Playgroud)