explain.depesz.com

PostgreSQL's explain analyze made readable

Result: Qzbp

Settings
# exclusive inclusive rows x rows loops node
1. 0.002 0.382 ↓ 4.0 8 1

Limit (cost=12.55..12.56 rows=2 width=579) (actual time=0.380..0.382 rows=8 loops=1)

  • Output: t0_.name, t0_.address, t0_.phone, t0_.email, t0_.website, t0_.description, t0_.priority, t0_.last_contacted_date, t0_.blacklist_description, t0_.development_aid_id, t0_.development_aid_last_update, t0_.source_url, t0_.id, t0_.create_time, t0_.last_update, t0_.updated_by, t0_.recruitment_status_id, t0_.blacklist_status_id, t1_.name
2. 0.036 0.380 ↓ 4.0 8 1

Sort (cost=12.55..12.56 rows=2 width=579) (actual time=0.379..0.380 rows=8 loops=1)

  • Output: t0_.name, t0_.address, t0_.phone, t0_.email, t0_.website, t0_.description, t0_.priority, t0_.last_contacted_date, t0_.blacklist_description, t0_.development_aid_id, t0_.development_aid_last_update, t0_.source_url, t0_.id, t0_.create_time, t0_.last_update, t0_.updated_by, t0_.recruitment_status_id, t0_.blacklist_status_id, t1_.name
  • Sort Key: t1_.name
  • Sort Method: quicksort Memory: 27kB
3. 0.017 0.344 ↓ 4.0 8 1

Hash Join (cost=10.58..12.54 rows=2 width=579) (actual time=0.283..0.344 rows=8 loops=1)

  • Output: t0_.name, t0_.address, t0_.phone, t0_.email, t0_.website, t0_.description, t0_.priority, t0_.last_contacted_date, t0_.blacklist_description, t0_.development_aid_id, t0_.development_aid_last_update, t0_.source_url, t0_.id, t0_.create_time, t0_.last_update, t0_.updated_by, t0_.recruitment_status_id, t0_.blacklist_status_id, t1_.name
  • Hash Cond: (t0_.id = t9_.organization_id)
4. 0.040 0.280 ↓ 2.4 41 1

Hash Join (cost=8.32..10.20 rows=17 width=587) (actual time=0.223..0.280 rows=41 loops=1)

  • Output: t0_.name, t0_.address, t0_.phone, t0_.email, t0_.website, t0_.description, t0_.priority, t0_.last_contacted_date, t0_.blacklist_description, t0_.development_aid_id, t0_.development_aid_last_update, t0_.source_url, t0_.id, t0_.create_time, t0_.last_update, t0_.updated_by, t0_.recruitment_status_id, t0_.blacklist_status_id, t1_.name, t7_.organization_id
  • Hash Cond: (t7_.organization_type_id = t6_.id)
5. 0.040 0.230 ↓ 2.4 41 1

Hash Right Join (cost=7.20..8.86 rows=17 width=595) (actual time=0.200..0.230 rows=41 loops=1)

  • Output: t0_.name, t0_.address, t0_.phone, t0_.email, t0_.website, t0_.description, t0_.priority, t0_.last_contacted_date, t0_.blacklist_description, t0_.development_aid_id, t0_.development_aid_last_update, t0_.source_url, t0_.id, t0_.create_time, t0_.last_update, t0_.updated_by, t0_.recruitment_status_id, t0_.blacklist_status_id, t1_.name, t7_.organization_id, t7_.organization_type_id
  • Hash Cond: (t5_.organization_id = t0_.id)
6. 0.010 0.010 ↑ 1.0 35 1

Seq Scan on public.tbl_organization_sectors t5_ (cost=0.00..1.35 rows=35 width=8) (actual time=0.006..0.010 rows=35 loops=1)

  • Output: t5_.organization_id, t5_.sector_id
7. 0.021 0.180 ↓ 1.2 20 1

Hash (cost=7.00..7.00 rows=16 width=595) (actual time=0.180..0.180 rows=20 loops=1)

  • Output: t0_.name, t0_.address, t0_.phone, t0_.email, t0_.website, t0_.description, t0_.priority, t0_.last_contacted_date, t0_.blacklist_description, t0_.development_aid_id, t0_.development_aid_last_update, t0_.source_url, t0_.id, t0_.create_time, t0_.last_update, t0_.updated_by, t0_.recruitment_status_id, t0_.blacklist_status_id, t1_.name, t7_.organization_id, t7_.organization_type_id
  • Buckets: 1024 Batches: 1 Memory Usage: 17kB
8. 0.025 0.159 ↓ 1.2 20 1

Hash Left Join (cost=5.40..7.00 rows=16 width=595) (actual time=0.123..0.159 rows=20 loops=1)

  • Output: t0_.name, t0_.address, t0_.phone, t0_.email, t0_.website, t0_.description, t0_.priority, t0_.last_contacted_date, t0_.blacklist_description, t0_.development_aid_id, t0_.development_aid_last_update, t0_.source_url, t0_.id, t0_.create_time, t0_.last_update, t0_.updated_by, t0_.recruitment_status_id, t0_.blacklist_status_id, t1_.name, t7_.organization_id, t7_.organization_type_id
  • Hash Cond: (t0_.recruitment_status_id = t1_.id)
9. 0.028 0.123 ↓ 1.2 20 1

Hash Right Join (cost=4.22..5.75 rows=16 width=583) (actual time=0.100..0.123 rows=20 loops=1)

  • Output: t0_.name, t0_.address, t0_.phone, t0_.email, t0_.website, t0_.description, t0_.priority, t0_.last_contacted_date, t0_.blacklist_description, t0_.development_aid_id, t0_.development_aid_last_update, t0_.source_url, t0_.id, t0_.create_time, t0_.last_update, t0_.updated_by, t0_.recruitment_status_id, t0_.blacklist_status_id, t7_.organization_id, t7_.organization_type_id
  • Hash Cond: (t3_.organization_id = t0_.id)
10. 0.012 0.012 ↑ 1.0 29 1

Seq Scan on public.tbl_organization_countries t3_ (cost=0.00..1.29 rows=29 width=16) (actual time=0.006..0.012 rows=29 loops=1)

  • Output: t3_.organization_id, t3_.country_id
11. 0.022 0.083 ↑ 1.0 16 1

Hash (cost=4.02..4.02 rows=16 width=583) (actual time=0.083..0.083 rows=16 loops=1)

  • Output: t0_.name, t0_.address, t0_.phone, t0_.email, t0_.website, t0_.description, t0_.priority, t0_.last_contacted_date, t0_.blacklist_description, t0_.development_aid_id, t0_.development_aid_last_update, t0_.source_url, t0_.id, t0_.create_time, t0_.last_update, t0_.updated_by, t0_.recruitment_status_id, t0_.blacklist_status_id, t7_.organization_id, t7_.organization_type_id
  • Buckets: 1024 Batches: 1 Memory Usage: 16kB
12. 0.026 0.061 ↑ 1.0 16 1

Hash Join (cost=1.36..4.02 rows=16 width=583) (actual time=0.034..0.061 rows=16 loops=1)

  • Output: t0_.name, t0_.address, t0_.phone, t0_.email, t0_.website, t0_.description, t0_.priority, t0_.last_contacted_date, t0_.blacklist_description, t0_.development_aid_id, t0_.development_aid_last_update, t0_.source_url, t0_.id, t0_.create_time, t0_.last_update, t0_.updated_by, t0_.recruitment_status_id, t0_.blacklist_status_id, t7_.organization_id, t7_.organization_type_id
  • Hash Cond: (t0_.id = t7_.organization_id)
13. 0.022 0.022 ↑ 1.0 33 1

Seq Scan on public.tbl_organizations t0_ (cost=0.00..2.33 rows=33 width=567) (actual time=0.005..0.022 rows=33 loops=1)

  • Output: t0_.name, t0_.address, t0_.phone, t0_.email, t0_.website, t0_.description, t0_.priority, t0_.last_contacted_date, t0_.blacklist_description, t0_.development_aid_id, t0_.development_aid_last_update, t0_.source_url, t0_.id, t0_.create_time, t0_.last_update, t0_.updated_by, t0_.recruitment_status_id, t0_.blacklist_status_id
14. 0.006 0.013 ↑ 1.0 16 1

Hash (cost=1.16..1.16 rows=16 width=16) (actual time=0.013..0.013 rows=16 loops=1)

  • Output: t7_.organization_id, t7_.organization_type_id
  • Buckets: 1024 Batches: 1 Memory Usage: 9kB
15. 0.007 0.007 ↑ 1.0 16 1

Seq Scan on public.tbl_organization_types t7_ (cost=0.00..1.16 rows=16 width=16) (actual time=0.004..0.007 rows=16 loops=1)

  • Output: t7_.organization_id, t7_.organization_type_id
16. 0.006 0.011 ↑ 1.0 8 1

Hash (cost=1.08..1.08 rows=8 width=20) (actual time=0.011..0.011 rows=8 loops=1)

  • Output: t1_.name, t1_.id
  • Buckets: 1024 Batches: 1 Memory Usage: 9kB
17. 0.005 0.005 ↑ 1.0 8 1

Seq Scan on public.tbl_dictionary_recruitment_statuses t1_ (cost=0.00..1.08 rows=8 width=20) (actual time=0.004..0.005 rows=8 loops=1)

  • Output: t1_.name, t1_.id
18. 0.004 0.010 ↑ 1.0 5 1

Hash (cost=1.05..1.05 rows=5 width=8) (actual time=0.010..0.010 rows=5 loops=1)

  • Output: t6_.id
  • Buckets: 1024 Batches: 1 Memory Usage: 9kB
19. 0.006 0.006 ↑ 1.0 5 1

Seq Scan on public.tbl_dictionary_organization_type t6_ (cost=0.00..1.05 rows=5 width=8) (actual time=0.003..0.006 rows=5 loops=1)

  • Output: t6_.id
20. 0.003 0.047 ↑ 1.0 3 1

Hash (cost=2.22..2.22 rows=3 width=8) (actual time=0.047..0.047 rows=3 loops=1)

  • Output: t9_.organization_id
  • Buckets: 1024 Batches: 1 Memory Usage: 9kB
21. 0.016 0.044 ↑ 1.0 3 1

Hash Join (cost=1.07..2.22 rows=3 width=8) (actual time=0.039..0.044 rows=3 loops=1)

  • Output: t9_.organization_id
  • Hash Cond: (t8_.id = t9_.user_id)
22. 0.016 0.016 ↑ 1.0 9 1

Seq Scan on public.tbl_users t8_ (cost=0.00..1.09 rows=9 width=8) (actual time=0.013..0.016 rows=9 loops=1)

  • Output: t8_.id
23. 0.008 0.012 ↑ 1.0 3 1

Hash (cost=1.03..1.03 rows=3 width=16) (actual time=0.012..0.012 rows=3 loops=1)

  • Output: t9_.organization_id, t9_.user_id
  • Buckets: 1024 Batches: 1 Memory Usage: 9kB
24. 0.004 0.004 ↑ 1.0 3 1

Seq Scan on public.tbl_organization_responsibles t9_ (cost=0.00..1.03 rows=3 width=16) (actual time=0.003..0.004 rows=3 loops=1)

  • Output: t9_.organization_id, t9_.user_id
Planning time : 3.147 ms
Execution time : 0.566 ms