Comments on: A Simple LRU Cache in 5 lines http://www.khanspot.com/2006/11/27/a-simple-lru-cache-in-5-lines/ Computers are useless. They can only give you answers. Tue, 06 Jan 2009 20:33:34 +0000 http://wordpress.org/?v=2.6.3 By: Open Source and Caching Algorithms - Zarang : Engineer! http://www.khanspot.com/2006/11/27/a-simple-lru-cache-in-5-lines/#comment-1186 Open Source and Caching Algorithms - Zarang : Engineer! Mon, 28 Jan 2008 12:16:18 +0000 http://www.khanspot.com/2006/11/27/a-simple-lru-cache-in-5-lines/#comment-1186 [...] Least Recently Used (LRU) - the items that haven’t been accessed the longest get the boot first. This is implemented by keeping a timestamp for all items in the cache. Check out this simple LRU implementation. [...] [...] Least Recently Used (LRU) - the items that haven’t been accessed the longest get the boot first. This is implemented by keeping a timestamp for all items in the cache. Check out this simple LRU implementation. [...]

]]> By: A Noted Path - Personal blog of Theodore Nguyen-Cao — Where inspiration meets aspiration » Blog Archive » Open Source and Caching Algorithms http://www.khanspot.com/2006/11/27/a-simple-lru-cache-in-5-lines/#comment-1184 A Noted Path - Personal blog of Theodore Nguyen-Cao — Where inspiration meets aspiration » Blog Archive » Open Source and Caching Algorithms Mon, 28 Jan 2008 04:34:42 +0000 http://www.khanspot.com/2006/11/27/a-simple-lru-cache-in-5-lines/#comment-1184 [...] Least Recently Used (LRU) - the items that haven’t been accessed the longest get the boot first. This is implemented by keeping a timestamp for all items in the cache. Check out this simple LRU implementation. [...] [...] Least Recently Used (LRU) - the items that haven’t been accessed the longest get the boot first. This is implemented by keeping a timestamp for all items in the cache. Check out this simple LRU implementation. [...]

]]> By: madhavi latha http://www.khanspot.com/2006/11/27/a-simple-lru-cache-in-5-lines/#comment-1177 madhavi latha Fri, 25 Jan 2008 21:36:18 +0000 http://www.khanspot.com/2006/11/27/a-simple-lru-cache-in-5-lines/#comment-1177 Hi! I would like to cache the data which is not often changed.may be once in a day i would like to refresh the cache.I need a simple caching example which I am planning to implement only for read operation.i.e select statement.I am using prepared statement and from there I have ResultSet.Can you please give me an example for putting all the data into cache.I am using JDBC.Please give me the detailed explanation of how to set the time of cache and how to get the data from cache and also how to examine whether the data is stale.Thank you very much in advance. Hi!

I would like to cache the data which is not often changed.may be once in a day i would like to refresh the cache.I need a simple caching example which I am planning to implement only for read operation.i.e select statement.I am using prepared statement and from there I have ResultSet.Can you please give me an example for putting all the data into cache.I am using JDBC.Please give me the detailed explanation of how to set the time of cache and how to get the data from cache and also how to examine whether the data is stale.Thank you very much in advance.

]]> By: Atif Khan http://www.khanspot.com/2006/11/27/a-simple-lru-cache-in-5-lines/#comment-217 Atif Khan Fri, 13 Apr 2007 22:10:18 +0000 http://www.khanspot.com/2006/11/27/a-simple-lru-cache-in-5-lines/#comment-217 Arpan, I think the example in my post should work for you. Could you explain what you need a little more? If all you want to do is to see if an object of a particular class type is not created, then create a new one and otherwise return from cache, then you can use the class name as the key and object as the value. Arpan,
I think the example in my post should work for you. Could you explain what you need a little more? If all you want to do is to see if an object of a particular class type is not created, then create a new one and otherwise return from cache, then you can use the class name as the key and object as the value.

]]> By: Arpan http://www.khanspot.com/2006/11/27/a-simple-lru-cache-in-5-lines/#comment-215 Arpan Fri, 13 Apr 2007 06:33:07 +0000 http://www.khanspot.com/2006/11/27/a-simple-lru-cache-in-5-lines/#comment-215 Nice one Can you help me I have similar kind of question. 1. I want to create a cache memory. If i have a class and its object is already existing then When i want to create a new instance it should not create it. It should return me from cache. It is to be implemented using hasmp. Nice one Can you help me I have similar kind of question.

1. I want to create a cache memory. If i have a class and its object is already existing then When i want to create a new instance it should not create it. It should return me from cache. It is to be implemented using hasmp.

]]>