Re: patch: improve SLRU replacement algorithm
От | Josh Berkus |
---|---|
Тема | Re: patch: improve SLRU replacement algorithm |
Дата | |
Msg-id | 4F7CD40E.10401@agliodbs.com обсуждение исходный текст |
Ответ на | Re: patch: improve SLRU replacement algorithm (Tom Lane <tgl@sss.pgh.pa.us>) |
Ответы |
Re: patch: improve SLRU replacement algorithm
|
Список | pgsql-hackers |
On 4/4/12 4:02 PM, Tom Lane wrote: > Greg Stark <stark@mit.edu> writes: >> On Wed, Apr 4, 2012 at 9:34 PM, Simon Riggs <simon@2ndquadrant.com> wrote: >>> Why is this pgbench run accessing so much unhinted data that is > 1 >>> million transactions old? Do you believe those numbers? Looks weird. > >> I think this is in the nature of the workload pgbench does. Because >> the updates are uniformly distributed, not concentrated 90% in 10% of >> the buffers like most real-world systems, (and I believe pgbench only >> does index lookups) the second time a tuple is looked at is going to >> average N/2 transactions later where N is the number of tuples. > > That's a good point, and it makes me wonder whether pgbench is the right > test case to be micro-optimizing around. It would be a good idea to at > least compare the numbers for something with more locality of reference. Jignesh, would DVDstore help for this? -- Josh Berkus PostgreSQL Experts Inc. http://pgexperts.com
В списке pgsql-hackers по дате отправления: