次のクエリは、postgresql 9.1 で約 300 ~ 400 ミリ秒かかります。テーブルには最大 2M 行が含まれています。このパフォーマンスは正当化されますか? 改善できますか?
SELECT "Products"."Id"
, "Products"."Title"
, "Products"."ThumbHeight"
, "Products"."LargeImageWidth"
, "Products"."LargeImageHeight"
, "Products"."Url"
, "Products"."BrowseNodeId"
FROM "Products"
WHERE "Products"."Id" = ANY(ARRAY(SELECT (random()*2233071)::int
FROM generate_series(1, 100)));
そして、ここに説明計画があります:
--------------------------------------------------------------------------------
Bitmap Heap Scan on "Products" (cost=60.48..100.46 rows=10 width=268)
Recheck Cond: ("Id" = ANY ($0))
InitPlan 1 (returns $0)
-> Function Scan on generate_series (cost=0.00..17.50 rows=1000 width=0)
-> Bitmap Index Scan on "Products_pkey" (cost=0.00..42.97 rows=10 width=0)
Index Cond: ("Id" = ANY ($0))
説明分析:
Bitmap Heap Scan on "Products" (cost=60.48..100.46 rows=10 width=268) (actual time=77.702..80.944 rows=100 loops=1)
Recheck Cond: ("Id" = ANY ($0))
InitPlan 1 (returns $0)
-> Function Scan on generate_series (cost=0.00..17.50 rows=1000 width=0) (actual time=0.097..0.348 rows=100 loops=1)
-> Bitmap Index Scan on "Products_pkey" (cost=0.00..42.97 rows=10 width=0) (actual time=77.601..77.601 rows=104 loops=1)
Index Cond: ("Id" = ANY ($0))
Total runtime: 81.409 ms
Id は主キーです。
"Products_pkey" PRIMARY KEY, btree ("Id")
ありがとう!