explain.depesz.com

PostgreSQL's explain analyze made readable

Result: Ljxm

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

Limit (cost=1,757,935.34..1,757,935.41 rows=10 width=12) (actual rows= loops=)

2. 0.000 0.000 ↓ 0.0

Unique (cost=1,757,935.34..1,771,386.45 rows=1,793,481 width=12) (actual rows= loops=)

3. 0.000 0.000 ↓ 0.0

Sort (cost=1,757,935.34..1,762,419.04 rows=1,793,481 width=12) (actual rows= loops=)

  • Sort Key: (min(dctrn_result.sclr_25)), dctrn_result.idinterne_2
4. 0.000 0.000 ↓ 0.0

GroupAggregate (cost=1,478,951.58..1,510,337.50 rows=1,793,481 width=12) (actual rows= loops=)

  • Group Key: dctrn_result.idinterne_2
5. 0.000 0.000 ↓ 0.0

Sort (cost=1,478,951.58..1,483,435.28 rows=1,793,481 width=12) (actual rows= loops=)

  • Sort Key: dctrn_result.idinterne_2
6. 0.000 0.000 ↓ 0.0

Subquery Scan on dctrn_result (cost=1,159,614.50..1,231,353.74 rows=1,793,481 width=12) (actual rows= loops=)

7. 0.000 0.000 ↓ 0.0

WindowAgg (cost=1,159,614.50..1,213,418.93 rows=1,793,481 width=951) (actual rows= loops=)

8. 0.000 0.000 ↓ 0.0

Sort (cost=1,159,614.50..1,164,098.20 rows=1,793,481 width=33) (actual rows= loops=)

  • Sort Key: d4_.datecreation, p0_.nom, p0_.prenom, c3_.codepostal, a2_.libelle, l1_.idinterne
9. 0.000 0.000 ↓ 0.0

Gather (cost=576,465.48..875,238.66 rows=1,793,481 width=33) (actual rows= loops=)

  • Workers Planned: 2
10. 0.000 0.000 ↓ 0.0

Parallel Hash Semi Join (cost=575,465.48..694,890.56 rows=747,284 width=33) (actual rows= loops=)

  • Hash Cond: (l1_.idinterne = l6_.idinterne)
11. 0.000 0.000 ↓ 0.0

Parallel Hash Left Join (cost=314,026.03..407,498.50 rows=806,508 width=33) (actual rows= loops=)

  • Hash Cond: (d5_.idparticulier = p0_.idinterne)
12. 0.000 0.000 ↓ 0.0

Hash Left Join (cost=264,493.15..342,236.54 rows=806,508 width=23) (actual rows= loops=)

  • Hash Cond: (l1_.idinterne = d5_.idlogement)
13. 0.000 0.000 ↓ 0.0

Hash Left Join (cost=68,662.44..117,355.52 rows=781,042 width=15) (actual rows= loops=)

  • Hash Cond: (a2_.idccp = c3_.id)
14. 0.000 0.000 ↓ 0.0

Parallel Hash Left Join (cost=67,282.02..113,924.67 rows=781,042 width=13) (actual rows= loops=)

  • Hash Cond: (l1_.idadresse = a2_.id)
15. 0.000 0.000 ↓ 0.0

Parallel Seq Scan on logement l1_ (cost=0.00..30,930.42 rows=781,042 width=8) (actual rows= loops=)

16. 0.000 0.000 ↓ 0.0

Parallel Hash (cost=40,370.90..40,370.90 rows=1,548,090 width=13) (actual rows= loops=)

17. 0.000 0.000 ↓ 0.0

Parallel Seq Scan on adresse a2_ (cost=0.00..40,370.90 rows=1,548,090 width=13) (actual rows= loops=)

18. 0.000 0.000 ↓ 0.0

Hash (cost=925.74..925.74 rows=36,374 width=10) (actual rows= loops=)

19. 0.000 0.000 ↓ 0.0

Seq Scan on communecp c3_ (cost=0.00..925.74 rows=36,374 width=10) (actual rows= loops=)

20. 0.000 0.000 ↓ 0.0

Hash (cost=162,183.46..162,183.46 rows=1,935,620 width=12) (actual rows= loops=)

21. 0.000 0.000 ↓ 0.0

Hash Right Join (cost=78,108.25..162,183.46 rows=1,935,620 width=12) (actual rows= loops=)

  • Hash Cond: (d4_.iddossier = d5_.idinterne)
22. 0.000 0.000 ↓ 0.0

Seq Scan on demande d4_ (cost=0.00..54,717.20 rows=1,935,620 width=8) (actual rows= loops=)

23. 0.000 0.000 ↓ 0.0

Hash (cost=45,524.00..45,524.00 rows=1,874,500 width=12) (actual rows= loops=)

24. 0.000 0.000 ↓ 0.0

Seq Scan on dossier d5_ (cost=0.00..45,524.00 rows=1,874,500 width=12) (actual rows= loops=)

25. 0.000 0.000 ↓ 0.0

Parallel Hash (cost=36,500.17..36,500.17 rows=709,817 width=18) (actual rows= loops=)

26. 0.000 0.000 ↓ 0.0

Parallel Seq Scan on particulier p0_ (cost=0.00..36,500.17 rows=709,817 width=18) (actual rows= loops=)

27. 0.000 0.000 ↓ 0.0

Parallel Hash (cost=249,178.41..249,178.41 rows=747,284 width=4) (actual rows= loops=)

28. 0.000 0.000 ↓ 0.0

Hash Left Join (cost=193,940.71..249,178.41 rows=747,284 width=4) (actual rows= loops=)

  • Hash Cond: (l6_.idinterne = d7_.idlogement)
29. 0.000 0.000 ↓ 0.0

Parallel Seq Scan on logement l6_ (cost=0.00..30,930.42 rows=723,687 width=8) (actual rows= loops=)

  • Filter: (idcopropriete IS NULL)
30. 0.000 0.000 ↓ 0.0

Hash (cost=162,183.46..162,183.46 rows=1,935,620 width=4) (actual rows= loops=)

31. 0.000 0.000 ↓ 0.0

Hash Right Join (cost=78,108.25..162,183.46 rows=1,935,620 width=4) (actual rows= loops=)

  • Hash Cond: (d8_.iddossier = d7_.idinterne)
32. 0.000 0.000 ↓ 0.0

Seq Scan on demande d8_ (cost=0.00..54,717.20 rows=1,935,620 width=4) (actual rows= loops=)

33. 0.000 0.000 ↓ 0.0

Hash (cost=45,524.00..45,524.00 rows=1,874,500 width=12) (actual rows= loops=)

34. 0.000 0.000 ↓ 0.0

Seq Scan on dossier d7_ (cost=0.00..45,524.00 rows=1,874,500 width=12) (actual rows= loops=)