15

我创建了一个简单的示例来说明在 PostgreSQL 中使用递归查询的传递闭包。

但是，我的递归查询有些问题。我还不熟悉语法，所以这个请求对我来说可能完全不合适，为此我提前道歉。如果您运行查询，您将看到节点 1 在路径结果中重复出现。有人可以帮我弄清楚如何调整 SQL 吗？

/*           1
           /   \
          2     3
         / \   /
        4  5  6
       /
      7
     / \
    8   9
*/

create table account(
acct_id INT,
parent_id INT REFERENCES account(acct_id),
acct_name VARCHAR(100),
PRIMARY KEY(acct_id)
);

insert into account (acct_id, parent_id, acct_name) values (1,1,'account 1');
insert into account (acct_id, parent_id, acct_name) values (2,1,'account 2');
insert into account (acct_id, parent_id, acct_name) values (3,1,'account 3');
insert into account (acct_id, parent_id, acct_name) values (4,2,'account 4');
insert into account (acct_id, parent_id, acct_name) values (5,2,'account 5');
insert into account (acct_id, parent_id, acct_name) values (6,3,'account 6');
insert into account (acct_id, parent_id, acct_name) values (7,4,'account 7');
insert into account (acct_id, parent_id, acct_name) values (8,7,'account 8');
insert into account (acct_id, parent_id, acct_name) values (9,7,'account 9');

WITH RECURSIVE search_graph(acct_id, parent_id, depth, path, cycle) AS (
        SELECT g.acct_id, g.parent_id, 1,
          ARRAY[g.acct_id],
          false
        FROM account g
      UNION ALL
        SELECT g.acct_id, g.parent_id, sg.depth + 1,
          path || g.acct_id,
          g.acct_id = ANY(path)
        FROM account g, search_graph sg
        WHERE g.acct_id = sg.parent_id AND NOT cycle
)
SELECT path[1] as Child,parent_id as Parent,path || parent_id as path FROM search_graph
ORDER BY path[1],depth;
4

2 回答 2

9

您可以在几个地方进行简化（假设acct_id和parent_idare NOT NULL）：

WITH RECURSIVE search_graph AS (
   SELECT parent_id, ARRAY[acct_id] AS path
   FROM   account

   UNION  ALL
   SELECT g.parent_id, sg.path || g.acct_id
   FROM   search_graph sg
   JOIN   account g ON g.acct_id = sg.parent_id 
   WHERE  g.acct_id <> ALL(sg.path)
   )
SELECT path[1] AS child
     , path[array_upper(path,1)] AS parent
     , path
FROM   search_graph
ORDER  BY path;
  • 列acct_id, depth,cycle只是您查询中的噪音。
  • 在来自顶部节点的重复条目出现在结果中之前WHERE，条件必须提前一步退出递归。那是你原来的“一个接一个”。

剩下的就是格式化了。

如果您知道图表中唯一可能的圆圈是自我参考，我们可以更便宜：

WITH RECURSIVE search_graph AS (
   SELECT parent_id, ARRAY[acct_id] AS path, acct_id <> parent_id AS keep_going
   FROM   account

   UNION  ALL
   SELECT g.parent_id, sg.path || g.acct_id, g.acct_id <> g.parent_id
   FROM   search_graph sg
   JOIN   account g ON g.acct_id = sg.parent_id 
   WHERE  sg.keep_going
)
SELECT path[1] AS child
     , path[array_upper(path,1)] AS parent
     , path
FROM   search_graph
ORDER  BY path;

SQL小提琴。

请注意，带有修饰符（如 ）的数据类型会出现问题（至少到 pg v9.4），varchar(5)因为数组连接会丢失修饰符，但 rCTE 坚持要求类型完全匹配：

于 2014-01-07T22:53:06.737 回答
0

您将帐户 1 设置为其自己的父帐户。如果您将该帐户的父级设置为null您可以避免将该帐户作为起始节点和结束节点（您的逻辑设置方式您将包含一个循环，但不会添加到该循环，这似乎是合理的）。将最终的“路径”列更改为类似case when parent_id is not null then path || parent_id else path end避免最后出现空值的内容看起来也更好一些。

于 2014-01-07T20:40:33.413 回答