SDB101 » Object: Rtree
 
  • Properties of R-trees
    • Balanced
    • Nodes are rectangle
      • child’s rectangle within parent’s
      • possible overlap among rectangles!
  • Implementation of find operation
    • Search root to identify relevant children
    • Search selected children recursively
  • Ex.: find record for rectangle 5
    • Root search identifies child x
    • Search of x identifies children b and c
    • Search of b does not find object 5
    • Search of c find object 5
rtree1

RTree 2



rtree3

Última modificación: Thursday, 24 de November de 2005, 15:28