| # | exclusive | inclusive | rows x | rows | loops | node |
|---|---|---|---|---|---|---|
| 1. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=80171687.68..80171734.13 rows=1 width=1180) (actual time=.. rows= loops=) |
||
| 2. |
Initplan (forNested Loop) |
|||||
| 3. | 0.000 | 0.000 | ↓ 0.0 |
→
Aggregate (cost=40084042.32..40084042.33 rows=1 width=8) (actual time=.. rows= loops=) |
||
| 4. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=40083995.86..40084042.32 rows=1 width=8) (actual time=.. rows= loops=) |
||
| 5. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Join (cost=40083986.36..40084032.79 rows=1 width=528) (actual time=.. rows= loops=)
|
||
| 6. | 0.000 | 0.000 | ↓ 0.0 |
→
HashAggregate (cost=61.06..107.38 rows=7 width=126) (actual time=.. rows= loops=) |
||
| 7. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=0.00..60.92 rows=7 width=126) (actual time=.. rows= loops=) |
||
| 8. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using pricing_program_enrollment_account_id_index on pricing_program_enrollment ppe (cost=0.00..8.27 rows=1 width=24) (actual time=.. rows= loops=)
|
||
| 9. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on schedule s (cost=0.00..6.33 rows=7 width=106) (actual time=.. rows= loops=)
|
||
| 10. |
SubPlan (forNested Loop) |
|||||
| 11. | 0.000 | 0.000 | ↓ 0.0 |
→
Aggregate (cost=6.60..6.61 rows=1 width=8) (actual time=.. rows= loops=) |
||
| 12. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on schedule (cost=0.00..6.59 rows=2 width=8) (actual time=.. rows= loops=)
|
||
| 13. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=40083925.28..40083925.28 rows=1 width=532) (actual time=.. rows= loops=) |
||
| 14. | 0.000 | 0.000 | ↓ 0.0 |
→
Merge Join (cost=40083925.23..40083925.28 rows=1 width=532) (actual time=.. rows= loops=)
|
||
| 15. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=4109240.44..4109240.45 rows=4 width=1044) (actual time=.. rows= loops=)
|
||
| 16. | 0.000 | 0.000 | ↓ 0.0 |
→
Subquery Scan eprs (cost=4109240.32..4109240.40 rows=4 width=1044) (actual time=.. rows= loops=) |
||
| 17. | 0.000 | 0.000 | ↓ 0.0 |
→
HashAggregate (cost=4109240.32..4109240.36 rows=4 width=554) (actual time=.. rows= loops=) |
||
| 18. | 0.000 | 0.000 | ↓ 0.0 |
→
Append (cost=2054620.09..4109240.22 rows=4 width=554) (actual time=.. rows= loops=) |
||
| 19. | 0.000 | 0.000 | ↓ 0.0 |
→
Result (cost=2054620.09..2054620.14 rows=2 width=290) (actual time=.. rows= loops=) |
||
| 20. | 0.000 | 0.000 | ↓ 0.0 |
→
Unique (cost=2054620.09..2054620.14 rows=2 width=290) (actual time=.. rows= loops=) |
||
| 21. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=2054620.09..2054620.09 rows=2 width=290) (actual time=.. rows= loops=)
|
||
| 22. | 0.000 | 0.000 | ↓ 0.0 |
→
Append (cost=1027302.93..2054620.08 rows=2 width=290) (actual time=.. rows= loops=) |
||
| 23. | 0.000 | 0.000 | ↓ 0.0 |
→
Subquery Scan "*SELECT* 1" (cost=1027302.93..1027302.95 rows=1 width=538) (actual time=.. rows= loops=) |
||
| 24. | 0.000 | 0.000 | ↓ 0.0 |
→
HashAggregate (cost=1027302.93..1027302.94 rows=1 width=538) (actual time=.. rows= loops=) |
||
| 25. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=1027294.25..1027302.91 rows=1 width=538) (actual time=.. rows= loops=) |
||
| 26. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=1027294.25..1027302.57 rows=1 width=538) (actual time=.. rows= loops=) |
||
| 27. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=1027294.25..1027294.26 rows=1 width=548) (actual time=.. rows= loops=)
|
||
| 28. | 0.000 | 0.000 | ↓ 0.0 |
→
Merge Join (cost=1019825.99..1027294.24 rows=1 width=548) (actual time=.. rows= loops=)
|
||
| 29. | 0.000 | 0.000 | ↓ 0.0 |
→
GroupAggregate (cost=31678.68..36348.18 rows=186576 width=41) (actual time=.. rows= loops=) |
||
| 30. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=31678.68..32146.14 rows=186984 width=41) (actual time=.. rows= loops=)
|
||
| 31. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on schedule_rates (cost=0.00..3797.84 rows=186984 width=41) (actual time=.. rows= loops=) |
||
| 32. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=988147.31..988147.31 rows=1 width=548) (actual time=.. rows= loops=)
|
||
| 33. | 0.000 | 0.000 | ↓ 0.0 |
→
HashAggregate (cost=988147.28..988147.29 rows=1 width=53) (actual time=.. rows= loops=) |
||
| 34. | 0.000 | 0.000 | ↓ 0.0 |
→
Merge Join (cost=983096.85..988143.04 rows=242 width=53) (actual time=.. rows= loops=)
|
||
| 35. | 0.000 | 0.000 | ↓ 0.0 |
→
Unique (cost=983061.83..986296.56 rows=143766 width=126) (actual time=.. rows= loops=) |
||
| 36. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=983061.83..983421.24 rows=143766 width=126) (actual time=.. rows= loops=)
|
||
| 37. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Join (cost=7.39..952069.85 rows=143766 width=126) (actual time=.. rows= loops=)
|
||
| 38. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on pricing_program_enrollment ppe (cost=0.00..459.63 rows=20563 width=24) (actual time=.. rows= loops=) |
||
| 39. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=6.06..6.06 rows=106 width=106) (actual time=.. rows= loops=) |
||
| 40. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on schedule s (cost=0.00..6.06 rows=106 width=106) (actual time=.. rows= loops=) |
||
| 41. |
SubPlan (forHash Join) |
|||||
| 42. | 0.000 | 0.000 | ↓ 0.0 |
→
Aggregate (cost=6.60..6.61 rows=1 width=8) (actual time=.. rows= loops=) |
||
| 43. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on schedule (cost=0.00..6.59 rows=2 width=8) (actual time=.. rows= loops=)
|
||
| 44. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=35.03..35.03 rows=1 width=53) (actual time=.. rows= loops=)
|
||
| 45. | 0.000 | 0.000 | ↓ 0.0 |
→
Bitmap Heap Scan on schedule_rates sr3 (cost=31.00..35.02 rows=1 width=53) (actual time=.. rows= loops=)
|
||
| 46. | 0.000 | 0.000 | ↓ 0.0 |
→
BitmapAnd (cost=31.00..31.00 rows=1 width=0) (actual time=.. rows= loops=) |
||
| 47. | 0.000 | 0.000 | ↓ 0.0 |
→
Bitmap Index Scan on schedule_rates_account_id_index (cost=0.00..4.39 rows=14 width=0) (actual time=.. rows= loops=)
|
||
| 48. | 0.000 | 0.000 | ↓ 0.0 |
→
Bitmap Index Scan on schedule_rates_effective_date_index (cost=0.00..26.36 rows=1345 width=0) (actual time=.. rows= loops=)
|
||
| 49. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using rate_schedule_rates_id_index on rate r (cost=0.00..8.29 rows=1 width=10) (actual time=.. rows= loops=)
|
||
| 50. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using price_tier_rate_id_index on price_tier p (cost=0.00..0.33 rows=1 width=4) (actual time=.. rows= loops=)
|
||
| 51. | 0.000 | 0.000 | ↓ 0.0 |
→
Subquery Scan "*SELECT* 2" (cost=1027317.10..1027317.12 rows=1 width=42) (actual time=.. rows= loops=) |
||
| 52. | 0.000 | 0.000 | ↓ 0.0 |
→
HashAggregate (cost=1027317.10..1027317.11 rows=1 width=42) (actual time=.. rows= loops=) |
||
| 53. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=1027294.75..1027317.08 rows=1 width=42) (actual time=.. rows= loops=) |
||
| 54. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=1027294.75..1027316.74 rows=1 width=42) (actual time=.. rows= loops=) |
||
| 55. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=1027294.75..1027308.44 rows=1 width=36) (actual time=.. rows= loops=)
|
||
| 56. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=1027294.75..1027302.15 rows=1 width=20) (actual time=.. rows= loops=)
|
||
| 57. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=1027294.75..1027294.76 rows=1 width=548) (actual time=.. rows= loops=)
|
||
| 58. | 0.000 | 0.000 | ↓ 0.0 |
→
Merge Join (cost=1019826.49..1027294.74 rows=1 width=548) (actual time=.. rows= loops=)
|
||
| 59. | 0.000 | 0.000 | ↓ 0.0 |
→
GroupAggregate (cost=31678.68..36348.18 rows=186576 width=41) (actual time=.. rows= loops=) |
||
| 60. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=31678.68..32146.14 rows=186984 width=41) (actual time=.. rows= loops=)
|
||
| 61. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on schedule_rates (cost=0.00..3797.84 rows=186984 width=41) (actual time=.. rows= loops=) |
||
| 62. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=988147.81..988147.81 rows=1 width=548) (actual time=.. rows= loops=)
|
||
| 63. | 0.000 | 0.000 | ↓ 0.0 |
→
HashAggregate (cost=988147.78..988147.79 rows=1 width=53) (actual time=.. rows= loops=) |
||
| 64. | 0.000 | 0.000 | ↓ 0.0 |
→
Merge Join (cost=983097.35..988143.54 rows=242 width=53) (actual time=.. rows= loops=)
|
||
| 65. | 0.000 | 0.000 | ↓ 0.0 |
→
Unique (cost=983061.83..986296.56 rows=143766 width=126) (actual time=.. rows= loops=) |
||
| 66. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=983061.83..983421.24 rows=143766 width=126) (actual time=.. rows= loops=)
|
||
| 67. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Join (cost=7.39..952069.85 rows=143766 width=126) (actual time=.. rows= loops=)
|
||
| 68. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on pricing_program_enrollment ppe (cost=0.00..459.63 rows=20563 width=24) (actual time=.. rows= loops=) |
||
| 69. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=6.06..6.06 rows=106 width=106) (actual time=.. rows= loops=) |
||
| 70. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on schedule s (cost=0.00..6.06 rows=106 width=106) (actual time=.. rows= loops=) |
||
| 71. |
SubPlan (forHash Join) |
|||||
| 72. | 0.000 | 0.000 | ↓ 0.0 |
→
Aggregate (cost=6.60..6.61 rows=1 width=8) (actual time=.. rows= loops=) |
||
| 73. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on schedule (cost=0.00..6.59 rows=2 width=8) (actual time=.. rows= loops=)
|
||
| 74. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=35.53..35.53 rows=1 width=53) (actual time=.. rows= loops=)
|
||
| 75. | 0.000 | 0.000 | ↓ 0.0 |
→
Bitmap Heap Scan on schedule_rates sr3 (cost=31.50..35.52 rows=1 width=53) (actual time=.. rows= loops=)
|
||
| 76. | 0.000 | 0.000 | ↓ 0.0 |
→
BitmapAnd (cost=31.50..31.50 rows=1 width=0) (actual time=.. rows= loops=) |
||
| 77. | 0.000 | 0.000 | ↓ 0.0 |
→
Bitmap Index Scan on schedule_rates_account_id_index (cost=0.00..4.89 rows=81 width=0) (actual time=.. rows= loops=)
|
||
| 78. | 0.000 | 0.000 | ↓ 0.0 |
→
Bitmap Index Scan on schedule_rates_effective_date_index (cost=0.00..26.36 rows=1345 width=0) (actual time=.. rows= loops=)
|
||
| 79. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on schedule s (cost=0.00..6.06 rows=106 width=8) (actual time=.. rows= loops=) |
||
| 80. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using pricing_program_enrollment_account_id_index on pricing_program_enrollment ppe (cost=0.00..6.27 rows=1 width=24) (actual time=.. rows= loops=)
|
||
| 81. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using rate_schedule_rates_id_index on rate r (cost=0.00..8.29 rows=1 width=10) (actual time=.. rows= loops=)
|
||
| 82. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using price_tier_rate_id_index on price_tier p (cost=0.00..0.33 rows=1 width=4) (actual time=.. rows= loops=)
|
||
| 83. | 0.000 | 0.000 | ↓ 0.0 |
→
Subquery Scan "*SELECT* 3" (cost=1027302.93..1027302.95 rows=1 width=1066) (actual time=.. rows= loops=) |
||
| 84. | 0.000 | 0.000 | ↓ 0.0 |
→
HashAggregate (cost=1027302.93..1027302.94 rows=1 width=1066) (actual time=.. rows= loops=) |
||
| 85. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=1027294.25..1027302.91 rows=1 width=1066) (actual time=.. rows= loops=) |
||
| 86. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=1027294.25..1027302.57 rows=1 width=538) (actual time=.. rows= loops=) |
||
| 87. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=1027294.25..1027294.26 rows=1 width=548) (actual time=.. rows= loops=)
|
||
| 88. | 0.000 | 0.000 | ↓ 0.0 |
→
Merge Join (cost=1019825.99..1027294.24 rows=1 width=548) (actual time=.. rows= loops=)
|
||
| 89. | 0.000 | 0.000 | ↓ 0.0 |
→
GroupAggregate (cost=31678.68..36348.18 rows=186576 width=41) (actual time=.. rows= loops=) |
||
| 90. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=31678.68..32146.14 rows=186984 width=41) (actual time=.. rows= loops=)
|
||
| 91. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on schedule_rates (cost=0.00..3797.84 rows=186984 width=41) (actual time=.. rows= loops=) |
||
| 92. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=988147.31..988147.31 rows=1 width=548) (actual time=.. rows= loops=)
|
||
| 93. | 0.000 | 0.000 | ↓ 0.0 |
→
HashAggregate (cost=988147.28..988147.29 rows=1 width=53) (actual time=.. rows= loops=) |
||
| 94. | 0.000 | 0.000 | ↓ 0.0 |
→
Merge Join (cost=983096.85..988143.04 rows=242 width=53) (actual time=.. rows= loops=)
|
||
| 95. | 0.000 | 0.000 | ↓ 0.0 |
→
Unique (cost=983061.83..986296.56 rows=143766 width=126) (actual time=.. rows= loops=) |
||
| 96. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=983061.83..983421.24 rows=143766 width=126) (actual time=.. rows= loops=)
|
||
| 97. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Join (cost=7.39..952069.85 rows=143766 width=126) (actual time=.. rows= loops=)
|
||
| 98. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on pricing_program_enrollment ppe (cost=0.00..459.63 rows=20563 width=24) (actual time=.. rows= loops=) |
||
| 99. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=6.06..6.06 rows=106 width=106) (actual time=.. rows= loops=) |
||
| 100. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on schedule s (cost=0.00..6.06 rows=106 width=106) (actual time=.. rows= loops=) |
||
| 101. |
SubPlan (forHash Join) |
|||||
| 102. | 0.000 | 0.000 | ↓ 0.0 |
→
Aggregate (cost=6.60..6.61 rows=1 width=8) (actual time=.. rows= loops=) |
||
| 103. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on schedule (cost=0.00..6.59 rows=2 width=8) (actual time=.. rows= loops=)
|
||
| 104. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=35.03..35.03 rows=1 width=53) (actual time=.. rows= loops=)
|
||
| 105. | 0.000 | 0.000 | ↓ 0.0 |
→
Bitmap Heap Scan on schedule_rates sr3 (cost=31.00..35.02 rows=1 width=53) (actual time=.. rows= loops=)
|
||
| 106. | 0.000 | 0.000 | ↓ 0.0 |
→
BitmapAnd (cost=31.00..31.00 rows=1 width=0) (actual time=.. rows= loops=) |
||
| 107. | 0.000 | 0.000 | ↓ 0.0 |
→
Bitmap Index Scan on schedule_rates_account_id_index (cost=0.00..4.39 rows=14 width=0) (actual time=.. rows= loops=)
|
||
| 108. | 0.000 | 0.000 | ↓ 0.0 |
→
Bitmap Index Scan on schedule_rates_effective_date_index (cost=0.00..26.36 rows=1345 width=0) (actual time=.. rows= loops=)
|
||
| 109. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using rate_schedule_rates_id_index on rate r (cost=0.00..8.29 rows=1 width=10) (actual time=.. rows= loops=)
|
||
| 110. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using price_tier_rate_id_index on price_tier p (cost=0.00..0.33 rows=1 width=532) (actual time=.. rows= loops=)
|
||
| 111. | 0.000 | 0.000 | ↓ 0.0 |
→
Subquery Scan "*SELECT* 4" (cost=1027317.10..1027317.12 rows=1 width=570) (actual time=.. rows= loops=) |
||
| 112. | 0.000 | 0.000 | ↓ 0.0 |
→
HashAggregate (cost=1027317.10..1027317.11 rows=1 width=570) (actual time=.. rows= loops=) |
||
| 113. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=1027294.75..1027317.08 rows=1 width=570) (actual time=.. rows= loops=) |
||
| 114. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=1027294.75..1027316.74 rows=1 width=42) (actual time=.. rows= loops=) |
||
| 115. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=1027294.75..1027308.44 rows=1 width=36) (actual time=.. rows= loops=)
|
||
| 116. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=1027294.75..1027302.15 rows=1 width=20) (actual time=.. rows= loops=)
|
||
| 117. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=1027294.75..1027294.76 rows=1 width=548) (actual time=.. rows= loops=)
|
||
| 118. | 0.000 | 0.000 | ↓ 0.0 |
→
Merge Join (cost=1019826.49..1027294.74 rows=1 width=548) (actual time=.. rows= loops=)
|
||
| 119. | 0.000 | 0.000 | ↓ 0.0 |
→
GroupAggregate (cost=31678.68..36348.18 rows=186576 width=41) (actual time=.. rows= loops=) |
||
| 120. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=31678.68..32146.14 rows=186984 width=41) (actual time=.. rows= loops=)
|
||
| 121. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on schedule_rates (cost=0.00..3797.84 rows=186984 width=41) (actual time=.. rows= loops=) |
||
| 122. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=988147.81..988147.81 rows=1 width=548) (actual time=.. rows= loops=)
|
||
| 123. | 0.000 | 0.000 | ↓ 0.0 |
→
HashAggregate (cost=988147.78..988147.79 rows=1 width=53) (actual time=.. rows= loops=) |
||
| 124. | 0.000 | 0.000 | ↓ 0.0 |
→
Merge Join (cost=983097.35..988143.54 rows=242 width=53) (actual time=.. rows= loops=)
|
||
| 125. | 0.000 | 0.000 | ↓ 0.0 |
→
Unique (cost=983061.83..986296.56 rows=143766 width=126) (actual time=.. rows= loops=) |
||
| 126. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=983061.83..983421.24 rows=143766 width=126) (actual time=.. rows= loops=)
|
||
| 127. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Join (cost=7.39..952069.85 rows=143766 width=126) (actual time=.. rows= loops=)
|
||
| 128. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on pricing_program_enrollment ppe (cost=0.00..459.63 rows=20563 width=24) (actual time=.. rows= loops=) |
||
| 129. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=6.06..6.06 rows=106 width=106) (actual time=.. rows= loops=) |
||
| 130. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on schedule s (cost=0.00..6.06 rows=106 width=106) (actual time=.. rows= loops=) |
||
| 131. |
SubPlan (forHash Join) |
|||||
| 132. | 0.000 | 0.000 | ↓ 0.0 |
→
Aggregate (cost=6.60..6.61 rows=1 width=8) (actual time=.. rows= loops=) |
||
| 133. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on schedule (cost=0.00..6.59 rows=2 width=8) (actual time=.. rows= loops=)
|
||
| 134. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=35.53..35.53 rows=1 width=53) (actual time=.. rows= loops=)
|
||
| 135. | 0.000 | 0.000 | ↓ 0.0 |
→
Bitmap Heap Scan on schedule_rates sr3 (cost=31.50..35.52 rows=1 width=53) (actual time=.. rows= loops=)
|
||
| 136. | 0.000 | 0.000 | ↓ 0.0 |
→
BitmapAnd (cost=31.50..31.50 rows=1 width=0) (actual time=.. rows= loops=) |
||
| 137. | 0.000 | 0.000 | ↓ 0.0 |
→
Bitmap Index Scan on schedule_rates_account_id_index (cost=0.00..4.89 rows=81 width=0) (actual time=.. rows= loops=)
|
||
| 138. | 0.000 | 0.000 | ↓ 0.0 |
→
Bitmap Index Scan on schedule_rates_effective_date_index (cost=0.00..26.36 rows=1345 width=0) (actual time=.. rows= loops=)
|
||
| 139. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on schedule s (cost=0.00..6.06 rows=106 width=8) (actual time=.. rows= loops=) |
||
| 140. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using pricing_program_enrollment_account_id_index on pricing_program_enrollment ppe (cost=0.00..6.27 rows=1 width=24) (actual time=.. rows= loops=)
|
||
| 141. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using rate_schedule_rates_id_index on rate r (cost=0.00..8.29 rows=1 width=10) (actual time=.. rows= loops=)
|
||
| 142. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using price_tier_rate_id_index on price_tier p (cost=0.00..0.33 rows=1 width=532) (actual time=.. rows= loops=)
|
||
| 143. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=35974684.80..35974684.80 rows=1 width=1036) (actual time=.. rows= loops=)
|
||
| 144. | 0.000 | 0.000 | ↓ 0.0 |
→
Subquery Scan rateforacc2_ (cost=35974684.77..35974684.79 rows=1 width=1036) (actual time=.. rows= loops=) |
||
| 145. | 0.000 | 0.000 | ↓ 0.0 |
→
HashAggregate (cost=35974684.77..35974684.78 rows=1 width=49) (actual time=.. rows= loops=) |
||
| 146. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop Left Join (cost=35974641.90..35974684.75 rows=1 width=49) (actual time=.. rows= loops=)
|
||
| 147. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=35974628.75..35974656.17 rows=1 width=48) (actual time=.. rows= loops=)
|
||
| 148. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=35974628.75..35974647.87 rows=1 width=552) (actual time=.. rows= loops=)
|
||
| 149. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=0.00..15.66 rows=7 width=28) (actual time=.. rows= loops=)
|
||
| 150. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using pricing_program_enrollment_key on pricing_program_enrollment ppe (cost=0.00..8.27 rows=1 width=24) (actual time=.. rows= loops=)
|
||
| 151. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on schedule s (cost=0.00..6.06 rows=106 width=8) (actual time=.. rows= loops=) |
||
| 152. | 0.000 | 0.000 | ↓ 0.0 |
→
Materialize (cost=35974628.75..35974628.97 rows=22 width=532) (actual time=.. rows= loops=) |
||
| 153. | 0.000 | 0.000 | ↓ 0.0 |
→
Merge Join (cost=35974594.30..35974628.73 rows=22 width=532) (actual time=.. rows= loops=)
|
||
| 154. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=17983931.96..17983942.86 rows=4361 width=20) (actual time=.. rows= loops=)
|
||
| 155. | 0.000 | 0.000 | ↓ 0.0 |
→
Subquery Scan sr (cost=17983613.81..17983668.32 rows=4361 width=20) (actual time=.. rows= loops=) |
||
| 156. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=17983613.81..17983624.71 rows=4361 width=548) (actual time=.. rows= loops=)
|
||
| 157. | 0.000 | 0.000 | ↓ 0.0 |
→
Merge Join (cost=17955494.34..17982275.68 rows=4361 width=548) (actual time=.. rows= loops=)
|
||
| 158. | 0.000 | 0.000 | ↓ 0.0 |
→
GroupAggregate (cost=31678.68..36348.18 rows=186576 width=41) (actual time=.. rows= loops=) |
||
| 159. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=31678.68..32146.14 rows=186984 width=41) (actual time=.. rows= loops=)
|
||
| 160. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on schedule_rates (cost=0.00..3797.84 rows=186984 width=41) (actual time=.. rows= loops=) |
||
| 161. | 0.000 | 0.000 | ↓ 0.0 |
→
Materialize (cost=17923815.66..17926152.96 rows=186984 width=548) (actual time=.. rows= loops=) |
||
| 162. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=17923815.66..17924283.12 rows=186984 width=548) (actual time=.. rows= loops=)
|
||
| 163. | 0.000 | 0.000 | ↓ 0.0 |
→
Unique (cost=16862493.60..17767518.98 rows=186984 width=53) (actual time=.. rows= loops=) |
||
| 164. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=16862493.60..16975621.77 rows=45251269 width=53) (actual time=.. rows= loops=)
|
||
| 165. | 0.000 | 0.000 | ↓ 0.0 |
→
Merge Join (cost=1016021.51..3375093.06 rows=45251269 width=53) (actual time=.. rows= loops=)
|
||
| 166. | 0.000 | 0.000 | ↓ 0.0 |
→
Unique (cost=983061.83..986296.56 rows=143766 width=126) (actual time=.. rows= loops=) |
||
| 167. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=983061.83..983421.24 rows=143766 width=126) (actual time=.. rows= loops=)
|
||
| 168. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Join (cost=7.39..952069.85 rows=143766 width=126) (actual time=.. rows= loops=)
|
||
| 169. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on pricing_program_enrollment ppe (cost=0.00..459.63 rows=20563 width=24) (actual time=.. rows= loops=) |
||
| 170. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=6.06..6.06 rows=106 width=106) (actual time=.. rows= loops=) |
||
| 171. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on schedule s (cost=0.00..6.06 rows=106 width=106) (actual time=.. rows= loops=) |
||
| 172. |
SubPlan (forHash Join) |
|||||
| 173. | 0.000 | 0.000 | ↓ 0.0 |
→
Aggregate (cost=6.60..6.61 rows=1 width=8) (actual time=.. rows= loops=) |
||
| 174. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on schedule (cost=0.00..6.59 rows=2 width=8) (actual time=.. rows= loops=)
|
||
| 175. | 0.000 | 0.000 | ↓ 0.0 |
→
Materialize (cost=32959.68..35296.98 rows=186984 width=53) (actual time=.. rows= loops=) |
||
| 176. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=32959.68..33427.14 rows=186984 width=53) (actual time=.. rows= loops=)
|
||
| 177. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on schedule_rates sr3 (cost=0.00..3797.84 rows=186984 width=53) (actual time=.. rows= loops=) |
||
| 178. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=17990662.34..17990662.84 rows=200 width=528) (actual time=.. rows= loops=)
|
||
| 179. | 0.000 | 0.000 | ↓ 0.0 |
→
HashAggregate (cost=17990650.20..17990652.70 rows=200 width=14) (actual time=.. rows= loops=) |
||
| 180. | 0.000 | 0.000 | ↓ 0.0 |
→
Merge Join (cost=17983613.81..17990617.49 rows=4361 width=14) (actual time=.. rows= loops=)
|
||
| 181. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=17983613.81..17983624.71 rows=4361 width=548) (actual time=.. rows= loops=)
|
||
| 182. | 0.000 | 0.000 | ↓ 0.0 |
→
Merge Join (cost=17955494.34..17982275.68 rows=4361 width=548) (actual time=.. rows= loops=)
|
||
| 183. | 0.000 | 0.000 | ↓ 0.0 |
→
GroupAggregate (cost=31678.68..36348.18 rows=186576 width=41) (actual time=.. rows= loops=) |
||
| 184. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=31678.68..32146.14 rows=186984 width=41) (actual time=.. rows= loops=)
|
||
| 185. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on schedule_rates (cost=0.00..3797.84 rows=186984 width=41) (actual time=.. rows= loops=) |
||
| 186. | 0.000 | 0.000 | ↓ 0.0 |
→
Materialize (cost=17923815.66..17926152.96 rows=186984 width=548) (actual time=.. rows= loops=) |
||
| 187. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=17923815.66..17924283.12 rows=186984 width=548) (actual time=.. rows= loops=)
|
||
| 188. | 0.000 | 0.000 | ↓ 0.0 |
→
Unique (cost=16862493.60..17767518.98 rows=186984 width=53) (actual time=.. rows= loops=) |
||
| 189. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=16862493.60..16975621.77 rows=45251269 width=53) (actual time=.. rows= loops=)
|
||
| 190. | 0.000 | 0.000 | ↓ 0.0 |
→
Merge Join (cost=1016021.51..3375093.06 rows=45251269 width=53) (actual time=.. rows= loops=)
|
||
| 191. | 0.000 | 0.000 | ↓ 0.0 |
→
Unique (cost=983061.83..986296.56 rows=143766 width=126) (actual time=.. rows= loops=) |
||
| 192. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=983061.83..983421.24 rows=143766 width=126) (actual time=.. rows= loops=)
|
||
| 193. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Join (cost=7.39..952069.85 rows=143766 width=126) (actual time=.. rows= loops=)
|
||
| 194. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on pricing_program_enrollment ppe (cost=0.00..459.63 rows=20563 width=24) (actual time=.. rows= loops=) |
||
| 195. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=6.06..6.06 rows=106 width=106) (actual time=.. rows= loops=) |
||
| 196. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on schedule s (cost=0.00..6.06 rows=106 width=106) (actual time=.. rows= loops=) |
||
| 197. |
SubPlan (forHash Join) |
|||||
| 198. | 0.000 | 0.000 | ↓ 0.0 |
→
Aggregate (cost=6.60..6.61 rows=1 width=8) (actual time=.. rows= loops=) |
||
| 199. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on schedule (cost=0.00..6.59 rows=2 width=8) (actual time=.. rows= loops=)
|
||
| 200. | 0.000 | 0.000 | ↓ 0.0 |
→
Materialize (cost=32959.68..35296.98 rows=186984 width=53) (actual time=.. rows= loops=) |
||
| 201. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=32959.68..33427.14 rows=186984 width=53) (actual time=.. rows= loops=)
|
||
| 202. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on schedule_rates sr3 (cost=0.00..3797.84 rows=186984 width=53) (actual time=.. rows= loops=) |
||
| 203. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using rate_schedule_rates_id_index on rate r2 (cost=0.00..6427.20 rows=186984 width=6) (actual time=.. rows= loops=) |
||
| 204. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using rate_schedule_rates_id_index on rate r (cost=0.00..8.29 rows=1 width=20) (actual time=.. rows= loops=)
|
||
| 205. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Join (cost=13.15..26.48 rows=140 width=521) (actual time=.. rows= loops=)
|
||
| 206. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on rate_group_ratekeys rk (cost=0.00..11.40 rows=140 width=520) (actual time=.. rows= loops=) |
||
| 207. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=11.40..11.40 rows=140 width=9) (actual time=.. rows= loops=) |
||
| 208. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on rate_group g (cost=0.00..11.40 rows=140 width=9) (actual time=.. rows= loops=) |
||
| 209. | 0.000 | 0.000 | ↓ 0.0 |
→
HashAggregate (cost=9.50..9.51 rows=1 width=1573) (actual time=.. rows= loops=) |
||
| 210. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=0.00..9.48 rows=1 width=1573) (actual time=.. rows= loops=) |
||
| 211. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on pricing_program pp (cost=0.00..1.20 rows=1 width=1553) (actual time=.. rows= loops=)
|
||
| 212. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using pricing_program_enrollment_account_id_index on pricing_program_enrollment ppe (cost=0.00..8.27 rows=1 width=24) (actual time=.. rows= loops=)
|
||
| 213. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Join (cost=40087635.85..40087682.27 rows=1 width=1700) (actual time=.. rows= loops=)
|
||
| 214. | 0.000 | 0.000 | ↓ 0.0 |
→
HashAggregate (cost=61.06..107.38 rows=7 width=126) (actual time=.. rows= loops=) |
||
| 215. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=0.00..60.92 rows=7 width=126) (actual time=.. rows= loops=) |
||
| 216. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using pricing_program_enrollment_account_id_index on pricing_program_enrollment ppe (cost=0.00..8.27 rows=1 width=24) (actual time=.. rows= loops=)
|
||
| 217. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on schedule s (cost=0.00..6.33 rows=7 width=106) (actual time=.. rows= loops=)
|
||
| 218. |
SubPlan (forNested Loop) |
|||||
| 219. | 0.000 | 0.000 | ↓ 0.0 |
→
Aggregate (cost=6.60..6.61 rows=1 width=8) (actual time=.. rows= loops=) |
||
| 220. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on schedule (cost=0.00..6.59 rows=2 width=8) (actual time=.. rows= loops=)
|
||
| 221. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=40087574.77..40087574.77 rows=1 width=1700) (actual time=.. rows= loops=) |
||
| 222. | 0.000 | 0.000 | ↓ 0.0 |
→
Merge Join (cost=40087574.72..40087574.77 rows=1 width=1700) (actual time=.. rows= loops=)
|
||
| 223. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=4112889.92..4112889.93 rows=4 width=1180) (actual time=.. rows= loops=)
|
||
| 224. | 0.000 | 0.000 | ↓ 0.0 |
→
Subquery Scan eprs (cost=4112889.80..4112889.88 rows=4 width=1180) (actual time=.. rows= loops=) |
||
| 225. | 0.000 | 0.000 | ↓ 0.0 |
→
HashAggregate (cost=4112889.80..4112889.84 rows=4 width=554) (actual time=.. rows= loops=) |
||
| 226. | 0.000 | 0.000 | ↓ 0.0 |
→
Append (cost=2056444.83..4112889.70 rows=4 width=554) (actual time=.. rows= loops=) |
||
| 227. | 0.000 | 0.000 | ↓ 0.0 |
→
Result (cost=2056444.83..2056444.88 rows=2 width=290) (actual time=.. rows= loops=) |
||
| 228. | 0.000 | 0.000 | ↓ 0.0 |
→
Unique (cost=2056444.83..2056444.88 rows=2 width=290) (actual time=.. rows= loops=) |
||
| 229. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=2056444.83..2056444.83 rows=2 width=290) (actual time=.. rows= loops=)
|
||
| 230. | 0.000 | 0.000 | ↓ 0.0 |
→
Append (cost=1027543.77..2056444.82 rows=2 width=290) (actual time=.. rows= loops=) |
||
| 231. | 0.000 | 0.000 | ↓ 0.0 |
→
Subquery Scan "*SELECT* 1" (cost=1027543.77..1027543.79 rows=1 width=538) (actual time=.. rows= loops=) |
||
| 232. | 0.000 | 0.000 | ↓ 0.0 |
→
HashAggregate (cost=1027543.77..1027543.78 rows=1 width=538) (actual time=.. rows= loops=) |
||
| 233. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=1027535.09..1027543.74 rows=1 width=538) (actual time=.. rows= loops=) |
||
| 234. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=1027535.09..1027543.40 rows=1 width=538) (actual time=.. rows= loops=) |
||
| 235. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=1027535.09..1027535.09 rows=1 width=548) (actual time=.. rows= loops=)
|
||
| 236. | 0.000 | 0.000 | ↓ 0.0 |
→
Merge Join (cost=1020065.64..1027535.08 rows=1 width=548) (actual time=.. rows= loops=)
|
||
| 237. | 0.000 | 0.000 | ↓ 0.0 |
→
GroupAggregate (cost=31678.68..36348.18 rows=186576 width=41) (actual time=.. rows= loops=) |
||
| 238. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=31678.68..32146.14 rows=186984 width=41) (actual time=.. rows= loops=)
|
||
| 239. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on schedule_rates (cost=0.00..3797.84 rows=186984 width=41) (actual time=.. rows= loops=) |
||
| 240. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=988386.96..988386.99 rows=14 width=548) (actual time=.. rows= loops=)
|
||
| 241. | 0.000 | 0.000 | ↓ 0.0 |
→
HashAggregate (cost=988386.41..988386.55 rows=14 width=53) (actual time=.. rows= loops=) |
||
| 242. | 0.000 | 0.000 | ↓ 0.0 |
→
Merge Join (cost=983119.19..988327.12 rows=3388 width=53) (actual time=.. rows= loops=)
|
||
| 243. | 0.000 | 0.000 | ↓ 0.0 |
→
Unique (cost=983061.83..986296.56 rows=143766 width=126) (actual time=.. rows= loops=) |
||
| 244. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=983061.83..983421.24 rows=143766 width=126) (actual time=.. rows= loops=)
|
||
| 245. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Join (cost=7.39..952069.85 rows=143766 width=126) (actual time=.. rows= loops=)
|
||
| 246. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on pricing_program_enrollment ppe (cost=0.00..459.63 rows=20563 width=24) (actual time=.. rows= loops=) |
||
| 247. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=6.06..6.06 rows=106 width=106) (actual time=.. rows= loops=) |
||
| 248. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on schedule s (cost=0.00..6.06 rows=106 width=106) (actual time=.. rows= loops=) |
||
| 249. |
SubPlan (forHash Join) |
|||||
| 250. | 0.000 | 0.000 | ↓ 0.0 |
→
Aggregate (cost=6.60..6.61 rows=1 width=8) (actual time=.. rows= loops=) |
||
| 251. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on schedule (cost=0.00..6.59 rows=2 width=8) (actual time=.. rows= loops=)
|
||
| 252. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=57.36..57.40 rows=14 width=53) (actual time=.. rows= loops=)
|
||
| 253. | 0.000 | 0.000 | ↓ 0.0 |
→
Bitmap Heap Scan on schedule_rates sr3 (cost=4.40..57.10 rows=14 width=53) (actual time=.. rows= loops=)
|
||
| 254. | 0.000 | 0.000 | ↓ 0.0 |
→
Bitmap Index Scan on schedule_rates_account_id_index (cost=0.00..4.39 rows=14 width=0) (actual time=.. rows= loops=)
|
||
| 255. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using rate_schedule_rates_id_index on rate r (cost=0.00..8.29 rows=1 width=10) (actual time=.. rows= loops=)
|
||
| 256. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using price_tier_rate_id_index on price_tier p (cost=0.00..0.33 rows=1 width=4) (actual time=.. rows= loops=)
|
||
| 257. | 0.000 | 0.000 | ↓ 0.0 |
→
Subquery Scan "*SELECT* 2" (cost=1028901.01..1028901.03 rows=1 width=42) (actual time=.. rows= loops=) |
||
| 258. | 0.000 | 0.000 | ↓ 0.0 |
→
HashAggregate (cost=1028901.01..1028901.02 rows=1 width=42) (actual time=.. rows= loops=) |
||
| 259. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=1028892.00..1028900.99 rows=1 width=42) (actual time=.. rows= loops=) |
||
| 260. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=1028892.00..1028900.65 rows=1 width=42) (actual time=.. rows= loops=) |
||
| 261. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=1028892.00..1028892.34 rows=1 width=36) (actual time=.. rows= loops=)
|
||
| 262. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=1028877.18..1028877.19 rows=2 width=548) (actual time=.. rows= loops=)
|
||
| 263. | 0.000 | 0.000 | ↓ 0.0 |
→
Merge Join (cost=1021401.57..1028877.17 rows=2 width=548) (actual time=.. rows= loops=)
|
||
| 264. | 0.000 | 0.000 | ↓ 0.0 |
→
GroupAggregate (cost=31678.68..36348.18 rows=186576 width=41) (actual time=.. rows= loops=) |
||
| 265. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=31678.68..32146.14 rows=186984 width=41) (actual time=.. rows= loops=)
|
||
| 266. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on schedule_rates (cost=0.00..3797.84 rows=186984 width=41) (actual time=.. rows= loops=) |
||
| 267. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=989722.90..989723.10 rows=80 width=548) (actual time=.. rows= loops=)
|
||
| 268. | 0.000 | 0.000 | ↓ 0.0 |
→
HashAggregate (cost=989718.77..989719.57 rows=80 width=53) (actual time=.. rows= loops=) |
||
| 269. | 0.000 | 0.000 | ↓ 0.0 |
→
Merge Join (cost=983341.80..989379.97 rows=19360 width=53) (actual time=.. rows= loops=)
|
||
| 270. | 0.000 | 0.000 | ↓ 0.0 |
→
Unique (cost=983061.83..986296.56 rows=143766 width=126) (actual time=.. rows= loops=) |
||
| 271. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=983061.83..983421.24 rows=143766 width=126) (actual time=.. rows= loops=)
|
||
| 272. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Join (cost=7.39..952069.85 rows=143766 width=126) (actual time=.. rows= loops=)
|
||
| 273. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on pricing_program_enrollment ppe (cost=0.00..459.63 rows=20563 width=24) (actual time=.. rows= loops=) |
||
| 274. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=6.06..6.06 rows=106 width=106) (actual time=.. rows= loops=) |
||
| 275. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on schedule s (cost=0.00..6.06 rows=106 width=106) (actual time=.. rows= loops=) |
||
| 276. |
SubPlan (forHash Join) |
|||||
| 277. | 0.000 | 0.000 | ↓ 0.0 |
→
Aggregate (cost=6.60..6.61 rows=1 width=8) (actual time=.. rows= loops=) |
||
| 278. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on schedule (cost=0.00..6.59 rows=2 width=8) (actual time=.. rows= loops=)
|
||
| 279. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=279.97..280.17 rows=80 width=53) (actual time=.. rows= loops=)
|
||
| 280. | 0.000 | 0.000 | ↓ 0.0 |
→
Bitmap Heap Scan on schedule_rates sr3 (cost=4.91..277.44 rows=80 width=53) (actual time=.. rows= loops=)
|
||
| 281. | 0.000 | 0.000 | ↓ 0.0 |
→
Bitmap Index Scan on schedule_rates_account_id_index (cost=0.00..4.89 rows=81 width=0) (actual time=.. rows= loops=)
|
||
| 282. | 0.000 | 0.000 | ↓ 0.0 |
→
Materialize (cost=14.82..14.89 rows=7 width=24) (actual time=.. rows= loops=) |
||
| 283. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Join (cost=8.29..14.81 rows=7 width=24) (actual time=.. rows= loops=)
|
||
| 284. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on schedule s (cost=0.00..6.06 rows=106 width=8) (actual time=.. rows= loops=) |
||
| 285. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=8.27..8.27 rows=1 width=24) (actual time=.. rows= loops=) |
||
| 286. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using pricing_program_enrollment_key on pricing_program_enrollment ppe (cost=0.00..8.27 rows=1 width=24) (actual time=.. rows= loops=)
|
||
| 287. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using rate_schedule_rates_id_index on rate r (cost=0.00..8.29 rows=1 width=10) (actual time=.. rows= loops=)
|
||
| 288. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using price_tier_rate_id_index on price_tier p (cost=0.00..0.33 rows=1 width=4) (actual time=.. rows= loops=)
|
||
| 289. | 0.000 | 0.000 | ↓ 0.0 |
→
Subquery Scan "*SELECT* 3" (cost=1027543.77..1027543.79 rows=1 width=1066) (actual time=.. rows= loops=) |
||
| 290. | 0.000 | 0.000 | ↓ 0.0 |
→
HashAggregate (cost=1027543.77..1027543.78 rows=1 width=1066) (actual time=.. rows= loops=) |
||
| 291. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=1027535.09..1027543.74 rows=1 width=1066) (actual time=.. rows= loops=) |
||
| 292. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=1027535.09..1027543.40 rows=1 width=538) (actual time=.. rows= loops=) |
||
| 293. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=1027535.09..1027535.09 rows=1 width=548) (actual time=.. rows= loops=)
|
||
| 294. | 0.000 | 0.000 | ↓ 0.0 |
→
Merge Join (cost=1020065.64..1027535.08 rows=1 width=548) (actual time=.. rows= loops=)
|
||
| 295. | 0.000 | 0.000 | ↓ 0.0 |
→
GroupAggregate (cost=31678.68..36348.18 rows=186576 width=41) (actual time=.. rows= loops=) |
||
| 296. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=31678.68..32146.14 rows=186984 width=41) (actual time=.. rows= loops=)
|
||
| 297. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on schedule_rates (cost=0.00..3797.84 rows=186984 width=41) (actual time=.. rows= loops=) |
||
| 298. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=988386.96..988386.99 rows=14 width=548) (actual time=.. rows= loops=)
|
||
| 299. | 0.000 | 0.000 | ↓ 0.0 |
→
HashAggregate (cost=988386.41..988386.55 rows=14 width=53) (actual time=.. rows= loops=) |
||
| 300. | 0.000 | 0.000 | ↓ 0.0 |
→
Merge Join (cost=983119.19..988327.12 rows=3388 width=53) (actual time=.. rows= loops=)
|
||
| 301. | 0.000 | 0.000 | ↓ 0.0 |
→
Unique (cost=983061.83..986296.56 rows=143766 width=126) (actual time=.. rows= loops=) |
||
| 302. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=983061.83..983421.24 rows=143766 width=126) (actual time=.. rows= loops=)
|
||
| 303. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Join (cost=7.39..952069.85 rows=143766 width=126) (actual time=.. rows= loops=)
|
||
| 304. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on pricing_program_enrollment ppe (cost=0.00..459.63 rows=20563 width=24) (actual time=.. rows= loops=) |
||
| 305. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=6.06..6.06 rows=106 width=106) (actual time=.. rows= loops=) |
||
| 306. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on schedule s (cost=0.00..6.06 rows=106 width=106) (actual time=.. rows= loops=) |
||
| 307. |
SubPlan (forHash Join) |
|||||
| 308. | 0.000 | 0.000 | ↓ 0.0 |
→
Aggregate (cost=6.60..6.61 rows=1 width=8) (actual time=.. rows= loops=) |
||
| 309. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on schedule (cost=0.00..6.59 rows=2 width=8) (actual time=.. rows= loops=)
|
||
| 310. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=57.36..57.40 rows=14 width=53) (actual time=.. rows= loops=)
|
||
| 311. | 0.000 | 0.000 | ↓ 0.0 |
→
Bitmap Heap Scan on schedule_rates sr3 (cost=4.40..57.10 rows=14 width=53) (actual time=.. rows= loops=)
|
||
| 312. | 0.000 | 0.000 | ↓ 0.0 |
→
Bitmap Index Scan on schedule_rates_account_id_index (cost=0.00..4.39 rows=14 width=0) (actual time=.. rows= loops=)
|
||
| 313. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using rate_schedule_rates_id_index on rate r (cost=0.00..8.29 rows=1 width=10) (actual time=.. rows= loops=)
|
||
| 314. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using price_tier_rate_id_index on price_tier p (cost=0.00..0.33 rows=1 width=532) (actual time=.. rows= loops=)
|
||
| 315. | 0.000 | 0.000 | ↓ 0.0 |
→
Subquery Scan "*SELECT* 4" (cost=1028901.01..1028901.03 rows=1 width=570) (actual time=.. rows= loops=) |
||
| 316. | 0.000 | 0.000 | ↓ 0.0 |
→
HashAggregate (cost=1028901.01..1028901.02 rows=1 width=570) (actual time=.. rows= loops=) |
||
| 317. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=1028892.00..1028900.99 rows=1 width=570) (actual time=.. rows= loops=) |
||
| 318. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=1028892.00..1028900.65 rows=1 width=42) (actual time=.. rows= loops=) |
||
| 319. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=1028892.00..1028892.34 rows=1 width=36) (actual time=.. rows= loops=)
|
||
| 320. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=1028877.18..1028877.19 rows=2 width=548) (actual time=.. rows= loops=)
|
||
| 321. | 0.000 | 0.000 | ↓ 0.0 |
→
Merge Join (cost=1021401.57..1028877.17 rows=2 width=548) (actual time=.. rows= loops=)
|
||
| 322. | 0.000 | 0.000 | ↓ 0.0 |
→
GroupAggregate (cost=31678.68..36348.18 rows=186576 width=41) (actual time=.. rows= loops=) |
||
| 323. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=31678.68..32146.14 rows=186984 width=41) (actual time=.. rows= loops=)
|
||
| 324. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on schedule_rates (cost=0.00..3797.84 rows=186984 width=41) (actual time=.. rows= loops=) |
||
| 325. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=989722.90..989723.10 rows=80 width=548) (actual time=.. rows= loops=)
|
||
| 326. | 0.000 | 0.000 | ↓ 0.0 |
→
HashAggregate (cost=989718.77..989719.57 rows=80 width=53) (actual time=.. rows= loops=) |
||
| 327. | 0.000 | 0.000 | ↓ 0.0 |
→
Merge Join (cost=983341.80..989379.97 rows=19360 width=53) (actual time=.. rows= loops=)
|
||
| 328. | 0.000 | 0.000 | ↓ 0.0 |
→
Unique (cost=983061.83..986296.56 rows=143766 width=126) (actual time=.. rows= loops=) |
||
| 329. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=983061.83..983421.24 rows=143766 width=126) (actual time=.. rows= loops=)
|
||
| 330. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Join (cost=7.39..952069.85 rows=143766 width=126) (actual time=.. rows= loops=)
|
||
| 331. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on pricing_program_enrollment ppe (cost=0.00..459.63 rows=20563 width=24) (actual time=.. rows= loops=) |
||
| 332. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=6.06..6.06 rows=106 width=106) (actual time=.. rows= loops=) |
||
| 333. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on schedule s (cost=0.00..6.06 rows=106 width=106) (actual time=.. rows= loops=) |
||
| 334. |
SubPlan (forHash Join) |
|||||
| 335. | 0.000 | 0.000 | ↓ 0.0 |
→
Aggregate (cost=6.60..6.61 rows=1 width=8) (actual time=.. rows= loops=) |
||
| 336. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on schedule (cost=0.00..6.59 rows=2 width=8) (actual time=.. rows= loops=)
|
||
| 337. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=279.97..280.17 rows=80 width=53) (actual time=.. rows= loops=)
|
||
| 338. | 0.000 | 0.000 | ↓ 0.0 |
→
Bitmap Heap Scan on schedule_rates sr3 (cost=4.91..277.44 rows=80 width=53) (actual time=.. rows= loops=)
|
||
| 339. | 0.000 | 0.000 | ↓ 0.0 |
→
Bitmap Index Scan on schedule_rates_account_id_index (cost=0.00..4.89 rows=81 width=0) (actual time=.. rows= loops=)
|
||
| 340. | 0.000 | 0.000 | ↓ 0.0 |
→
Materialize (cost=14.82..14.89 rows=7 width=24) (actual time=.. rows= loops=) |
||
| 341. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Join (cost=8.29..14.81 rows=7 width=24) (actual time=.. rows= loops=)
|
||
| 342. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on schedule s (cost=0.00..6.06 rows=106 width=8) (actual time=.. rows= loops=) |
||
| 343. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=8.27..8.27 rows=1 width=24) (actual time=.. rows= loops=) |
||
| 344. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using pricing_program_enrollment_key on pricing_program_enrollment ppe (cost=0.00..8.27 rows=1 width=24) (actual time=.. rows= loops=)
|
||
| 345. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using rate_schedule_rates_id_index on rate r (cost=0.00..8.29 rows=1 width=10) (actual time=.. rows= loops=)
|
||
| 346. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using price_tier_rate_id_index on price_tier p (cost=0.00..0.33 rows=1 width=532) (actual time=.. rows= loops=)
|
||
| 347. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=35974684.80..35974684.80 rows=1 width=1036) (actual time=.. rows= loops=)
|
||
| 348. | 0.000 | 0.000 | ↓ 0.0 |
→
Subquery Scan rateforacc5_ (cost=35974684.77..35974684.79 rows=1 width=1036) (actual time=.. rows= loops=) |
||
| 349. | 0.000 | 0.000 | ↓ 0.0 |
→
HashAggregate (cost=35974684.77..35974684.78 rows=1 width=49) (actual time=.. rows= loops=) |
||
| 350. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop Left Join (cost=35974641.90..35974684.75 rows=1 width=49) (actual time=.. rows= loops=)
|
||
| 351. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=35974628.75..35974656.17 rows=1 width=48) (actual time=.. rows= loops=)
|
||
| 352. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=35974628.75..35974647.87 rows=1 width=552) (actual time=.. rows= loops=)
|
||
| 353. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=0.00..15.66 rows=7 width=28) (actual time=.. rows= loops=)
|
||
| 354. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using pricing_program_enrollment_key on pricing_program_enrollment ppe (cost=0.00..8.27 rows=1 width=24) (actual time=.. rows= loops=)
|
||
| 355. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on schedule s (cost=0.00..6.06 rows=106 width=8) (actual time=.. rows= loops=) |
||
| 356. | 0.000 | 0.000 | ↓ 0.0 |
→
Materialize (cost=35974628.75..35974628.97 rows=22 width=532) (actual time=.. rows= loops=) |
||
| 357. | 0.000 | 0.000 | ↓ 0.0 |
→
Merge Join (cost=35974594.30..35974628.73 rows=22 width=532) (actual time=.. rows= loops=)
|
||
| 358. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=17983931.96..17983942.86 rows=4361 width=20) (actual time=.. rows= loops=)
|
||
| 359. | 0.000 | 0.000 | ↓ 0.0 |
→
Subquery Scan sr (cost=17983613.81..17983668.32 rows=4361 width=20) (actual time=.. rows= loops=) |
||
| 360. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=17983613.81..17983624.71 rows=4361 width=548) (actual time=.. rows= loops=)
|
||
| 361. | 0.000 | 0.000 | ↓ 0.0 |
→
Merge Join (cost=17955494.34..17982275.68 rows=4361 width=548) (actual time=.. rows= loops=)
|
||
| 362. | 0.000 | 0.000 | ↓ 0.0 |
→
GroupAggregate (cost=31678.68..36348.18 rows=186576 width=41) (actual time=.. rows= loops=) |
||
| 363. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=31678.68..32146.14 rows=186984 width=41) (actual time=.. rows= loops=)
|
||
| 364. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on schedule_rates (cost=0.00..3797.84 rows=186984 width=41) (actual time=.. rows= loops=) |
||
| 365. | 0.000 | 0.000 | ↓ 0.0 |
→
Materialize (cost=17923815.66..17926152.96 rows=186984 width=548) (actual time=.. rows= loops=) |
||
| 366. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=17923815.66..17924283.12 rows=186984 width=548) (actual time=.. rows= loops=)
|
||
| 367. | 0.000 | 0.000 | ↓ 0.0 |
→
Unique (cost=16862493.60..17767518.98 rows=186984 width=53) (actual time=.. rows= loops=) |
||
| 368. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=16862493.60..16975621.77 rows=45251269 width=53) (actual time=.. rows= loops=)
|
||
| 369. | 0.000 | 0.000 | ↓ 0.0 |
→
Merge Join (cost=1016021.51..3375093.06 rows=45251269 width=53) (actual time=.. rows= loops=)
|
||
| 370. | 0.000 | 0.000 | ↓ 0.0 |
→
Unique (cost=983061.83..986296.56 rows=143766 width=126) (actual time=.. rows= loops=) |
||
| 371. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=983061.83..983421.24 rows=143766 width=126) (actual time=.. rows= loops=)
|
||
| 372. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Join (cost=7.39..952069.85 rows=143766 width=126) (actual time=.. rows= loops=)
|
||
| 373. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on pricing_program_enrollment ppe (cost=0.00..459.63 rows=20563 width=24) (actual time=.. rows= loops=) |
||
| 374. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=6.06..6.06 rows=106 width=106) (actual time=.. rows= loops=) |
||
| 375. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on schedule s (cost=0.00..6.06 rows=106 width=106) (actual time=.. rows= loops=) |
||
| 376. |
SubPlan (forHash Join) |
|||||
| 377. | 0.000 | 0.000 | ↓ 0.0 |
→
Aggregate (cost=6.60..6.61 rows=1 width=8) (actual time=.. rows= loops=) |
||
| 378. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on schedule (cost=0.00..6.59 rows=2 width=8) (actual time=.. rows= loops=)
|
||
| 379. | 0.000 | 0.000 | ↓ 0.0 |
→
Materialize (cost=32959.68..35296.98 rows=186984 width=53) (actual time=.. rows= loops=) |
||
| 380. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=32959.68..33427.14 rows=186984 width=53) (actual time=.. rows= loops=)
|
||
| 381. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on schedule_rates sr3 (cost=0.00..3797.84 rows=186984 width=53) (actual time=.. rows= loops=) |
||
| 382. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=17990662.34..17990662.84 rows=200 width=528) (actual time=.. rows= loops=)
|
||
| 383. | 0.000 | 0.000 | ↓ 0.0 |
→
HashAggregate (cost=17990650.20..17990652.70 rows=200 width=14) (actual time=.. rows= loops=) |
||
| 384. | 0.000 | 0.000 | ↓ 0.0 |
→
Merge Join (cost=17983613.81..17990617.49 rows=4361 width=14) (actual time=.. rows= loops=)
|
||
| 385. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=17983613.81..17983624.71 rows=4361 width=548) (actual time=.. rows= loops=)
|
||
| 386. | 0.000 | 0.000 | ↓ 0.0 |
→
Merge Join (cost=17955494.34..17982275.68 rows=4361 width=548) (actual time=.. rows= loops=)
|
||
| 387. | 0.000 | 0.000 | ↓ 0.0 |
→
GroupAggregate (cost=31678.68..36348.18 rows=186576 width=41) (actual time=.. rows= loops=) |
||
| 388. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=31678.68..32146.14 rows=186984 width=41) (actual time=.. rows= loops=)
|
||
| 389. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on schedule_rates (cost=0.00..3797.84 rows=186984 width=41) (actual time=.. rows= loops=) |
||
| 390. | 0.000 | 0.000 | ↓ 0.0 |
→
Materialize (cost=17923815.66..17926152.96 rows=186984 width=548) (actual time=.. rows= loops=) |
||
| 391. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=17923815.66..17924283.12 rows=186984 width=548) (actual time=.. rows= loops=)
|
||
| 392. | 0.000 | 0.000 | ↓ 0.0 |
→
Unique (cost=16862493.60..17767518.98 rows=186984 width=53) (actual time=.. rows= loops=) |
||
| 393. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=16862493.60..16975621.77 rows=45251269 width=53) (actual time=.. rows= loops=)
|
||
| 394. | 0.000 | 0.000 | ↓ 0.0 |
→
Merge Join (cost=1016021.51..3375093.06 rows=45251269 width=53) (actual time=.. rows= loops=)
|
||
| 395. | 0.000 | 0.000 | ↓ 0.0 |
→
Unique (cost=983061.83..986296.56 rows=143766 width=126) (actual time=.. rows= loops=) |
||
| 396. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=983061.83..983421.24 rows=143766 width=126) (actual time=.. rows= loops=)
|
||
| 397. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Join (cost=7.39..952069.85 rows=143766 width=126) (actual time=.. rows= loops=)
|
||
| 398. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on pricing_program_enrollment ppe (cost=0.00..459.63 rows=20563 width=24) (actual time=.. rows= loops=) |
||
| 399. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=6.06..6.06 rows=106 width=106) (actual time=.. rows= loops=) |
||
| 400. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on schedule s (cost=0.00..6.06 rows=106 width=106) (actual time=.. rows= loops=) |
||
| 401. |
SubPlan (forHash Join) |
|||||
| 402. | 0.000 | 0.000 | ↓ 0.0 |
→
Aggregate (cost=6.60..6.61 rows=1 width=8) (actual time=.. rows= loops=) |
||
| 403. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on schedule (cost=0.00..6.59 rows=2 width=8) (actual time=.. rows= loops=)
|
||
| 404. | 0.000 | 0.000 | ↓ 0.0 |
→
Materialize (cost=32959.68..35296.98 rows=186984 width=53) (actual time=.. rows= loops=) |
||
| 405. | 0.000 | 0.000 | ↓ 0.0 |
→
Sort (cost=32959.68..33427.14 rows=186984 width=53) (actual time=.. rows= loops=)
|
||
| 406. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on schedule_rates sr3 (cost=0.00..3797.84 rows=186984 width=53) (actual time=.. rows= loops=) |
||
| 407. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using rate_schedule_rates_id_index on rate r2 (cost=0.00..6427.20 rows=186984 width=6) (actual time=.. rows= loops=) |
||
| 408. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using rate_schedule_rates_id_index on rate r (cost=0.00..8.29 rows=1 width=20) (actual time=.. rows= loops=)
|
||
| 409. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash Join (cost=13.15..26.48 rows=140 width=521) (actual time=.. rows= loops=)
|
||
| 410. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on rate_group_ratekeys rk (cost=0.00..11.40 rows=140 width=520) (actual time=.. rows= loops=) |
||
| 411. | 0.000 | 0.000 | ↓ 0.0 |
→
Hash (cost=11.40..11.40 rows=140 width=9) (actual time=.. rows= loops=) |
||
| 412. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on rate_group g (cost=0.00..11.40 rows=140 width=9) (actual time=.. rows= loops=) |
||
| 413. | 0.000 | 0.000 | ↓ 0.0 |
→
HashAggregate (cost=9.50..9.51 rows=1 width=1573) (actual time=.. rows= loops=) |
||
| 414. | 0.000 | 0.000 | ↓ 0.0 |
→
Nested Loop (cost=0.00..9.48 rows=1 width=1573) (actual time=.. rows= loops=) |
||
| 415. | 0.000 | 0.000 | ↓ 0.0 |
→
Seq Scan on pricing_program pp (cost=0.00..1.20 rows=1 width=1553) (actual time=.. rows= loops=)
|
||
| 416. | 0.000 | 0.000 | ↓ 0.0 |
→
Index Scan using pricing_program_enrollment_account_id_index on pricing_program_enrollment ppe (cost=0.00..8.27 rows=1 width=24) (actual time=.. rows= loops=)
|