3

我有一个选择查询,它将返回类似于下表的内容:

开始 | 停止 | ID
------------------
0 | 100 | 1
1 | 101 | 1
2 | 102 | 1
2 | 102 | 2
5 | 105 | 1
7 | 107 | 2
...
300 | 400 | 1
370 | 470 | 1
450 | 550 | 1

其中停止 = 开始 + n; 在这种情况下,n = 100。

我想合并每个 id 的重叠:

开始 | 停止 | ID
------------------
0 | 105 | 1
2 | 107 | 2
...
300 | 550 | 1

id 1 不给出 0 - 550,因为开始 300 在停止 105 之后。

第一次查询会返回几十万条记录,n 可以达到几万条,所以处理得越快越好。

顺便说一句,使用 PostgreSQL。

4

1 回答 1

3
WITH    bounds AS
        (
        SELECT  *, ROW_NUMBER() OVER (PARTITION BY id ORDER BY start) AS rn
        FROM    (
                SELECT  id, LAG(stop) OVER (PARTITION BY id ORDER BY start) AS pstop, start
                FROM    q
                UNION ALL
                SELECT  id, MAX(stop), NULL
                FROM    q
                GROUP BY
                        id
                ) q2
        WHERE   start > pstop OR pstop IS NULL OR start IS NULL
        )
SELECT  b2.start, b1.pstop
FROM    bounds b1
JOIN    bounds b2
ON      b1.id = b2.id
        AND b1.rn = b2.rn + 1
于 2010-11-09T14:55:38.023 回答