| # | exclusive | inclusive | rows x | rows | loops | node |
|---|---|---|---|---|---|---|
| 1. | 0.000 | 0.000 | ↓ 0.0 |
→
Merge Left Join (cost=751.150..13660.260 rows=21216 width=3830) (actual time=.. rows= loops=)
|
||
| 2. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=584.650..589.750 rows=2039 width=3821) (actual time=.. rows= loops=)
|
||
| 3. | 0.000 | 0.000 | ↓ 0.0 |
→
Merge Left Join (cost=429.410..472.570 rows=2039 width=3821) (actual time=.. rows= loops=)
|
||
| 4. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=262.900..263.390 rows=196 width=3812) (actual time=.. rows= loops=)
|
||
| 5. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Left Join (cost=215.800..255.440 rows=196 width=3812) (actual time=.. rows= loops=)
|
||
| 6. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Left Join (cost=213.440..252.300 rows=196 width=3780) (actual time=.. rows= loops=)
|
||
| 7. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Left Join (cost=211.880..249.990 rows=196 width=3662) (actual time=.. rows= loops=)
|
||
| 8. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Left Join (cost=210.650..247.260 rows=196 width=3444) (actual time=.. rows= loops=)
|
||
| 9. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Left Join (cost=182.970..218.210 rows=196 width=3400) (actual time=.. rows= loops=)
|
||
| 10. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Left Join (cost=181.740..216.200 rows=196 width=3182) (actual time=.. rows= loops=)
|
||
| 11. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Left Join (cost=180.520..214.200 rows=196 width=2964) (actual time=.. rows= loops=)
|
||
| 12. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Left Join (cost=179.380..212.300 rows=196 width=2746) (actual time=.. rows= loops=)
|
||
| 13. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Left Join (cost=178.160..210.330 rows=196 width=2528) (actual time=.. rows= loops=)
|
||
| 14. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Left Join (cost=176.980..207.250 rows=196 width=2092) (actual time=.. rows= loops=)
|
||
| 15. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Left Join (cost=175.820..204.260 rows=196 width=1656) (actual time=.. rows= loops=)
|
||
| 16. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Left Join (cost=170.420..198.030 rows=196 width=1626) (actual time=.. rows= loops=)
|
||
| 17. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Left Join (cost=36.690..60.870 rows=196 width=1494) (actual time=.. rows= loops=)
|
||
| 18. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Left Join (cost=32.640..55.540 rows=196 width=1462) (actual time=.. rows= loops=)
|
||
| 19. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Left Join (cost=31.600..52.780 rows=196 width=1244) (actual time=.. rows= loops=)
|
||
| 20. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Left Join (cost=30.550..50.120 rows=196 width=1026) (actual time=.. rows= loops=)
|
||
| 21. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Left Join (cost=26.660..44.980 rows=196 width=994) (actual time=.. rows= loops=)
|
||
| 22. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Left Join (cost=24.840..42.270 rows=196 width=930) (actual time=.. rows= loops=)
|
||
| 23. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Left Join (cost=19.940..36.000 rows=196 width=834) (actual time=.. rows= loops=)
|
||
| 24. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Left Join (cost=17.540..32.730 rows=196 width=802) (actual time=.. rows= loops=)
|
||
| 25. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Left Join (cost=9.050..21.540 rows=196 width=770) (actual time=.. rows= loops=)
|
||
| 26. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Left Join (cost=2.240..12.030 rows=196 width=732) (actual time=.. rows= loops=)
|
||
| 27. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on whiskey_bravo quebec_three (cost=0.000..8.960 rows=196 width=700) (actual time=.. rows= loops=) |
||
| 28. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=2.110..2.110 rows=10 width=36) (actual time=.. rows= loops=) |
||
| 29. | 0.000 | 0.000 | ↓ 0.0 |
→
Subquery Scan r1124 (cost=1.890..2.110 rows=10 width=36) (actual time=.. rows= loops=) |
||
| 30. | 0.000 | 0.000 | ↓ 0.0 |
→
HashAggregate (cost=1.890..2.010 rows=10 width=9) (actual time=.. rows= loops=) |
||
| 31. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on papa (cost=0.000..1.840 rows=10 width=9) (actual time=.. rows= loops=)
|
||
| 32. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=4.140..4.140 rows=214 width=42) (actual time=.. rows= loops=) |
||
| 33. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on yankee_victor xray_golf (cost=0.000..4.140 rows=214 width=42) (actual time=.. rows= loops=) |
||
| 34. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=5.440..5.440 rows=244 width=36) (actual time=.. rows= loops=) |
||
| 35. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on sierra six_echo (cost=0.000..5.440 rows=244 width=36) (actual time=.. rows= loops=) |
||
| 36. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=2.220..2.220 rows=14 width=36) (actual time=.. rows= loops=) |
||
| 37. | 0.000 | 0.000 | ↓ 0.0 |
→
Subquery Scan rn1121 (cost=1.910..2.220 rows=14 width=36) (actual time=.. rows= loops=) |
||
| 38. | 0.000 | 0.000 | ↓ 0.0 |
→
HashAggregate (cost=1.910..2.080 rows=14 width=9) (actual time=.. rows= loops=) |
||
| 39. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on papa (cost=0.000..1.840 rows=14 width=9) (actual time=.. rows= loops=)
|
||
| 40. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=4.100..4.100 rows=64 width=100) (actual time=.. rows= loops=) |
||
| 41. | 0.000 | 0.000 | ↓ 0.0 |
→
Subquery Scan rsct (cost=2.340..4.100 rows=64 width=100) (actual time=.. rows= loops=) |
||
| 42. | 0.000 | 0.000 | ↓ 0.0 |
→
HashAggregate (cost=2.340..3.460 rows=64 width=19) (actual time=.. rows= loops=) |
||
| 43. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on papa (cost=0.000..1.670 rows=67 width=19) (actual time=.. rows= loops=) |
||
| 44. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=1.640..1.640 rows=15 width=68) (actual time=.. rows= loops=) |
||
| 45. | 0.000 | 0.000 | ↓ 0.0 |
→
Subquery Scan rpct (cost=1.260..1.640 rows=15 width=68) (actual time=.. rows= loops=) |
||
| 46. | 0.000 | 0.000 | ↓ 0.0 |
→
HashAggregate (cost=1.260..1.490 rows=15 width=68) (actual time=.. rows= loops=) |
||
| 47. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on victor_seven (cost=0.000..1.150 rows=15 width=68) (actual time=.. rows= loops=) |
||
| 48. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=3.250..3.250 rows=51 width=36) (actual time=.. rows= loops=) |
||
| 49. | 0.000 | 0.000 | ↓ 0.0 |
→
Subquery Scan r1121 (cost=2.100..3.250 rows=51 width=36) (actual time=.. rows= loops=) |
||
| 50. | 0.000 | 0.000 | ↓ 0.0 |
→
HashAggregate (cost=2.100..2.740 rows=51 width=9) (actual time=.. rows= loops=) |
||
| 51. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on papa (cost=0.000..1.840 rows=53 width=9) (actual time=.. rows= loops=)
|
||
| 52. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=1.020..1.020 rows=2 width=222) (actual time=.. rows= loops=) |
||
| 53. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on echo_foxtrot quebec_zulu (cost=0.000..1.020 rows=2 width=222) (actual time=.. rows= loops=) |
||
| 54. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=1.020..1.020 rows=2 width=222) (actual time=.. rows= loops=) |
||
| 55. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on yankee_alpha_alpha victor_tango (cost=0.000..1.020 rows=2 width=222) (actual time=.. rows= loops=) |
||
| 56. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=3.360..3.360 rows=55 width=36) (actual time=.. rows= loops=) |
||
| 57. | 0.000 | 0.000 | ↓ 0.0 |
→
Subquery Scan rn1124 (cost=2.120..3.360 rows=55 width=36) (actual time=.. rows= loops=) |
||
| 58. | 0.000 | 0.000 | ↓ 0.0 |
→
HashAggregate (cost=2.120..2.810 rows=55 width=9) (actual time=.. rows= loops=) |
||
| 59. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on papa (cost=0.000..1.840 rows=57 width=9) (actual time=.. rows= loops=)
|
||
| 60. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=112.770..112.770 rows=1677 width=140) (actual time=.. rows= loops=) |
||
| 61. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on golf_yankee four (cost=0.000..112.770 rows=1677 width=140) (actual time=.. rows= loops=) |
||
| 62. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=3.510..3.510 rows=151 width=34) (actual time=.. rows= loops=) |
||
| 63. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on seven_juliet xray_hotel (cost=0.000..3.510 rows=151 width=34) (actual time=.. rows= loops=) |
||
| 64. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=1.070..1.070 rows=7 width=440) (actual time=.. rows= loops=) |
||
| 65. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on romeo_yankee mike_quebec (cost=0.000..1.070 rows=7 width=440) (actual time=.. rows= loops=) |
||
| 66. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=1.080..1.080 rows=8 width=440) (actual time=.. rows= loops=) |
||
| 67. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on seven_xray quebec_india (cost=0.000..1.080 rows=8 width=440) (actual time=.. rows= loops=) |
||
| 68. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=1.100..1.100 rows=10 width=222) (actual time=.. rows= loops=) |
||
| 69. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on six_three november_alpha (cost=0.000..1.100 rows=10 width=222) (actual time=.. rows= loops=) |
||
| 70. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=1.060..1.060 rows=6 width=222) (actual time=.. rows= loops=) |
||
| 71. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on zulu_hotel charlie_golf (cost=0.000..1.060 rows=6 width=222) (actual time=.. rows= loops=) |
||
| 72. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=1.100..1.100 rows=10 width=222) (actual time=.. rows= loops=) |
||
| 73. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on zulu_golf november_uniform (cost=0.000..1.100 rows=10 width=222) (actual time=.. rows= loops=) |
||
| 74. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=1.100..1.100 rows=10 width=222) (actual time=.. rows= loops=) |
||
| 75. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on zulu_golf three_november (cost=0.000..1.100 rows=10 width=222) (actual time=.. rows= loops=) |
||
| 76. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=17.860..17.860 rows=786 width=48) (actual time=.. rows= loops=) |
||
| 77. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on mike_xray seven_echo (cost=0.000..17.860 rows=786 width=48) (actual time=.. rows= loops=) |
||
| 78. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=1.100..1.100 rows=10 width=222) (actual time=.. rows= loops=) |
||
| 79. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on zulu_golf lima_seven_delta (cost=0.000..1.100 rows=10 width=222) (actual time=.. rows= loops=) |
||
| 80. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=1.250..1.250 rows=25 width=122) (actual time=.. rows= loops=) |
||
| 81. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on three_yankee golf_papa (cost=0.000..1.250 rows=25 width=122) (actual time=.. rows= loops=) |
||
| 82. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=2.310..2.310 rows=4 width=36) (actual time=.. rows= loops=) |
||
| 83. | 0.000 | 0.000 | ↓ 0.0 |
→
Subquery Scan fish_passage_accomps (cost=2.230..2.310 rows=4 width=36) (actual time=.. rows= loops=) |
||
| 84. | 0.000 | 0.000 | ↓ 0.0 |
→
HashAggregate (cost=2.230..2.270 rows=4 width=4) (actual time=.. rows= loops=) |
||
| 85. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on two_zulu (cost=0.000..2.210 rows=5 width=4) (actual time=.. rows= loops=)
|
||
| 86. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=166.500..171.710 rows=2081 width=17) (actual time=.. rows= loops=)
|
||
| 87. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on two_oscar xray_november (cost=0.000..51.810 rows=2081 width=17) (actual time=.. rows= loops=) |
||
| 88. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=166.500..171.710 rows=2081 width=17) (actual time=.. rows= loops=)
|
||
| 89. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on two_oscar quebec_sierra (cost=0.000..51.810 rows=2081 width=17) (actual time=.. rows= loops=) |