太难了,花了我几个小时才解决:-P
WITH RECURSIVE
tree AS (
SELECT 1 AS round, id, parent_id, ARRAY(SELECT id FROM foo WHERE parent_id = f.id) AS children
FROM foo f
WHERE id = 1
UNION ALL
SELECT round+1, f.id, f.parent_id, ARRAY(SELECT id FROM foo WHERE parent_id = f.id) AS children
FROM tree t
JOIN foo f ON (f.id = ANY(t.children))
),
rev AS (
SELECT r.round-1 AS round,
to_jsonb(ARRAY(
SELECT a
FROM (
SELECT f.parent_id AS id, json_agg(jsonb_build_object('id', f.id, 'children', '{}'::text[])) AS children
FROM tree t
JOIN foo f ON (f.id = t.id)
WHERE t.round = r.round
GROUP BY f.parent_id
) a
)) AS list
FROM (SELECT MAX(round)::int AS round FROM tree) r
UNION ALL
SELECT r.round-1,
to_jsonb(ARRAY(
SELECT a
FROM (
SELECT f.parent_id AS id, json_agg(jsonb_build_object('id', f.id, 'children', t->'children')) AS children
FROM jsonb_array_elements(list) t
JOIN foo f ON (f.id = (t->>'id')::int)
GROUP BY f.parent_id
) a
)) AS list
FROM rev r
WHERE round > 1
)
SELECT list as nested_json_tree
FROM rev
WHERE round = 1
复杂性在于要求首先构建树(自上而下),然后从树中构建对象,自下而上。由于递归查询的限制,递归自下而上是棘手的,例如 UNION ALL 部分中的递归别名不能被分组,也不能包含在子查询中。我通过倒转解包解决了这个问题。
这个查询应该正确构建复杂的树,每个节点有多个子节点,嵌套层数不限。