Class BTreeManager

  • All Implemented Interfaces:

    public class BTreeManager
    extends java.lang.Object
    implements TreeManager
    This TreeManager implementation provides B+-tree like behavior. That is items of a sequence (i.e. NodeSequence or PropertySequence) are mapped to a sub-tree in JCR in a way such that only leave nodes carry actual values, the sub-tree is always balanced and ordered. This implementation does in contrast to a full B+-tree implementation not join nodes after deletions. This does not affect the order of items and also leaves the tree balanced wrt. its depths. It might however result in a sparse tree. That is, the tree might get unbalanced wrt. its weights.

    The nodes in the JCR sub tree are arranged such that any node named x only contains child nodes with names greater or equal to x. The implementation keeps the child nodes in the sub tree ordered if the respective node type supports ordering of child nodes. Ordering is always wrt. to a Comparator on the respective keys. For lexical order this arrangement corresponds to how words are arranged in a multi volume encyclopedia.

    Example usage:

     // Create a new TreeManager instance rooted at node. Splitting of nodes takes place
     // when the number of children of a node exceeds 40 and is done such that each new
     // node has at least 40 child nodes. The keys are ordered according to the natural
     // order of java.lang.String.
     TreeManager treeManager = new BTreeManager(node, 20, 40, Rank.<String>comparableComparator(), true);
     // Create a new NodeSequence with that tree manager
     NodeSequence nodes = ItemSequence.createNodeSequence(treeManager);
     // Add nodes with key "jcr" and "day"
     nodes.addNode("jcr", NodeType.NT_UNSTRUCTURED);
     nodes.addNode("day", NodeType.NT_UNSTRUCTURED);
     // Iterate over the node in the sequence.
     // Prints "day jcr "
     for (Node n : nodes) {
         System.out.print(n.getName() + " ");
     // Retrieve node with key "jcr"
     Node n = nodes.getItem("jcr");
     // Remove node with key "day"
    • Constructor Summary

      Constructor Description
      BTreeManager​(Node root, int minChildren, int maxChildren, java.util.Comparator<java.lang.String> order, boolean autoSave)
      Create a new BTreeManager rooted at Node root.
    • Method Summary

      All Methods Instance Methods Concrete Methods 
      Modifier and Type Method Description
      boolean getAutoSave()
      Whether to automatically save changes of the current session occurring from adding/removing nodes and properties.
      java.util.Set<java.lang.String> getIgnoredProperties()
      Properties to ignore.
      java.util.Comparator<java.lang.String> getOrder()
      Comparator used for establishing the order of the keys in the sequence.
      Node getRoot()  
      boolean isLeaf​(Node node)
      Returns !node.hasNodes()
      boolean isRoot​(Node node)
      Determined whether the given node is the root node of the JCR sub-tree.
      void join​(ItemSequence itemSequence, Node node, Node cause)
      This implementation does not actually join any nodes.
      void join​(ItemSequence itemSequence, Node node, Property cause)
      This implementation does not actually join any nodes.
      void split​(ItemSequence itemSequence, Node node, Node cause)
      This implementations splits node when its number of child nodes exceeds the maximum number specified in the constructor.
      void split​(ItemSequence itemSequence, Node node, Property cause)
      This implementations splits node when its number of properties exceeds the maximum number specified in the constructor.
      • Methods inherited from class java.lang.Object

        equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait