Re: Cost of sort/order by not estimated by the query planner
| От | Greg Stark |
|---|---|
| Тема | Re: Cost of sort/order by not estimated by the query planner |
| Дата | |
| Msg-id | 407d949e0912020442p6802269cgd43f653368379125@mail.gmail.com обсуждение исходный текст |
| Ответ на | Re: Cost of sort/order by not estimated by the query planner (Laurent Laborde <kerdezixe@gmail.com>) |
| Ответы |
Re: Cost of sort/order by not estimated by the query planner
|
| Список | pgsql-performance |
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? -- greg
В списке pgsql-performance по дате отправления: