1 Reply Latest reply on Jul 25, 2005 8:40 PM by ben.wang

    some clarification on LRUeviction policy

    gagan goel Newbie

      I found the following behaviour of the LRUeviction policy

      1) If the node being evicted is a leaf node, whole node is removed.
      2) If the node being evicted is a internal node, only the data inside the node is removed. All the childrens of that node remain intact in the tree cache.

      Am I right ? or does removal of internal node removes the whole subtree ?

      If (2) is correct... then If my application has lots of nodes, then Is there any way to make sure that, at any time, number of nodes (with and without data) in the tree cache is bounded by some pre-configured number ?