Talk:R+ tree

From Wikipedia, the free encyclopedia
Jump to: navigation, search
WikiProject Computing  
WikiProject icon This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
 ???  This article has not yet received a rating on the project's quality scale.
 ???  This article has not yet received a rating on the project's importance scale.
 

R+ trees differ from R trees in that:

* Nodes are not guaranteed to be at least half filled

Is it really the case for the R-Trees? The only assumption on R-Trees' leaves count is that it stays between m (min) and M (MAX) and that m<=(M/2).