我想编写一个通过重叠数组对行进行分组的查询。考虑以下示例:
id | name | family_ids
--------------------------
1 | Alice | [f1, f2]
2 | Bob | [f1]
3 | Freddy | [f2, f3]
4 | James | [f3]
5 | Joe | [f4, f5]
6 | Tim | [f5]
爱丽丝和鲍勃是同一个家庭的成员,f1
。在爱丽丝的姻亲 (f2
) 中,她也与弗雷迪有亲戚关系。而且考虑到弗雷迪的姻亲 (f3
),詹姆斯也与他们有血缘关系。
所以,基本上,我想按有任何重叠的 family_ids
中的数组进行分组。但是,请注意,还应该发现 f2 -> f3
,这是通过 1 个简单的 group by
查询不可能实现的。
ids | family_ids
----------------------------
[1, 2, 3, 4] | [f1, f2, f3]
[5, 6] | [f4, f5]
我已经尝试了很多内部连接
,group by t1.family_ids && t2.family_ids
,但似乎找不到一个性能良好的解决方案。该表现在的大小约为 100k 行。将来,该表将增长到约 500k-1M 行。
最佳答案
这是一个图行走问题。
一种常见的方法是取消数组的嵌套以生成节点,然后在匹配的族上进行自连接以计算所有边。然后,我们可以使用递归查询来遍历图,同时注意不要两次访问同一节点,然后聚合以生成组。最后一步是恢复相应的家庭 ID。
with recursive
nodes as (
select t.id, x.family_id
from mytable t
cross join lateral unnest(t.family_ids) as x(family_id)
),
edges as (
select n1.id as id1, n2.id as id2
from nodes n1
inner join nodes n2 using (family_id)
),
cte as (
select id1, id2, array[id1] as visited
from edges
where id1 = id2
union all
select c.id1, e.id2, c.visited || e.id2
from cte c
inner join edges e on e.id1 = c.id2
where e.id2 <> all(c.visited)
),
res as (
select id1, array_agg(distinct id2 order by id2) as id2s
from cte
group by id1
)
select
array_agg(distinct n.id order by n.id) as ids,
array_agg(distinct n.family_id order by n.family_id) as family_ids
from res r
inner join nodes n on n.id = r.id1
group by r.id2s
<强> Demo on DB Fiddlde :
ids | family_ids :-------- | :--------- {1,2,3,4} | {f1,f2,f3} {5,6} | {f4,f5}
关于sql - PostgreSQL 中按数组重叠分组,我们在Stack Overflow上找到一个类似的问题: https://stackoverflow.com/questions/65071879/