Re: Cost of sort/order by not estimated by the query planner

On Wed, Dec 2, 2009 at 1:42 PM, Greg Stark <gsstark@mit.edu> wrote:
> On Wed, Dec 2, 2009 at 11:13 AM, Laurent Laborde <kerdezixe@gmail.com> wrote:
>>>                                             QUERY PLAN
>>> -----------------------------------------------------------------------------------------------------
>>>  Limit  (cost=66114.13..66115.38 rows=500 width=1114)
>>>   ->  Sort  (cost=66114.13..66157.37 rows=17296 width=1114)
>>>         Sort Key: id
>>>         ->  Bitmap Heap Scan on _article  (cost=138.32..65252.29
>>> rows=17296 width=1114)
>>>               Recheck Cond: (bitfield && B'1'::bit varying)
>>>               ->  Bitmap Index Scan on idx_article_bitfield
>>> (cost=0.00..134.00 rows=17296 width=0)
>>>                     Index Cond: (bitfield && B'1'::bit varying)
>
>
> Uhm, what kind of index is idx_article_bitfield?

Mmm, i forgot about that ! It's in a GIN index.
"idx_article_bitfield" gin (bitfield), tablespace "indexspace"


--
Laurent "ker2x" Laborde
Sysadmin & DBA at http://www.over-blog.com/