explain.depesz.com

PostgreSQL's explain analyze made readable

Result: UiL6

Settings
# exclusive inclusive rows x rows loops node
1. 0.123 77.550 ↑ 195.0 4 1

Sort (cost=376.94..378.89 rows=780 width=3,133) (actual time=77.508..77.550 rows=4 loops=1)

  • Sort Key: l."Id
  • Sort Method: quicksort Memory: 33kB
2. 0.100 77.427 ↑ 195.0 4 1

Hash Left Join (cost=85.66..339.47 rows=780 width=3,133) (actual time=72.575..77.427 rows=4 loops=1)

  • Hash Cond: ((l."LegalEntityTypeRefValue")::text = ("l.LegalEntityTypeRef"."Value")::text)
3. 0.111 77.113 ↑ 195.0 4 1

Hash Left Join (cost=84.48..335.30 rows=780 width=2,462) (actual time=72.337..77.113 rows=4 loops=1)

  • Hash Cond: (l."LogoId" = "l.Logo"."Id")
4. 0.122 70.933 ↑ 195.0 4 1

Hash Left Join (cost=69.82..318.58 rows=780 width=2,286) (actual time=66.229..70.933 rows=4 loops=1)

  • Hash Cond: (l."LicenseId" = "l.License"."Id")
5. 0.152 40.793 ↑ 195.0 4 1

Hash Left Join (cost=28.29..275.01 rows=780 width=2,157) (actual time=36.163..40.793 rows=4 loops=1)

  • Hash Cond: ("l.Accreditation"."AccreditationCategoryRefId" = "l.Accreditation.AccreditationCategoryRef"."Id")
6. 0.363 40.417 ↑ 195.0 4 1

Hash Left Join (cost=27.20..270.34 rows=780 width=1,487) (actual time=35.856..40.417 rows=4 loops=1)

  • Hash Cond: (l."AccreditationId" = "l.Accreditation"."Id")
7. 0.155 5.732 ↑ 195.0 4 1

Hash Left Join (cost=1.36..242.44 rows=780 width=1,450) (actual time=1.246..5.732 rows=4 loops=1)

  • Hash Cond: ((l."LegalFormRefValue")::text = ("l.LegalFormRef"."Value")::text)
8. 5.024 5.024 ↑ 195.0 4 1

Seq Scan on "LegalEntities" l (cost=0.00..238.70 rows=780 width=724) (actual time=0.619..5.024 rows=4 loops=1)

  • Filter: (immutable_array_to_string(avals("NameTranslations"), ','::text) ~~* '%a%'::text)
  • Rows Removed by Filter: 776
9. 0.176 0.553 ↑ 1.0 16 1

Hash (cost=1.16..1.16 rows=16 width=726) (actual time=0.544..0.553 rows=16 loops=1)

  • Buckets: 1024 Batches: 1 Memory Usage: 13kB
10. 0.377 0.377 ↑ 1.0 16 1

Seq Scan on "LegalFormRefs" "l.LegalFormRef" (cost=0.00..1.16 rows=16 width=726) (actual time=0.034..0.377 rows=16 loops=1)

11. 16.546 34.322 ↑ 1.0 882 1

Hash (cost=14.82..14.82 rows=882 width=37) (actual time=34.314..34.322 rows=882 loops=1)

  • Buckets: 1024 Batches: 1 Memory Usage: 51kB
12. 17.776 17.776 ↑ 1.0 882 1

Seq Scan on "Accreditations" "l.Accreditation" (cost=0.00..14.82 rows=882 width=37) (actual time=0.261..17.776 rows=882 loops=1)

13. 0.090 0.224 ↑ 1.0 4 1

Hash (cost=1.04..1.04 rows=4 width=670) (actual time=0.216..0.224 rows=4 loops=1)

  • Buckets: 1024 Batches: 1 Memory Usage: 9kB
14. 0.134 0.134 ↑ 1.0 4 1

Seq Scan on "AccreditationCategoryRefs" "l.Accreditation.AccreditationCategoryRef" (cost=0.00..1.04 rows=4 width=670) (actual time=0.068..0.134 rows=4 loops=1)

15. 15.077 30.018 ↑ 1.0 1,179 1

Hash (cost=26.79..26.79 rows=1,179 width=129) (actual time=30.010..30.018 rows=1,179 loops=1)

  • Buckets: 2048 Batches: 1 Memory Usage: 138kB
16. 14.941 14.941 ↑ 1.0 1,179 1

Seq Scan on "Licenses" "l.License" (cost=0.00..26.79 rows=1,179 width=129) (actual time=0.026..14.941 rows=1,179 loops=1)

17. 2.978 6.069 ↑ 1.0 296 1

Hash (cost=10.96..10.96 rows=296 width=176) (actual time=6.061..6.069 rows=296 loops=1)

  • Buckets: 1024 Batches: 1 Memory Usage: 70kB
18. 3.091 3.091 ↑ 1.0 296 1

Seq Scan on "Files" "l.Logo" (cost=0.00..10.96 rows=296 width=176) (actual time=0.021..3.091 rows=296 loops=1)

19. 0.111 0.214 ↑ 1.0 8 1

Hash (cost=1.08..1.08 rows=8 width=671) (actual time=0.191..0.214 rows=8 loops=1)

  • Buckets: 1024 Batches: 1 Memory Usage: 11kB
20. 0.103 0.103 ↑ 1.0 8 1

Seq Scan on "LegalEntityTypeRefs" "l.LegalEntityTypeRef" (cost=0.00..1.08 rows=8 width=671) (actual time=0.021..0.103 rows=8 loops=1)

Planning time : 5.623 ms
Execution time : 78.618 ms