som*_*ame 6 database postgresql sql-execution-plan
我有一个查询,它使用嵌套循环等同连接两个表,TableA和TableB.因为"相等" -join contraint的,所有行中的结果返回,因此将来自每个这两个表的对应于至少一排.但是,根据计划(EXPLAIN ANALYZE),即使在最终结果中返回一行,实际行数也是TableB中的0.这里的实际行数如何等于零?
这是执行计划:
=> explain analyze select p.id, p.title, s.count from products p, stock s where p.id = s.p_id and s.w_id = 6 and p.type = 9 and s.count > 0 order by p.title;
QUERY PLAN
------------------------------------------------------------------------------------------------------------------------------
Sort (cost=42.42..42.42 rows=2 width=36) (actual time=0.198..0.199 rows=1 loops=1)
Sort Key: p.title
Sort Method: quicksort Memory: 25kB
-> Nested Loop (cost=0.00..42.41 rows=2 width=36) (actual time=0.170..0.181 rows=1 loops=1)
-> Seq Scan on products p (cost=0.00..9.25 rows=4 width=32) (actual time=0.068..0.106 rows=4 loops=1)
Filter: (type = 9)
-> Index Scan using stock_pk on stock s (cost=0.00..8.28 rows=1 width=8) (actual time=0.015..0.015 rows=0 loops=4)
Index Cond: ((w_id = 6) AND (p_id = p.id))
Filter: (count > 0)
Total runtime: 0.290 ms
Run Code Online (Sandbox Code Playgroud)
和两个表定义......产品表第一:
=> \d products
Table "public.products"
Column | Type | Modifiers
--------+------------------------+-----------
id | integer | not null
title | character varying(100) |
type | integer |
price | double precision |
filler | character(500) |
Indexes:
"products_pkey" PRIMARY KEY, btree (id)
"products_type_idx" btree (type)
Referenced by:
TABLE "orderline" CONSTRAINT "orderline_p_id_fkey" FOREIGN KEY (p_id) REFERENCES products(id)
TABLE "stock" CONSTRAINT "stock_p_id_fkey" FOREIGN KEY (p_id) REFERENCES products(id)
Run Code Online (Sandbox Code Playgroud)
库存表:
=> \d stock
Table "public.stock"
Column | Type | Modifiers
--------+---------+-----------
w_id | integer | not null
p_id | integer | not null
count | integer |
Indexes:
"stock_pk" PRIMARY KEY, btree (w_id, p_id)
"stock_p_id_idx" btree (p_id)
Foreign-key constraints:
"stock_p_id_fkey" FOREIGN KEY (p_id) REFERENCES products(id)
"stock_w_id_fkey" FOREIGN KEY (w_id) REFERENCES warehouses(id)
Run Code Online (Sandbox Code Playgroud)
内部索引扫描的实际行是每次调用返回的平均行数。
查看http://www.postgresql.org/docs/current/static/using-explain.html:
在某些查询计划中,子计划节点可能会执行多次。例如,在上述嵌套循环计划中,每个外部行执行一次内部索引扫描。在这种情况下,循环值报告该节点的执行总数,并且显示的实际时间和行值是每次执行的平均值。这样做是为了使数字与显示成本估算的方式具有可比性。乘以loops值可得到该节点实际花费的总时间。
我不确定如何四舍五入(在平均后,我猜到了最接近的整数),但是可能是大多数行中products
没有对应的行stock
。