Re: Remove hacks for old bad qsort() implementations?

Поиск
Список
Период
Сортировка
От Zeugswetter Andreas OSB SD
Тема Re: Remove hacks for old bad qsort() implementations?
Дата
Msg-id E1539E0ED7043848906A8FF995BDA57902DD360B@m0143.s-mxs.net
обсуждение исходный текст
Ответ на Remove hacks for old bad qsort() implementations?  (Tom Lane <tgl@sss.pgh.pa.us>)
Ответы Re: Remove hacks for old bad qsort() implementations?  (Tom Lane <tgl@sss.pgh.pa.us>)
Список pgsql-hackers
> 2. If you've got lots of equal keys, it's conceivable that having the
> index entries sorted by TID offers some advantage in indexscan speed.
> I'm dubious that that's useful, mainly because the planner should
prefer
> a bitmap scan in such a case; and anyway the ordering is unlikely to
> be preserved for long.  But it's something to think about.

How about always adding the TID as last key when using qsort for create
index ?

Andreas


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

Предыдущее
От: Mike Aubury
Дата:
Сообщение: Request for feature - ECPGget_PGconn
Следующее
От: Gregory Stark
Дата:
Сообщение: Re: New style of hash join proposal