Question

I want to cache data on the client. What is the best algorithm/data structure that can be employed?

Case 1. The data to be stored requires extremely fast string searching capability.
Case 2. The cached data set can be large. I don’t want to explode the client’s memory usage and also I don’t want to make a network and disk access calls which slows down my processing time on the client side

Solutions:

Case 1: I think suffix tree/Tries provides you with a good solution in this case.

Case 2: The two problems to consider here are:

1. To store large data with minimum memory consumption
2. Not to make any network calls to access any data which is not available in the cache.
   LRU caching model is one solution I can think of but that does not prevent me from bloating the memory.

Is there any way to write down to a file and access without compromising the data (security aspect)?

Let me know if any point is not clear.

EDIT:
Josh, I know my requirements are non-realistic. To narrow down my requirement, I am looking for something which stores using LRU algorithm. It will be good if we can have dynamic size configuration for this LRU with a maximum limit to it. This will reduce the number of calls going to the network/database and provide a good performance as well.

If this LRU algorithm works on a compressed data which can be interpreted with a slight overhead (but less than a network call), it will be much better.

Answer 1

Check out all the available caching frameworks/libraries – I’ve found Ehcache to be very useful. You can also have it keep just some (most recent) in memory and failover to disk at a specified memory usage. The disk calls will still be a lot faster then network calls and you avoid taking all the memory.

Ehcache