I want to cache a lot of objects of the same type (currently 250,000, probably approaching a million in a year or two). As I understand the way treecache works, if there are any changes on a given node, the entire contents of the node are replicated. If that's true, I probably need to distribute my objects around the tree so that smaller batches are replicated with every update.
So I was thinking about using the key of each object to contruct a more unique cache region. Say if the object's key was "seattle", I'd store it in the cache region /s/e/a/t or /s/e/a/t/t/l/e or something. The question: With TreeCache, is it more efficient to have a really deep tree with very few objects on each node, or a flatter tree with more objects on each node, and what are the tradeoffs? M. View the original post : http://www.jboss.org/index.html?module=bb&op=viewtopic&p=3885518#3885518 Reply to the post : http://www.jboss.org/index.html?module=bb&op=posting&mode=reply&p=3885518 ------------------------------------------------------- SF.Net email is sponsored by: Discover Easy Linux Migration Strategies from IBM. Find simple to follow Roadmaps, straightforward articles, informative Webcasts and more! Get everything you need to get up to speed, fast. http://ads.osdn.com/?ad_id=7477&alloc_id=16492&op=click _______________________________________________ JBoss-user mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/jboss-user
