Re: overzealous sorting? - Mailing list pgsql-performance

From anthony.shipman@symstream.com
Subject Re: overzealous sorting?
Date
Msg-id 201109271245.00979.anthony.shipman@symstream.com
Whole thread Raw
In response to Re: overzealous sorting?  (Marc Cousin <cousinmarc@gmail.com>)
Responses Re: overzealous sorting?
List pgsql-performance
On Monday 26 September 2011 19:39, Marc Cousin wrote:
> Because Index Scans are sorted, not Bitmap Index Scans, which builds a
> list of pages to visit, to be then visited by the Bitmap Heap Scan step.
>
> Marc.

Where does this bitmap index scan come from? It seems to negate the advantages
of b-tree indexes described in the section "Indexes and ORDER BY" of the
manual. If I do "set enable_bitmapscan = off;" the query runs a bit faster
although with a larger time range it reverts to a sequential scan.

--
Anthony Shipman                 | Consider the set of blacklists that
Anthony.Shipman@symstream.com   | do not blacklist themselves...

pgsql-performance by date:

Previous
From: Tom Lane
Date:
Subject: Re: Performance Anomaly with "col in (A,B)" vs. "col = A OR col = B" ver. 9.0.3
Next
From: "Maria L. Wilson"
Date:
Subject: postgres constraint triggers