# | exclusive | inclusive | rows x | rows | loops | node |
---|---|---|---|---|---|---|
1. | 0.000 | 0.000 | ↓ 0.0 |
→
Limit (cost=637.18..637.20 rows=10 width=685) (actual rows= loops=) |
||
2. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=637.18..646.16 rows=3,595 width=685) (actual rows= loops=)
|
||
3. | 0.000 | 0.000 | ↓ 0.0 |
→
HashAggregate (cost=523.54..559.49 rows=3,595 width=685) (actual rows= loops=)
|
||
4. | 0.000 | 0.000 | ↓ 0.0 |
→
HashAggregate (cost=433.66..469.61 rows=3,595 width=685) (actual rows= loops=)
|
||
5. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Anti Join (cost=91.19..343.39 rows=6,018 width=685) (actual rows= loops=)
|
||
6. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Right Join (cost=87.77..241.41 rows=12,037 width=689) (actual rows= loops=)
|
||
7. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Right Join (cost=22.17..39.06 rows=452 width=8) (actual rows= loops=)
|
||
8. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on objet_unite_administrative oua (cost=0.00..12.90 rows=290 width=8) (actual rows= loops=) |
||
9. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=16.52..16.52 rows=452 width=8) (actual rows= loops=) |
||
10. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on question (cost=0.00..16.52 rows=452 width=8) (actual rows= loops=) |
||
11. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=56.61..56.61 rows=719 width=689) (actual rows= loops=) |
||
12. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Join (cost=10.46..56.61 rows=719 width=689) (actual rows= loops=)
|
||
13. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Join (cost=7.26..43.53 rows=719 width=693) (actual rows= loops=)
|
||
14. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on dossier (cost=0.00..20.99 rows=719 width=51) (actual rows= loops=)
|
||
15. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=7.18..7.18 rows=5 width=678) (actual rows= loops=) |
||
16. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=2.42..7.18 rows=5 width=678) (actual rows= loops=) |
||
17. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=2.42..6.08 rows=1 width=456) (actual rows= loops=) |
||
18. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=2.42..5.05 rows=1 width=234) (actual rows= loops=) |
||
19. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Join (cost=2.42..4.03 rows=1 width=12) (actual rows= loops=)
|
||
20. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on enquete_utilisateur eu (cost=0.00..1.44 rows=44 width=4) (actual rows= loops=) |
||
21. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=2.40..2.40 rows=1 width=16) (actual rows= loops=) |
||
22. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Join (cost=1.02..2.40 rows=1 width=16) (actual rows= loops=)
|
||
23. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on section (cost=0.00..1.27 rows=27 width=8) (actual rows= loops=) |
||
24. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=1.01..1.01 rows=1 width=8) (actual rows= loops=) |
||
25. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on questionnaire qst (cost=0.00..1.01 rows=1 width=8) (actual rows= loops=) |
||
26. | 0.000 | 0.000 | ↓ 0.0 | |||
27. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on composante (cost=0.00..1.01 rows=1 width=226) (actual rows= loops=)
|
||
28. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on statut_dossier sd (cost=0.00..1.05 rows=5 width=222) (actual rows= loops=) |
||
29. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=2.53..2.53 rows=53 width=4) (actual rows= loops=) |
||
30. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on utilisateur (cost=0.00..2.53 rows=53 width=4) (actual rows= loops=) |
||
31. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=3.19..3.19 rows=19 width=4) (actual rows= loops=) |
||
32. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on unite_administrative ua (cost=0.00..3.19 rows=19 width=4) (actual rows= loops=) |