Re: bitmap scans, btree scans, and tid order

Поиск
Список
Период
Сортировка
От Jeffrey Baker
Тема Re: bitmap scans, btree scans, and tid order
Дата
Msg-id 42883A5B.10901@acm.org
обсуждение исходный текст
Ответ на Re: bitmap scans, btree scans, and tid order  (Tom Lane <tgl@sss.pgh.pa.us>)
Ответы Re: bitmap scans, btree scans, and tid order  (Neil Conway <neilc@samurai.com>)
Список pgsql-hackers
Tom Lane wrote:
> "Jeffrey W. Baker" <jwbaker@acm.org> writes:
> 
>>I see that Tom has already done the infrastructure work by adding
>>getmulti, but getmulti isn't used by nodeIndexscan.c, only
>>nodeBitmapIndexscan.c.  Will btree index scans be executed by creating
>>in-memory bitmaps in 8.1, or will some scans still be executed the usual
>>way?
> 
> 
> We aren't going to remove the existing indexscan behavior, because
> bitmap scans lose the ordering of the underlying index.  There are many
> situations where that ordering is important.  (See for instance the
> recent changes to make MAX/MIN use that behavior.)

Would you take a patch that retained the optimized executions of plans 
returning 1 tuple and also fixed the random heap problem?

-jwb


В списке pgsql-hackers по дате отправления:

Предыдущее
От: Tom Lane
Дата:
Сообщение: Re: bitmap scans, btree scans, and tid order
Следующее
От: Neil Conway
Дата:
Сообщение: Re: bitmap scans, btree scans, and tid order