There is a lot of overhead in maintaining the tree structure. The overhead varies with
the type of data stored, and if you have a lot of small key/value pairs then the overhead
increases quite significantly. This is one of the motivations for starting the Infinispan
[1] project.
One thing you could do is if you are using pessimistic locking, switch to MVCC which
reduces the number of locks created and hence memory overhead.
[1]
http://www.infinispan.org
View the original post :
http://www.jboss.org/index.html?module=bb&op=viewtopic&p=4228891#...
Reply to the post :
http://www.jboss.org/index.html?module=bb&op=posting&mode=reply&a...