Re: reducing random_page_cost from 4 to 2 to force index scan

Поиск
Список
Период
Сортировка
От Nathan Boley
Тема Re: reducing random_page_cost from 4 to 2 to force index scan
Дата
Msg-id BANLkTimOEkO55L4g8u7-zyXwTnxFDjhpbA@mail.gmail.com
обсуждение исходный текст
Ответ на Re: reducing random_page_cost from 4 to 2 to force index scan  (Tom Lane <tgl@sss.pgh.pa.us>)
Ответы Re: reducing random_page_cost from 4 to 2 to force index scan  (Tom Lane <tgl@sss.pgh.pa.us>)
Список pgsql-performance
> The accesses to an index are far more likely to be clustered than the
> accesses to the underlying table, because the index is organized in a
> way that's application-meaningful and the table not so much.

So, to clarify, are you saying that if query were actually requesting
rows uniformly random, then there would be no reason to suspect that
index accesses would have hotspots? It seems like the index structure
( ie, the top node in b-trees ) could also get in the way.

Best,
Nathan

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

Предыдущее
От: Jeff
Дата:
Сообщение: Re: Using pgiosim realistically
Следующее
От: Tom Lane
Дата:
Сообщение: Re: reducing random_page_cost from 4 to 2 to force index scan