| # | exclusive | inclusive | rows x | rows | loops | node |
|---|---|---|---|---|---|---|
| 1. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=6745.12..6745.13 rows=1 width=102) (actual time=.. rows= loops=)
|
||
| 2. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=177.32..6745.11 rows=1 width=102) (actual time=.. rows= loops=) |
||
| 3. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=177.32..6744.27 rows=1 width=106) (actual time=.. rows= loops=)
|
||
| 4. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=0.00..18.56 rows=1 width=12) (actual time=.. rows= loops=) |
||
| 5. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=0.00..11.29 rows=4 width=4) (actual time=.. rows= loops=)
|
||
| 6. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on "desc" d2 (cost=0.00..1.07 rows=1 width=4) (actual time=.. rows= loops=)
|
||
| 7. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on desc_class dc2 (cost=0.00..9.94 rows=22 width=8) (actual time=.. rows= loops=)
|
||
| 8. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using desc_class_idx on desc_class dc1 (cost=0.00..1.80 rows=1 width=8) (actual time=.. rows= loops=)
|
||
| 9. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=177.32..6725.70 rows=1 width=114) (actual time=.. rows= loops=) |
||
| 10. | 0.000 | 0.000 | ↓ 0.0 |
→
Merge Join (cost=177.32..6725.42 rows=1 width=70) (actual time=.. rows= loops=)
|
||
| 11. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=0.00..29840546.83 rows=4558 width=65) (actual time=.. rows= loops=) |
||
| 12. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=0.00..29836577.65 rows=42 width=53) (actual time=.. rows= loops=) |
||
| 13. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=0.00..29836565.71 rows=42 width=28) (actual time=.. rows= loops=) |
||
| 14. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using type_index_idx on type_index ti1 (cost=0.00..232.92 rows=2821 width=16) (actual time=.. rows= loops=) |
||
| 15. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using values_index_unique_index on values_index vi1 (cost=0.00..10576.50 rows=1 width=20) (actual time=.. rows= loops=)
|
||
| 16. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using class_pkey on class (cost=0.00..0.27 rows=1 width=25) (actual time=.. rows= loops=)
|
||
| 17. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using values_index_unique_index on values_index vi2 (cost=0.00..94.43 rows=5 width=20) (actual time=.. rows= loops=)
|
||
| 18. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=176.23..176.78 rows=217 width=25) (actual time=.. rows= loops=)
|
||
| 19. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=1.18..167.81 rows=217 width=25) (actual time=.. rows= loops=) |
||
| 20. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Join (cost=1.18..66.13 rows=217 width=12) (actual time=.. rows= loops=)
|
||
| 21. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on type_index ti2 (cost=0.00..52.21 rows=2821 width=16) (actual time=.. rows= loops=) |
||
| 22. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=1.16..1.16 rows=1 width=4) (actual time=.. rows= loops=) |
||
| 23. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on source s2 (cost=0.00..1.16 rows=1 width=4) (actual time=.. rows= loops=)
|
||
| 24. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using geo_pkey on geo (cost=0.00..0.46 rows=1 width=13) (actual time=.. rows= loops=)
|
||
| 25. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using source_pkey on source s1 (cost=0.00..0.27 rows=1 width=52) (actual time=.. rows= loops=)
|
||
| 26. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using desc_pkey on "desc" d1 (cost=0.00..0.82 rows=1 width=4) (actual time=.. rows= loops=)
|