| From: | Greg Stark <gsstark(at)mit(dot)edu> |
|---|---|
| To: | Laurent Laborde <kerdezixe(at)gmail(dot)com> |
| Cc: | PostgreSQL Performance <pgsql-performance(at)postgresql(dot)org> |
| Subject: | Re: Cost of sort/order by not estimated by the query planner |
| Date: | 2009-12-02 12:42:16 |
| Message-ID: | 407d949e0912020442p6802269cgd43f653368379125@mail.gmail.com |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers pgsql-performance |
On Wed, Dec 2, 2009 at 11:13 AM, Laurent Laborde <kerdezixe(at)gmail(dot)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?
--
greg
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Laurent Laborde | 2009-12-02 12:47:16 | Re: Cost of sort/order by not estimated by the query planner |
| Previous Message | Joshua Tolley | 2009-12-02 12:11:56 | Re: PL/Python array support |
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Laurent Laborde | 2009-12-02 12:47:16 | Re: Cost of sort/order by not estimated by the query planner |
| Previous Message | Laurent Laborde | 2009-12-02 11:13:35 | Re: Cost of sort/order by not estimated by the query planner |