Searching R-tree

Similarly, the searching algorithms (for example; intersection, containment, nearest) use the bounding boxes to decide whether or not to search inside a child node. Here we need to find minimal bounding rectangle (MBR). In this way, most of the nodes in the tree are never ''touched'' during a search.

1. If the node is a leaf node, output the data items whose keys intersect the given query point/region
2. Else, for each child of the current node whose bounding box overlaps the query point/region, recursively search the child

Can be very inefficient in worst case since multiple paths may need to be searched. but works acceptably in practice.