explain.depesz.com

PostgreSQL's explain analyze made readable

Result: 6rXW

Settings
# exclusive inclusive rows x rows loops node
1. 0.000 0.000 ↓ 0.0
→

HashAggregate (cost=83.83..83.86 rows=3 width=439) (actual rows= loops=)

  • Group Key: item.itemid, item.itemname, uomlist.uomname, item.manufacture, item.hsnnumber, itemgroup.itemgroupname, uomgroups.baseunit, uomlist.groupid, item.quantity, item.purhcaseunit, item.salesunit, item.openingstock, item.purchaseprice, COALESCE((((s (...)
2. 0.000 0.000 ↓ 0.0
→

Hash Right Join (cost=64.03..83.66 rows=3 width=439) (actual rows= loops=)

  • Hash Cond: ((uomlist_1.id = item.salesmeasuringunitid) AND (uomlist_1.groupid = item.uomgroupid))
3. 0.000 0.000 ↓ 0.0
→

Seq Scan on uomlist uomlist_1 (cost=0.00..15.50 rows=550 width=36) (actual rows= loops=)

4. 0.000 0.000 ↓ 0.0
→

Hash (cost=63.98..63.98 rows=3 width=409) (actual rows= loops=)

5. 0.000 0.000 ↓ 0.0
→

Hash Right Join (cost=46.94..63.98 rows=3 width=409) (actual rows= loops=)

  • Hash Cond: (uomgroups.uomgroupid = item.uomgroupid)
6. 0.000 0.000 ↓ 0.0
→

Seq Scan on uomgroups (cost=0.00..15.10 rows=510 width=34) (actual rows= loops=)

7. 0.000 0.000 ↓ 0.0
→

Hash (cost=46.92..46.92 rows=1 width=377) (actual rows= loops=)

8. 0.000 0.000 ↓ 0.0
→

Nested Loop Left Join (cost=25.79..46.92 rows=1 width=377) (actual rows= loops=)

  • Join Filter: (item.itemid = purchase_details.itemid)
9. 0.000 0.000 ↓ 0.0
→

Hash Join (cost=13.39..33.02 rows=1 width=369) (actual rows= loops=)

  • Hash Cond: ((uomlist.id = item.purchasemeasuringunitid) AND (uomlist.groupid = item.uomgroupid))
10. 0.000 0.000 ↓ 0.0
→

Seq Scan on uomlist (cost=0.00..15.50 rows=550 width=36) (actual rows= loops=)

11. 0.000 0.000 ↓ 0.0
→

Hash (cost=13.33..13.33 rows=4 width=335) (actual rows= loops=)

12. 0.000 0.000 ↓ 0.0
→

Hash Right Join (cost=1.09..13.33 rows=4 width=335) (actual rows= loops=)

  • Hash Cond: (itemgroup.id = item.itemgroupid)
13. 0.000 0.000 ↓ 0.0
→

Seq Scan on itemgroup (cost=0.00..11.60 rows=160 width=34) (actual rows= loops=)

14. 0.000 0.000 ↓ 0.0
→

Hash (cost=1.04..1.04 rows=4 width=337) (actual rows= loops=)

15. 0.000 0.000 ↓ 0.0
→

Seq Scan on item (cost=0.00..1.04 rows=4 width=337) (actual rows= loops=)

16. 0.000 0.000 ↓ 0.0
→

HashAggregate (cost=12.40..13.00 rows=40 width=76) (actual rows= loops=)

  • Group Key: purchase_details.itemid
17. 0.000 0.000 ↓ 0.0
→

Seq Scan on purchase_details (cost=0.00..11.50 rows=40 width=76) (actual rows= loops=)

  • Filter: (availableqty > 0::double precision)