See below links. Most of web applications(facebook,classmates) use memcached to speed up their sites. memcached uses hashing.
http://memcached.org/ http://www.facebook.com/note.php?note_id=39391378919 <http://memcached.org/>http://en.wikipedia.org/wiki/Memcached ......... Satya On Fri, Jul 2, 2010 at 11:46 PM, sharad <[email protected]> wrote: > [1] Design a layer in front of a system which cache the last n > requests and the responses to them from the system. > what data structure would you use to implement the cache in the later > to support following operations. > [a] When a request comes look it up in the cache and if it hits then > return the response from here and do not pass the request to the > system > [b] If the request is not found in the cache then pass it on to the > system > [c] Since cache can only store the last n requests, Insert the n+1th > request in the cache and delete one of the older requests from the > cache > The objective is to achieve all the three operations in O(1). > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]<algogeeks%[email protected]> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
