Hi,
So looking at the plans, essentially the only part that is different is
the scan node at the very bottom - in one case it's a sequential scan,
in the other case (the slow one) it's the bitmap index scan.
Essentially it's this:
-> Seq Scan on lineitem
(cost=0.00..2624738.17 ...)
2017-08-25 5:31 GMT-03:00 Neto pr :
> Dear all
>
> Someone help me analyze the execution plans below, is the query 12 of
> TPC-H benchmark [1].
> I need to find out why the query without index runs faster (7 times)
> than with index, although the costs are smaller (see table).
> I have other cases
