Re: Bitmap scan is undercosted?

On Fri, Dec 1, 2017 at 11:08 PM, Vitaliy Garnashevich < vgarnashevich@gmail.com> wrote: > > > seq_page_cost = 0.0 > random_page_cost = 0.0 > explain analyze select * from aaa where num = 2 and flag = true; > > Bitmap Heap Scan on aaa (cost=753.00..2003.00 rows=10257 width=5) (actual > time=82.212..82.212 rows=0 loops=1) > -> Bitmap Index Scan on i1 (cost=0.00..750.43 rows=100000 width=0) > (actual time=17.401..17.401 rows=100000 loops=1) > > Index Scan using i1 on aaa (cost=0.44..1750.43 rows=10257 width=5) > (actual time=49.766..49.766 rows=0 loops=1) > > The bitmap plan was reduced to use only one bitmap scan, and finally it > costs more than the index plan. > Right, so there is a cpu costing problem (which could only be fixed by hacking postgresql and recompiling it), but it is much smaller of a problem than the IO cost not being accurate due to the high hit rate. Fixing the CPU costing problem is unlikely to make a difference to your real query. If you set the page costs to zero, what happens to your real query? > But I doubt that the settings seq_page_cost = random_page_cost = 0.0 > should actually be used. > Why not? If your production server really has everything in memory during normal operation, that is the correct course of action. If you ever restart the server, then you could have some unpleasant time getting it back up to speed again, but pg_prewarm could help with that. > Probably it should be instead something like 1.0/1.0 or 1.0/1.1, but other > costs increased, to have more weight. > This doesn't make any sense to me. Halving the page costs is mathematically the same as doubling all the other constants. But the first way of doing things says what you are doing, and the second way is an obfuscation of what you are doing. > > # x4 tuple/operator costs - bitmap scan still a bit cheaper > set seq_page_cost = 1.0; > set random_page_cost = 1.0; > set cpu_tuple_cost = 0.04; > set cpu_index_tuple_cost = 0.02; > set cpu_operator_cost = 0.01; > If you really want to target the plan with the BitmapAnd, you should increase cpu_index_tuple_cost and/or cpu_operator_cost but not increase cpu_tuple_cost. That is because the unselective bitmap index scan does not incur any cpu_tuple_cost, but does incur index_tuple and operator costs. Unfortunately all other index scans in the system will also be skewed by such a change if you make the change system-wide. Incidentally, the "actual rows" field of BitmapAnd is always zero. That field is not implemented for that node type. Why do you have an index on flag in the first place? What does the index accomplish, other than enticing the planner into bad plans? I don't know how this translates back into your real query, but dropping that index should be considered. Or replace both indexes with one on (num,flag). Or you can re-write the part of the WHERE clause in a way that it can't use an index, something like: and flag::text ='t' Cheers, Jeff