Re: per table random-page-cost?
От | Jeff Davis |
---|---|
Тема | Re: per table random-page-cost? |
Дата | |
Msg-id | 1255998860.31947.189.camel@monkey-cat.sm.truviso.com обсуждение исходный текст |
Ответ на | Re: per table random-page-cost? (Greg Stark <gsstark@mit.edu>) |
Список | pgsql-hackers |
On Mon, 2009-10-19 at 16:39 -0700, Greg Stark wrote: > But the long-term strategy here I think is to actually have some way > to measure the real cache hit rate on a per-table basis. Whether it's > by timing i/o operations, programmatic access to dtrace, or some other > kind of os interface, if we could know the real cache hit rate it > would be very helpful. Maybe it would be simpler to just get the high-order bit: is this table likely to be completely in cache (shared buffers or os buffer cache), or not? The lower cache hit ratios are uninteresting: the performance difference between 1% and 50% is only a factor of two. The higher cache hit ratios that are lower than "almost 100%" seem unlikely: what kind of scenario would involve a stable 90% cache hit ratio for a table? Regards,Jeff Davis
В списке pgsql-hackers по дате отправления: