From: | Yutaka tanida <yutaka(at)nonsensecorner(dot)com> |
---|---|
To: | xoror(at)infuse(dot)org |
Cc: | pgsql-hackers(at)postgresql(dot)org |
Subject: | Re: lru cache replacement |
Date: | 2003-06-24 12:23:10 |
Message-ID: | 20030624211436.91C1.YUTAKA@nonsensecorner.com |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-hackers |
xoror,
On Tue, 24 Jun 2003 12:13:51 +0200 (MEST)
xoror(at)infuse(dot)org wrote:
> I was researching on cache replacement strategy as well. 2Q has one
> disadvantage see this exellent paper:
> http://www.almaden.ibm.com/cs/people/dmodha/#ARC see the paper
> "ARC: A Self-Tuning, Low Overhead Replacement Cache" for theory and "One
> Up on LRU" for implementation details. ARC requires no tuning and can
> switch fast between chaging patterns. Best of all is it is resistant to a
> "sequential scan" pattern. and i think it's even easier to implement then
> 2q :)
Thanks for your information. I check the paper and implement it by Java for
testing.
> does pgbench test with relatively large sequential scans?
Probably no.
--
Yutaka tanida <yutaka(at)nonsensecorner(dot)com>
http://www.nonsensecorner.com/
From | Date | Subject | |
---|---|---|---|
Next Message | Srikanth M | 2003-06-24 12:34:52 | How to use pset command in my program!! |
Previous Message | Jason Tishler | 2003-06-24 12:12:30 | Re: [HACKERS] ss_family in hba.c |