An improved R-tree based on childnode's probability

R-Tree is a good structure for spatial searching. But in this indexing structure，either the sequence of nodes in the same level or sequence of traveling these nodes when queries are made is random. Since the possibility that the object appears in different MBR which have the same parents node is different，if we make the subnode who has the most possibility be traveled first，the time cost will be decreased in most of the cases. In some case，the possibility of a point belong to a rectangle will shows direct proportion with the size of the rectangle. But this conclusion is based on an assumption that the objects are symmetrically distributing in the area and this assumption is not always coming into existence. Now we found a more direct parameter to scale the possibility and made a little change on te structure of R-tree，to increase te possibility of founding te satisfying answer in the front sub trees. We names this structure probability based arranged R-tree (PBAR-tree).

An improved R-tree based on childnode's probability