algorithm - R+-Tree explanation required -
1) came across picture (see below) shows example of r+-tree data in it. how possible there space between nodes "a" , "b"? understood, new nodes created splitting procedure, must share border between them, result of applying "splitting plane". can think picture result of complex series of adding-deleting-rebuilding operations...
2) lets suppose have r+-tree composed of nodes "a" , "b" (see picture 2) , trying insert green rectangle g in r+-tree. g hits "a" , "b" nodes (so must added in both). how "a" , "b" nodes must expanded? (g must entirely covered nodes).
this figure bad.
r-tree uses minimum bounding boxes represent data. therefore, boxes must tight, , complete; otherwise search inefficient or incorrect.
Comments
Post a Comment