我有一张这样的表:
CREATE TABLE cache (
id BIGSERIAL PRIMARY KEY,
source char(2) NOT NULL,
target char(2) NOT NULL,
q TEXT NOT NULL,
result TEXT,
profile TEXT NOT NULL DEFAULT '',
created TIMESTAMP NOT NULL DEFAULT now(),
api_engine text NOT NULL,
encoded TEXT NOT NULL
);
我想传递编码的字段列表(可能是OVER ... WINDOW?) 有类似的东西:
SELECT id, string_agg(encoded, '&q=') FROM cache
所以我将得到相应的id列表,以及一串连接的字段 encoded :'&q=encoded1&q=encoded2&q=encoded3'
...总长度不超过某个限制(比如不超过2000个字符) )。
第二个条件,我想转到下一个窗口,当其中一个字段: source,target或profile 被更改时。
如果可以在FOR LOOP中使用SQL SELECT吗?
我知道如何使用plpgsql / plpython / plperl,但我想优化此请求。
FOR rec IN
SELECT array_agg(id) AS ids, string_agg(encoded, '&q=') AS url FROM cache
WHERE result IS NULL
ORDER BY source, target
LOOP
-- here I call curl with that *url*
示例数据:
INSERT INTO cache (id, source, target, q, result, profile, api_engine, encoded) VALUES
(1, 'ru', 'en', 'Длинная фраза по-русски' , NULL, '', 'google', '%D0%94%D0%BB%D0%B8%D0%BD%D0%BD%D0%B0%D1%8F+%D1%84%D1%80%D0%B0%D0%B7%D0%B0+%D0%BF%D0%BE-%D1%80%D1%83%D1%81%D1%81%D0%BA%D0%B8')
, (2, 'ru', 'es', 'Ещё одна непонятная фраза по-русски', NULL, '', 'google', '%D0%95%D1%89%D1%91+%D0%BE%D0%B4%D0%BD%D0%B0+%D0%BD%D0%B5%D0%BF%D0%BE%D0%BD%D1%8F%D1%82%D0%BD%D0%B0%D1%8F+%D1%84%D1%80%D0%B0%D0%B7%D0%B0+%D0%BF%D0%BE-%D1%80%D1%83%D1%81%D1%81%D0%BA%D0%B8')
-- etc...
依此类推,100500行。字段源和目标可以是不同的语言代码,它们会重复,因此我需要执行GROUP BY source, target, profile
。
我想先选择N行,其中字段编码的串联与某些分隔符如
&q=%D0%94%D0%BB%D0%B8%D0%BD%D0%BD%D0%B0%D1%8F+%D1%84%D1%80%D0%B0%D0%B7%D0%B0+%D0%BF%D0%BE-%D1%80%D1%83%D1%81%D1%81%D0%BA%D0%B8&q=%D0%95%D1%89%D1%91+%D0%BE%D0%B4%D0%BD%D0%B0+%D0%BD%D0%B5%D0%BF%D0%BE%D0%BD%D1%8F%D1%82%D0%BD%D0%B0%D1%8F+%D1%84%D1%80%D0%B0%D0%B7%D0%B0+%D0%BF%D0%BE-%D1%80%D1%83%D1%81%D1%81%D0%BA%D0%B8
所以这个连接字符串的长度不超过(2000)字符。因此,我将拥有该字符串,以及这些行的所有ID,包含在url中(确保顺序相同)。
然后我想用相同的标准选择接下来的N行,依此类推。
答案 0 :(得分:1)
你可以通过智能递归CTE来实现:
WITH RECURSIVE c AS ( -- 1st CTE is not recursive
SELECT dense_rank() OVER (ORDER BY source, target, profile) AS rnk
, row_number() OVER (PARTITION BY source, target, profile ORDER BY id) AS rn
, lead(encoded) OVER (PARTITION BY source, target, profile ORDER BY id) AS next_enc
, id, encoded
FROM cache
)
, rcte AS ( -- "recursion" starts here
SELECT rnk, rn, ARRAY[id] AS ids, encoded AS url
, CASE WHEN length(concat_ws('&q=', encoded || next_enc)) > 2000 -- max len
OR next_enc IS NULL -- last in partition
THEN TRUE END AS print
FROM c
WHERE rn = 1
UNION ALL
SELECT c.rnk, c.rn
, CASE WHEN r.print THEN ARRAY[id] ELSE r.ids || c.id END AS ids
, CASE WHEN r.print THEN c.encoded ELSE concat_ws('&q=', r.url, c.encoded) END AS url
, CASE WHEN length(
CASE WHEN r.print THEN concat_ws('&q=', c.encoded, c.next_enc)
ELSE concat_ws('&q=', r.url, c.encoded, c.next_enc) END) > 2000 -- max len
OR c.next_enc IS NULL -- last in partition
THEN TRUE END AS print
FROM rcte r
JOIN c USING (rnk)
WHERE c.rn = r.rn + 1
)
SELECT ids, url
FROM rcte
WHERE print
ORDER BY rnk, rn;
关于包括非递归CTE的rCTE:
但这可能是极少数情况下,plpgsql函数中的循环实际上更快。
有关更多解释,请参阅此相关答案: