Re: [HACKERS] memory layouts for binary search in nbtree

Поиск
Список
Период
Сортировка
От Peter Geoghegan
Тема Re: [HACKERS] memory layouts for binary search in nbtree
Дата
Msg-id CAH2-WzmkQtyzBQdP6=mCRj98rEF2AfmxrXp9DRdccfiUt+L0qg@mail.gmail.com
обсуждение исходный текст
Ответ на Re: [HACKERS] memory layouts for binary search in nbtree  (Andres Freund <andres@anarazel.de>)
Список pgsql-hackers
On Tue, Jun 27, 2017 at 11:05 AM, Andres Freund <andres@anarazel.de> wrote:
>> Did you ever try running a pgbench SELECT benchmark, having modified
>> things such that all PKs are on columns that are not of type
>> int4/int8, but rather are of type numeric? It's an interesting
>> experiment, that I've been meaning to re-run on a big box.
>
>> Obviously this will be slower than an equivalent plain pgbench SELECT,
>> but the difference may be smaller than you expect.
>
> I'm not sure what that has to do with the topic?

It suggests that cache misses are much more important than anything
else. Even with collated text, the difference is not so large IIRC.
Though, it was noticeably larger.

-- 
Peter Geoghegan



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

Предыдущее
От: Peter Geoghegan
Дата:
Сообщение: Re: [HACKERS] memory layouts for binary search in nbtree
Следующее
От: Andres Freund
Дата:
Сообщение: Re: [HACKERS] Fast promotion not used when doing a recovery_targetPITR restore?