Re: Progress on fast path sorting, btree index creation time
| От | Robert Haas |
|---|---|
| Тема | Re: Progress on fast path sorting, btree index creation time |
| Дата | |
| Msg-id | CA+TgmoYzA82HsT_+EYtPACx5vyLK+fB4fVaD3ykiE4TPoYTwiQ@mail.gmail.com обсуждение исходный текст |
| Ответ на | Re: Progress on fast path sorting, btree index creation time (Tom Lane <tgl@sss.pgh.pa.us>) |
| Ответы |
Re: Progress on fast path sorting, btree index creation
time
Re: Progress on fast path sorting, btree index creation time |
| Список | pgsql-hackers |
On Wed, Feb 8, 2012 at 9:51 AM, Tom Lane <tgl@sss.pgh.pa.us> wrote: > IMO this patch is already well past the point of diminishing returns in > value-per-byte-added. I'd like to see it trimmed back to provide a fast > path for just single-column int4/int8/float4/float8 sorts. The other > cases aren't going to offer enough of a win to justify the code space. I'm curious about how much we're gaining from the single-column specializations vs. the type-specific specializations. I think I'm going to go try to characterize that. -- Robert Haas EnterpriseDB: http://www.enterprisedb.com The Enterprise PostgreSQL Company
В списке pgsql-hackers по дате отправления: