explain.depesz.com

A tool for finding a real cause for slow queries.

Result: TJ

options
exclusive inclusive rows x rows loops node
0.000 0.000 ↓ 0.0
→

Sort (cost=1479.92..1479.95 rows=10 width=7240) (actual time=.. rows= loops=)

  • Sort Key: owner.name
0.000 0.000 ↓ 0.0
→

HashAggregate (cost=1479.13..1479.76 rows=10 width=7240) (actual time=.. rows= loops=)

0.000 0.000 ↓ 0.0
→

Hash Join (cost=1470.14..1475.65 rows=15 width=7240) (actual time=.. rows= loops=)

  • Hash Cond: (owner.id = fr.owner_id)
0.000 0.000 ↓ 0.0
→

Seq Scan on organizations owner (cost=0.00..5.18 rows=34 width=6756) (actual time=.. rows= loops=)

  • Filter: (id = ANY ('{1,10,11,12,13,14,15,16,17,18,19,2,20,21,22,23,24,25,26,27,28,29,3,30,31,32,33,34,35,36,37,38,39,4,40,41,42,43,44,45,46,47,48,49,5,50,51,53,54,55,6,7,8,9}'::integer[]))
0.000 0.000 ↓ 0.0
→

Hash (cost=1469.79..1469.79 rows=28 width=492) (actual time=.. rows= loops=)

0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=1454.61..1469.79 rows=28 width=492) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q387.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=1443.78..1458.87 rows=28 width=488) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q388.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=1432.96..1447.95 rows=28 width=480) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q389.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=1422.14..1437.04 rows=28 width=472) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q390.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=1411.31..1426.12 rows=28 width=464) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q391.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=1400.49..1415.20 rows=28 width=456) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q380.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=1389.67..1404.28 rows=28 width=456) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q381.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=1378.84..1393.36 rows=28 width=456) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q382.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=1368.02..1382.44 rows=28 width=456) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q383.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=1357.20..1371.53 rows=28 width=456) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q384.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=1346.37..1360.61 rows=28 width=456) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q385.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=1335.55..1349.69 rows=28 width=456) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q386.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=1324.73..1338.77 rows=28 width=456) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q374.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=1313.90..1327.85 rows=28 width=448) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q375.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=1303.08..1316.93 rows=28 width=440) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q376.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=1292.26..1306.02 rows=28 width=432) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q377.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=1281.43..1295.10 rows=28 width=424) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q378.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=1270.61..1284.18 rows=28 width=424) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q379.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=1259.79..1273.26 rows=28 width=424) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q418.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=1248.96..1262.34 rows=28 width=416) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q367.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=1238.14..1251.42 rows=28 width=408) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q368.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=1227.32..1240.51 rows=28 width=400) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q369.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=1216.49..1229.59 rows=28 width=392) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q370.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=1205.67..1218.67 rows=28 width=392) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q371.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=1194.85..1207.75 rows=28 width=384) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q372.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=1184.02..1196.83 rows=28 width=376) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q373.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=1173.20..1185.91 rows=28 width=368) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q360.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=1162.38..1175.00 rows=28 width=368) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q361.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=1151.55..1164.08 rows=28 width=368) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q362.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=1140.73..1153.16 rows=28 width=368) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q363.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=1129.90..1142.24 rows=28 width=360) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q364.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=1119.08..1131.32 rows=28 width=360) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q365.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=1108.26..1120.40 rows=28 width=352) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q366.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=1097.43..1109.48 rows=28 width=344) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q144.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=1086.61..1098.57 rows=28 width=344) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q145.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=1075.79..1087.65 rows=28 width=344) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q146.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=1064.96..1076.73 rows=28 width=344) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q147.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=1054.14..1065.81 rows=28 width=344) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q148.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=1043.32..1054.89 rows=28 width=336) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q149.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=1032.49..1043.97 rows=28 width=328) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q359.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=1021.67..1033.06 rows=28 width=328) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q39.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=1010.85..1022.14 rows=28 width=328) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q40.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=1000.02..1011.22 rows=28 width=328) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q41.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=989.20..1000.30 rows=28 width=328) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q42.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=978.38..989.38 rows=28 width=328) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q43.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=967.55..978.46 rows=28 width=328) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q44.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=956.73..967.55 rows=28 width=328) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q143.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=945.91..956.63 rows=28 width=328) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q137.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=935.08..945.71 rows=28 width=320) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q37.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=922.09..932.52 rows=28 width=320) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q138.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=911.27..921.60 rows=28 width=320) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q139.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=900.45..910.68 rows=28 width=320) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q140.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=889.62..899.76 rows=28 width=320) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q141.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=878.80..888.85 rows=28 width=320) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q142.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=867.98..877.93 rows=28 width=312) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q35.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=857.15..867.01 rows=28 width=312) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q130.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=846.33..856.09 rows=28 width=312) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q93.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=835.51..845.17 rows=28 width=304) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q94.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=824.68..834.25 rows=28 width=296) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q46.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=813.86..823.34 rows=28 width=296) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q47.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=803.04..812.42 rows=28 width=296) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q48.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=792.21..801.50 rows=28 width=296) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q32.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=781.39..790.58 rows=28 width=296) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q33.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=770.57..779.66 rows=28 width=296) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q34.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=759.74..768.74 rows=28 width=296) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q98.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=748.92..757.83 rows=28 width=296) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q99.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=738.10..746.91 rows=28 width=288) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q100.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=727.27..735.99 rows=28 width=280) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q129.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=716.45..725.07 rows=28 width=272) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q29.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=705.63..714.15 rows=28 width=272) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q101.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=694.80..703.23 rows=28 width=264) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q102.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=683.98..692.32 rows=28 width=256) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q296.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=673.16..681.40 rows=28 width=248) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q297.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=662.33..670.48 rows=28 width=240) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q97.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=651.51..659.56 rows=28 width=232) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q31.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=640.69..648.64 rows=28 width=232) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q22.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=629.86..637.72 rows=28 width=232) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q96.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=619.04..626.80 rows=28 width=224) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q24.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=608.22..615.89 rows=28 width=224) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q25.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=597.39..604.97 rows=28 width=224) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q26.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=586.57..594.05 rows=28 width=224) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q27.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=575.75..583.13 rows=28 width=224) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q28.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=564.92..572.21 rows=28 width=224) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q117.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=554.10..561.29 rows=28 width=216) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q118.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=543.28..550.38 rows=28 width=208) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q119.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=532.45..539.46 rows=28 width=208) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q95.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=521.63..528.54 rows=28 width=200) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q19.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=510.81..517.62 rows=28 width=200) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q20.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=499.98..506.70 rows=28 width=200) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q21.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=489.16..495.78 rows=28 width=200) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q15.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=478.34..484.87 rows=28 width=200) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q16.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=467.51..473.95 rows=28 width=200) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q103.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=456.69..463.03 rows=28 width=192) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q18.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=443.60..449.72 rows=28 width=192) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q104.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=432.78..438.80 rows=28 width=192) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q105.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=421.96..427.89 rows=28 width=192) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q106.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=411.13..416.97 rows=28 width=192) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q1.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=395.20..400.45 rows=28 width=192) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q4.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=384.38..389.53 rows=28 width=192) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q88.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=373.56..378.61 rows=28 width=192) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q253.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=362.73..367.69 rows=28 width=184) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q90.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=351.91..356.77 rows=28 width=176) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q13.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=341.09..345.86 rows=28 width=176) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q14.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=330.26..334.94 rows=28 width=176) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q10.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=316.51..320.87 rows=28 width=168) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q11.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=305.69..309.95 rows=28 width=160) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q12.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=294.86..299.03 rows=28 width=152) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q3.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=278.64..282.18 rows=28 width=152) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q2.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=261.89..264.72 rows=28 width=152) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q7.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=248.60..251.20 rows=28 width=152) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q83.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=233.93..236.09 rows=28 width=144) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q219.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=223.10..225.17 rows=28 width=136) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q220.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=212.28..214.26 rows=28 width=128) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q221.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=201.46..203.34 rows=28 width=128) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q227.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=190.63..192.42 rows=28 width=120) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q602.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=179.81..181.50 rows=28 width=120) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q8.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=168.99..170.58 rows=28 width=112) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q9.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=156.05..157.45 rows=28 width=104) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q70.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=145.22..146.53 rows=28 width=96) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q71.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=134.40..135.61 rows=28 width=88) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q72.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=123.58..124.69 rows=28 width=80) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q218.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=112.75..113.77 rows=28 width=72) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q436.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=101.93..102.85 rows=28 width=64) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q81.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=91.11..91.94 rows=28 width=64) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q77.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=80.28..81.02 rows=28 width=56) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q50.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=69.46..70.10 rows=28 width=48) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q216.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=58.63..59.18 rows=28 width=40) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q52.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=47.81..48.26 rows=28 width=32) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q55.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=36.99..37.34 rows=28 width=24) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q56.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=26.16..26.42 rows=28 width=16) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q57.form_response_id)
0.000 0.000 ↓ 0.0
→

Merge Left Join (cost=15.34..15.51 rows=28 width=8) (actual time=.. rows= loops=)

  • Merge Cond: (fr.id = q69.form_response_id)
0.000 0.000 ↓ 0.0
→

Sort (cost=4.52..4.59 rows=28 width=8) (actual time=.. rows= loops=)

  • Sort Key: fr.id
0.000 0.000 ↓ 0.0
→

Seq Scan on form_responses fr (cost=0.00..3.84 rows=28 width=8) (actual time=.. rows= loops=)

  • Filter: (((owner_type)::text = 'Organization'::text) AND (form_id = 3))
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q69.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q69 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 69)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 69)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q57.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q57 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 57)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 57)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q56.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q56 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 56)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 56)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q55.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q55 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 55)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 55)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q52.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q52 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 52)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 52)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q216.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q216 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 216)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 216)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q50.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q50 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 50)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 50)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q77.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q77 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 77)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 77)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q81.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q81 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 81)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 81)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q436.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q436 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 436)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 436)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q218.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q218 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 218)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 218)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q72.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q72 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 72)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 72)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q71.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q71 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 71)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 71)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q70.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q70 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 70)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 70)
0.000 0.000 ↓ 0.0
→

Sort (cost=12.94..12.98 rows=17 width=12) (actual time=.. rows= loops=)

  • Sort Key: q9.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q9 (cost=4.38..12.59 rows=17 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 9)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.38 rows=17 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 9)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q8.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q8 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 8)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 8)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q602.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q602 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 602)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 602)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q227.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q227 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 227)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 227)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q221.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q221 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 221)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 221)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q220.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q220 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 220)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 220)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q219.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q219 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 219)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 219)
0.000 0.000 ↓ 0.0
→

Sort (cost=14.67..14.80 rows=50 width=12) (actual time=.. rows= loops=)

  • Sort Key: q83.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q83 (cost=4.64..13.26 rows=50 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 83)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.63 rows=50 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 83)
0.000 0.000 ↓ 0.0
→

Sort (cost=13.29..13.35 rows=24 width=4) (actual time=.. rows= loops=)

  • Sort Key: q7.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q7 (cost=4.44..12.74 rows=24 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 7)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.43 rows=24 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 7)
0.000 0.000 ↓ 0.0
→

Sort (cost=16.75..16.97 rows=86 width=4) (actual time=.. rows= loops=)

  • Sort Key: q2.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q2 (cost=4.92..13.99 rows=86 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 2)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.90 rows=86 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 2)
0.000 0.000 ↓ 0.0
→

Sort (cost=16.22..16.41 rows=77 width=4) (actual time=.. rows= loops=)

  • Sort Key: q3.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q3 (cost=4.85..13.81 rows=77 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 3)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.83 rows=77 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 3)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q12.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q12 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 12)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 12)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q11.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q11 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 11)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 11)
0.000 0.000 ↓ 0.0
→

Sort (cost=13.75..13.83 rows=33 width=12) (actual time=.. rows= loops=)

  • Sort Key: q10.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q10 (cost=4.51..12.92 rows=33 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 10)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.50 rows=33 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 10)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q14.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q14 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 14)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 14)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q13.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q13 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 13)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 13)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q90.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q90 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 90)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 90)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q253.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q253 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 253)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 253)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q88.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q88 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 88)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 88)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q4.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q4 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 4)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 4)
0.000 0.000 ↓ 0.0
→

Sort (cost=15.93..16.11 rows=72 width=4) (actual time=.. rows= loops=)

  • Sort Key: q1.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q1 (cost=4.81..13.71 rows=72 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 1)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.79 rows=72 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 1)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q106.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q106 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 106)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 106)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q105.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q105 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 105)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 105)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q104.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q104 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 104)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 104)
0.000 0.000 ↓ 0.0
→

Sort (cost=13.09..13.14 rows=20 width=4) (actual time=.. rows= loops=)

  • Sort Key: q18.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q18 (cost=4.41..12.66 rows=20 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 18)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.40 rows=20 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 18)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q103.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q103 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 103)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 103)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q16.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q16 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 16)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 16)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q15.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q15 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 15)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 15)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q21.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q21 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 21)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 21)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q20.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q20 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 20)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 20)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q19.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q19 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 19)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 19)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q95.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q95 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 95)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 95)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q119.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q119 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 119)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 119)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q118.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q118 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 118)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 118)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q117.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q117 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 117)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 117)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q28.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q28 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 28)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 28)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q27.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q27 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 27)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 27)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q26.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q26 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 26)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 26)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q25.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q25 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 25)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 25)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q24.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q24 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 24)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 24)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q96.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q96 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 96)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 96)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q22.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q22 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 22)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 22)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q31.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q31 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 31)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 31)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q97.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q97 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 97)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 97)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q297.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q297 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 297)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 297)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q296.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q296 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 296)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 296)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q102.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q102 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 102)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 102)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q101.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q101 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 101)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 101)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q29.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q29 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 29)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 29)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q129.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q129 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 129)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 129)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q100.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q100 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 100)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 100)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q99.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q99 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 99)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 99)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q98.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q98 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 98)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 98)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q34.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q34 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 34)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 34)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q33.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q33 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 33)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 33)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q32.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q32 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 32)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 32)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q48.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q48 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 48)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 48)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q47.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q47 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 47)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 47)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q46.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q46 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 46)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 46)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q94.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q94 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 94)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 94)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q93.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q93 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 93)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 93)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q130.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q130 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 130)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 130)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q35.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q35 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 35)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 35)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q142.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q142 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 142)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 142)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q141.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q141 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 141)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 141)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q140.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q140 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 140)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 140)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q139.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q139 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 139)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 139)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q138.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q138 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 138)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 138)
0.000 0.000 ↓ 0.0
→

Sort (cost=12.99..13.03 rows=18 width=4) (actual time=.. rows= loops=)

  • Sort Key: q37.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q37 (cost=4.39..12.61 rows=18 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 37)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.39 rows=18 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 37)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q137.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q137 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 137)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 137)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q143.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q143 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 143)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 143)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q44.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q44 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 44)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 44)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q43.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q43 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 43)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 43)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q42.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q42 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 42)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 42)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q41.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q41 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 41)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 41)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q40.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q40 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 40)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 40)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q39.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q39 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 39)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 39)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q359.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q359 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 359)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 359)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q149.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q149 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 149)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 149)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q148.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q148 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 148)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 148)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q147.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q147 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 147)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 147)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q146.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q146 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 146)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 146)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q145.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q145 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 145)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 145)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q144.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q144 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 144)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 144)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q366.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q366 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 366)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 366)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q365.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q365 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 365)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 365)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q364.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q364 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 364)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 364)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q363.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q363 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 363)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 363)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q362.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q362 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 362)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 362)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q361.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q361 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 361)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 361)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q360.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q360 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 360)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 360)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q373.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q373 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 373)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 373)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q372.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q372 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 372)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 372)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q371.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q371 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 371)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 371)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q370.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q370 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 370)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 370)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q369.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q369 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 369)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 369)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q368.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q368 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 368)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 368)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q367.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q367 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 367)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 367)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q418.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q418 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 418)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 418)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q379.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q379 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 379)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 379)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q378.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q378 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 378)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 378)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q377.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q377 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 377)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 377)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q376.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q376 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 376)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 376)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q375.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q375 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 375)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 375)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q374.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q374 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 374)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 374)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q386.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q386 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 386)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 386)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q385.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q385 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 385)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 385)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q384.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q384 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 384)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 384)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q383.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q383 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 383)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 383)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q382.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q382 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 382)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 382)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q381.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q381 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 381)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 381)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=4) (actual time=.. rows= loops=)

  • Sort Key: q380.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q380 (cost=4.27..10.80 rows=3 width=4) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 380)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 380)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q391.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q391 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 391)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 391)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q390.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q390 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 390)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 390)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q389.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q389 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 389)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 389)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q388.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q388 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 388)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 388)
0.000 0.000 ↓ 0.0
→

Sort (cost=10.82..10.83 rows=3 width=12) (actual time=.. rows= loops=)

  • Sort Key: q387.form_response_id
0.000 0.000 ↓ 0.0
→

Bitmap Heap Scan on answers q387 (cost=4.27..10.80 rows=3 width=12) (actual time=.. rows= loops=)

  • Recheck Cond: (question_id = 387)
0.000 0.000 ↓ 0.0
→

Bitmap Index Scan on index_answers_on_question_id (cost=0.00..4.27 rows=3 width=0) (actual time=.. rows= loops=)

  • Index Cond: (question_id = 387)