Hi all, I'm a Google SoC student working on creating a CacheManager with a better cache replacement algorithm. After talking with my mentor (Oystein Grovlen), I have created a bunch of small prototypes to evaluate different algorithms found in literature.
I have run them for a Zipf workload for 0.5 and 0.8 and posted the results on the Derby Wiki. Link: http://wiki.apache.org/db-derby/DerbyLruCacheManager The results show that the 2Q, CAR, and CART algorithms perform better than LRU and Clock. I would like to get some feedback on my results to help me decide what I should implement in Derby. Thanks, Gokul
