explain.depesz.com

A tool for finding a real cause for slow queries.

Result: NBY3

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

Sort (cost=63741.92..63741.92 rows=1 width=498) (actual time=.. rows= loops=)

  • Sort Key: fs_agrperson.fs_party
2. 0.000 0.000 ↓ 0.0
→

Nested Loop (cost=0.00..63741.91 rows=1 width=498) (actual time=.. rows= loops=)

  • Join Filter: ((fs_agrperson.tril_gid)::text = (cm_ledgeritem.salesteam)::text)
3. 0.000 0.000 ↓ 0.0
→

Nested Loop (cost=0.00..1873.18 rows=1 width=132) (actual time=.. rows= loops=)

4. 0.000 0.000 ↓ 0.0
→

Seq Scan on fs_debtitem (cost=0.00..1864.89 rows=1 width=66) (actual time=.. rows= loops=)

  • Filter: (fs_annualize = 123)
5. 0.000 0.000 ↓ 0.0
→

Index Scan using idx_fsap_party on fs_agrperson (cost=0.00..8.28 rows=1 width=66) (actual time=.. rows= loops=)

  • Index Cond: ((fs_agrperson.fs_party)::text = (fs_debtitem.fs_party)::text)
6. 0.000 0.000 ↓ 0.0
→

Seq Scan on cm_ledgeritem (cost=0.00..61809.41 rows=4745 width=399) (actual time=.. rows= loops=)

  • Filter: (cm_ledgeritem.fs_batchid = 123123)