问题描述
要求是插入从AAAAA到ZZZZZ的所有可能组合
即组合总数为11881376(26 * 26 * 26 * 26 * 26)
我尝试过:
DECLARE我编号:= 65;
BEGIN
WHILE(i< = 90)LOOP
DECLARE j号码:= 65;
BEGIN
WHILE (j
DECLARE k number:= 65;
BEGIN
WHILE(k
DECLARE l number:= 65;
BEGIN
WHILE(l< = 90)LOOP
DECLARE m number:= 65;
BEGIN
WHILE(m< ; = 90)LOOP
INSERT IN MAPS.ALPHABETS_CHARCTER(ALPHABETS)
VALUES(CHR(i)|| CHR(j)|| CHR(k)|| CHR (l)|| CHR(m));
m:= m + 1;
END LOOP;
END;
l:= l + 1;
END LOOP;
END;
k:= k + 1;
END LOOP;
END;
j:= j + 1;
END LOOP;
END;
i:= i + 1;
END LOOP;
END;
Requirement is to Insert every possible combination starting from AAAAA to ZZZZZ
i.e total no of combinations are 11881376 (26*26*26*26*26)
What I have tried:
DECLARE i number :=65;
BEGIN
WHILE (i<=90) LOOP
DECLARE j number :=65;
BEGIN
WHILE (j<=90) LOOP
DECLARE k number :=65;
BEGIN
WHILE (k<=90) LOOP
DECLARE l number :=65;
BEGIN
WHILE (l<=90) LOOP
DECLARE m number :=65;
BEGIN
WHILE (m<=90) LOOP
INSERT INTO MAPS.ALPHABETS_CHARCTER (ALPHABETS)
VALUES(CHR(i) || CHR(j) || CHR(k) || CHR(l) || CHR(m));
m :=m + 1;
END LOOP;
END;
l :=l + 1;
END LOOP;
END;
k :=k + 1;
END LOOP;
END;
j :=j + 1;
END LOOP;
END;
i := i + 1;
END LOOP;
END;
推荐答案
要求插入从AAAAA到ZZZZZ的所有可能组合
总共没有组合是11881376(26 * 26 * 26 * 26 * 26)
Requirement is to Insert every possible combination starting from AAAAA to ZZZZZ
i.e total no of combinations are 11881376 (26*26*26*26*26)
所以你要插入11881376条记录,你想知道为什么需要时间?
$ b $ 40 11881376在40分钟内意味着每分钟297k记录或每秒5k记录,还不错。
你的剧本很大!
So you are inserting 11881376 records and you wonder why it takes time ?
11881376 in 40 minutes means 297k records per minute or 5k record per second, not so bad.
Your script is huge !
这篇关于插入语句脚本几乎耗时40分钟来执行的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持!