explain.depesz.com

PostgreSQL's explain analyze made readable

Result: GYLo

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

Unique (cost=32,943,666.93..33,272,116.75 rows=14,597,770 width=1,028) (actual rows= loops=)

2. 0.000 0.000 ↓ 0.0

Sort (cost=32,943,666.93..32,980,161.35 rows=14,597,770 width=1,028) (actual rows= loops=)

  • Sort Key: fullstatem0_.id, fullstatem0_.created, fullstatem0_.external_status, fullstatem0_.external_type, gatereques2_.request_id, conclusion1_.date, conclusion1_.num, conclusion1_.result
3. 0.000 0.000 ↓ 0.0

Append (cost=3,013,504.37..4,862,171.43 rows=14,597,770 width=1,028) (actual rows= loops=)

4. 0.000 0.000 ↓ 0.0

Unique (cost=3,013,504.37..3,230,779.09 rows=9,656,654 width=98) (actual rows= loops=)

5. 0.000 0.000 ↓ 0.0

Sort (cost=3,013,504.37..3,037,646.01 rows=9,656,654 width=98) (actual rows= loops=)

  • Sort Key: fullstatem0_.id, fullstatem0_.created, fullstatem0_.external_status, fullstatem0_.external_type, gatereques2_.request_id, conclusion1_.date, conclusion1_.num, conclusion1_.result
6. 0.000 0.000 ↓ 0.0

Hash Left Join (cost=119,142.67..308,880.22 rows=9,656,654 width=98) (actual rows= loops=)

  • Hash Cond: (fullstatem0_.id = pd3_.full_statement_id)
7. 0.000 0.000 ↓ 0.0

Hash Right Join (cost=44,236.62..121,691.18 rows=1,424,046 width=98) (actual rows= loops=)

  • Hash Cond: (rii4_.full_statement_id = fullstatem0_.id)
8. 0.000 0.000 ↓ 0.0

Hash Right Join (cost=3,853.52..61,281.73 rows=712,026 width=16) (actual rows= loops=)

  • Hash Cond: (ul5_2.pd_id = rii4_.id)
9. 0.000 0.000 ↓ 0.0

Seq Scan on ul ul5_2 (cost=0.00..35,892.10 rows=1,680,010 width=16) (actual rows= loops=)

10. 0.000 0.000 ↓ 0.0

Hash (cost=1,823.01..1,823.01 rows=105,001 width=32) (actual rows= loops=)

11. 0.000 0.000 ↓ 0.0

Seq Scan on rii rii4_ (cost=0.00..1,823.01 rows=105,001 width=32) (actual rows= loops=)

12. 0.000 0.000 ↓ 0.0

Hash (cost=34,476.08..34,476.08 rows=210,001 width=98) (actual rows= loops=)

13. 0.000 0.000 ↓ 0.0

Hash Left Join (cost=17,573.55..34,476.08 rows=210,001 width=98) (actual rows= loops=)

  • Hash Cond: (fullstatem0_.id = conclusion1_.full_statement_id)
14. 0.000 0.000 ↓ 0.0

Hash Right Join (cost=9,604.02..21,032.30 rows=210,001 width=44) (actual rows= loops=)

  • Hash Cond: (gatereques2_.full_statement_id = fullstatem0_.id)
15. 0.000 0.000 ↓ 0.0

Seq Scan on gate_request gatereques2_ (cost=0.00..6,569.01 rows=210,001 width=32) (actual rows= loops=)

16. 0.000 0.000 ↓ 0.0

Hash (cost=5,543.01..5,543.01 rows=210,001 width=28) (actual rows= loops=)

17. 0.000 0.000 ↓ 0.0

Seq Scan on full_statement fullstatem0_ (cost=0.00..5,543.01 rows=210,001 width=28) (actual rows= loops=)

18. 0.000 0.000 ↓ 0.0

Hash (cost=5,426.01..5,426.01 rows=105,001 width=70) (actual rows= loops=)

19. 0.000 0.000 ↓ 0.0

Seq Scan on conclusion conclusion1_ (cost=0.00..5,426.01 rows=105,001 width=70) (actual rows= loops=)

20. 0.000 0.000 ↓ 0.0

Hash (cost=62,528.73..62,528.73 rows=712,026 width=16) (actual rows= loops=)

21. 0.000 0.000 ↓ 0.0

Hash Right Join (cost=5,100.52..62,528.73 rows=712,026 width=16) (actual rows= loops=)

  • Hash Cond: (ul5_.pd_id = pd3_.id)
22. 0.000 0.000 ↓ 0.0

Seq Scan on ul ul5_ (cost=0.00..35,892.10 rows=1,680,010 width=16) (actual rows= loops=)

23. 0.000 0.000 ↓ 0.0

Hash (cost=3,070.01..3,070.01 rows=105,001 width=32) (actual rows= loops=)

24. 0.000 0.000 ↓ 0.0

Seq Scan on pd pd3_ (cost=0.00..3,070.01 rows=105,001 width=32) (actual rows= loops=)

25. 0.000 0.000 ↓ 0.0

Unique (cost=1,301,250.68..1,412,425.79 rows=4,941,116 width=98) (actual rows= loops=)

26. 0.000 0.000 ↓ 0.0

Sort (cost=1,301,250.68..1,313,603.47 rows=4,941,116 width=98) (actual rows= loops=)

  • Sort Key: fullstatem0__1.id, fullstatem0__1.created, fullstatem0__1.external_status, fullstatem0__1.external_type, gatereques2__1.request_id, conclusion1__1.date, conclusion1__1.num, conclusion1__1.result
27. 0.000 0.000 ↓ 0.0

Hash Left Join (cost=98,203.63..211,452.39 rows=4,941,116 width=98) (actual rows= loops=)

  • Hash Cond: (fullstatem0__1.id = pd3__1.full_statement_id)
28. 0.000 0.000 ↓ 0.0

Hash Right Join (cost=44,236.62..95,362.22 rows=833,349 width=98) (actual rows= loops=)

  • Hash Cond: (rii4__1.full_statement_id = fullstatem0__1.id)
29. 0.000 0.000 ↓ 0.0

Hash Right Join (cost=3,853.52..41,897.82 rows=416,677 width=16) (actual rows= loops=)

  • Hash Cond: (ip6_2.rii_id = rii4__1.id)
30. 0.000 0.000 ↓ 0.0

Seq Scan on ip ip6_2 (cost=0.00..24,316.00 rows=1,050,000 width=16) (actual rows= loops=)

31. 0.000 0.000 ↓ 0.0

Hash (cost=1,823.01..1,823.01 rows=105,001 width=32) (actual rows= loops=)

32. 0.000 0.000 ↓ 0.0

Seq Scan on rii rii4__1 (cost=0.00..1,823.01 rows=105,001 width=32) (actual rows= loops=)

33. 0.000 0.000 ↓ 0.0

Hash (cost=34,476.08..34,476.08 rows=210,001 width=98) (actual rows= loops=)

34. 0.000 0.000 ↓ 0.0

Hash Left Join (cost=17,573.55..34,476.08 rows=210,001 width=98) (actual rows= loops=)

  • Hash Cond: (fullstatem0__1.id = conclusion1__1.full_statement_id)
35. 0.000 0.000 ↓ 0.0

Hash Right Join (cost=9,604.02..21,032.30 rows=210,001 width=44) (actual rows= loops=)

  • Hash Cond: (gatereques2__1.full_statement_id = fullstatem0__1.id)
36. 0.000 0.000 ↓ 0.0

Seq Scan on gate_request gatereques2__1 (cost=0.00..6,569.01 rows=210,001 width=32) (actual rows= loops=)

37. 0.000 0.000 ↓ 0.0

Hash (cost=5,543.01..5,543.01 rows=210,001 width=28) (actual rows= loops=)

38. 0.000 0.000 ↓ 0.0

Seq Scan on full_statement fullstatem0__1 (cost=0.00..5,543.01 rows=210,001 width=28) (actual rows= loops=)

39. 0.000 0.000 ↓ 0.0

Hash (cost=5,426.01..5,426.01 rows=105,001 width=70) (actual rows= loops=)

40. 0.000 0.000 ↓ 0.0

Seq Scan on conclusion conclusion1__1 (cost=0.00..5,426.01 rows=105,001 width=70) (actual rows= loops=)

41. 0.000 0.000 ↓ 0.0

Hash (cost=43,144.84..43,144.84 rows=622,574 width=16) (actual rows= loops=)

42. 0.000 0.000 ↓ 0.0

Hash Right Join (cost=5,100.52..43,144.84 rows=622,574 width=16) (actual rows= loops=)

  • Hash Cond: (ip6_.pd_id = pd3__1.id)
43. 0.000 0.000 ↓ 0.0

Seq Scan on ip ip6_ (cost=0.00..24,316.00 rows=1,050,000 width=16) (actual rows= loops=)

44. 0.000 0.000 ↓ 0.0

Hash (cost=3,070.01..3,070.01 rows=105,001 width=32) (actual rows= loops=)

45. 0.000 0.000 ↓ 0.0

Seq Scan on pd pd3__1 (cost=0.00..3,070.01 rows=105,001 width=32) (actual rows= loops=)