Package org.tinspin.index.rtree
Class RStarTreeLogic
- java.lang.Object
-
- org.tinspin.index.rtree.RStarTreeLogic
-
- All Implemented Interfaces:
RTreeLogic
public class RStarTreeLogic extends Object implements RTreeLogic
-
-
Constructor Summary
Constructors Constructor Description RStarTreeLogic()
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description <T> org.tinspin.index.rtree.RTreeNode<T>chooseSubTree(org.tinspin.index.rtree.RTreeNode<T> root, RTreeEntry<T> e, int desiredInsertionLevel, int nLevels)Choose subtree as described in the paper.<T> booleanhasSpace(org.tinspin.index.rtree.RTreeNode<T> node)<T> RTreeEntry<T>[]reInsert(org.tinspin.index.rtree.RTreeNode<T> node, RTreeEntry<T> e)<T> org.tinspin.index.rtree.RTreeNode<T>split(org.tinspin.index.rtree.RTreeNode<T> node, RTreeEntry<T> e)Choose subtree as described in the paper.
-
-
-
Method Detail
-
chooseSubTree
public <T> org.tinspin.index.rtree.RTreeNode<T> chooseSubTree(org.tinspin.index.rtree.RTreeNode<T> root, RTreeEntry<T> e, int desiredInsertionLevel, int nLevels)Choose subtree as described in the paper.- Specified by:
chooseSubTreein interfaceRTreeLogic
-
split
public <T> org.tinspin.index.rtree.RTreeNode<T> split(org.tinspin.index.rtree.RTreeNode<T> node, RTreeEntry<T> e)Choose subtree as described in the paper. According to paper the function a) returns (param) a sorted array of BB sorted for splitting b) returns (ret) the split dimension c)- Specified by:
splitin interfaceRTreeLogic
-
reInsert
public <T> RTreeEntry<T>[] reInsert(org.tinspin.index.rtree.RTreeNode<T> node, RTreeEntry<T> e)
- Specified by:
reInsertin interfaceRTreeLogic
-
hasSpace
public <T> boolean hasSpace(org.tinspin.index.rtree.RTreeNode<T> node)
- Specified by:
hasSpacein interfaceRTreeLogic
-
-