explain.depesz.com

PostgreSQL's explain analyze made readable

Result: c1eg

Settings
# exclusive inclusive rows x rows loops node
1. 8.962 373.562 ↑ 1.0 25 1

Unique (cost=2,058.57..2,060.47 rows=25 width=2) (actual time=356.115..373.562 rows=25 loops=1)

2. 18.038 364.600 ↓ 6.5 2,465 1

Sort (cost=2,058.57..2,059.52 rows=381 width=2) (actual time=356.107..364.600 rows=2,465 loops=1)

  • Sort Key: x.""RegionId"
  • Sort Method: quicksort Memory: 212kB
3. 31.180 346.562 ↓ 6.5 2,465 1

Nested Loop (cost=1,123.21..2,042.23 rows=381 width=2) (actual time=197.214..346.562 rows=2,465 loops=1)

4. 18.764 300.592 ↓ 6.5 2,465 1

Hash Join (cost=1,122.79..1,397.11 rows=381 width=14) (actual time=197.181..300.592 rows=2,465 loops=1)

  • Hash Cond: (x.""Id"" = a0.""Address_Id"")
5. 47.812 201.698 ↓ 1.4 2,555 1

Hash Join (cost=685.86..949.32 rows=1,880 width=10) (actual time=117.039..201.698 rows=2,555 loops=1)

  • Hash Cond: (x.""Id"" = a.""Address_Id"")
6. 36.911 36.911 ↓ 1.0 9,728 1

Seq Scan on ""AddressH24"" x (cost=0.00..208.50 rows=9,642 width=6) (actual time=0.018..36.911 rows=9,728 loops=1)

  • Filter: (""RegionId"" IS NOT NULL)
  • Rows Removed by Filter: 3622
7. 10.687 116.975 ↓ 1.1 2,800 1

Hash (cost=653.32..653.32 rows=2,603 width=4) (actual time=116.972..116.975 rows=2,800 loops=1)

  • Buckets: 4096 Batches: 1 Memory Usage: 131kB
8. 21.774 106.288 ↓ 1.1 2,800 1

HashAggregate (cost=627.29..653.32 rows=2,603 width=4) (actual time=95.918..106.288 rows=2,800 loops=1)

  • Group Key: a.""Address_Id"
9. 21.895 84.514 ↓ 1.1 2,800 1

Hash Join (cost=563.06..620.78 rows=2,603 width=4) (actual time=30.573..84.514 rows=2,800 loops=1)

  • Hash Cond: (""a.Division"".""LegalEntityId"" = l.""Id"")
10. 21.468 51.868 ↑ 1.0 2,865 1

Hash Join (cost=320.85..371.03 rows=2,865 width=8) (actual time=19.791..51.868 rows=2,865 loops=1)

  • Hash Cond: (a.""Division_Id"" = ""a.Division"".""Id"")
11. 10.635 10.635 ↑ 1.0 2,865 1

Seq Scan on ""DivisionAddresses"" a (cost=0.00..42.65 rows=2,865 width=8) (actual time=0.010..10.635 rows=2,865 loops=1)

12. 9.669 19.765 ↑ 1.0 2,571 1

Hash (cost=288.71..288.71 rows=2,571 width=8) (actual time=19.761..19.765 rows=2,571 loops=1)

  • Buckets: 4096 Batches: 1 Memory Usage: 133kB
13. 10.096 10.096 ↑ 1.0 2,571 1

Seq Scan on ""Divisions"" ""a.Division"" (cost=0.00..288.71 rows=2,571 width=8) (actual time=0.008..10.096 rows=2,571 loops=1)

14. 5.245 10.751 ↑ 1.0 1,413 1

Hash (cost=224.55..224.55 rows=1,413 width=4) (actual time=10.748..10.751 rows=1,413 loops=1)

  • Buckets: 2048 Batches: 1 Memory Usage: 66kB
15. 5.506 5.506 ↑ 1.0 1,413 1

Seq Scan on ""LegalEntities"" l (cost=0.00..224.55 rows=1,413 width=4) (actual time=0.009..5.506 rows=1,413 loops=1)

  • Filter: ((NOT ""IsDeleted"") AND ""IsOnPortal"")
  • Rows Removed by Filter: 142
16. 10.090 80.130 ↓ 1.0 2,714 1

Hash (cost=403.09..403.09 rows=2,707 width=4) (actual time=80.127..80.130 rows=2,714 loops=1)

  • Buckets: 4096 Batches: 1 Memory Usage: 128kB
17. 20.073 70.040 ↓ 1.0 2,714 1

HashAggregate (cost=376.02..403.09 rows=2,707 width=4) (actual time=60.172..70.040 rows=2,714 loops=1)

  • Group Key: a0.""Address_Id"
18. 20.785 49.967 ↓ 1.0 2,714 1

Hash Join (cost=319.07..369.25 rows=2,707 width=4) (actual time=18.767..49.967 rows=2,714 loops=1)

  • Hash Cond: (a0.""Division_Id"" = ""a.Division0"".""Id"")
19. 10.444 10.444 ↑ 1.0 2,865 1

Seq Scan on ""DivisionAddresses"" a0 (cost=0.00..42.65 rows=2,865 width=8) (actual time=0.009..10.444 rows=2,865 loops=1)

20. 9.007 18.738 ↑ 1.0 2,420 1

Hash (cost=288.71..288.71 rows=2,429 width=4) (actual time=18.735..18.738 rows=2,420 loops=1)

  • Buckets: 4096 Batches: 1 Memory Usage: 118kB
21. 9.731 9.731 ↑ 1.0 2,420 1

Seq Scan on ""Divisions"" ""a.Division0"" (cost=0.00..288.71 rows=2,429 width=4) (actual time=0.008..9.731 rows=2,420 loops=1)

  • Filter: ""IsOnPortal"
  • Rows Removed by Filter: 151
22. 14.790 14.790 ↑ 1.0 1 2,465

Index Only Scan using ""PK_dbo.Addresses"" on ""Addresses"" ""x.Address"" (cost=0.42..1.69 rows=1 width=4) (actual time=0.006..0.006 rows=1 loops=2,465)

  • Index Cond: (""Id"" = x.""Id"")
  • Heap Fetches: 2465
Planning time : 1.110 ms
Execution time : 373.865 ms