Chapter 24, Problem 4PE

Explanation of Solution

Search algorithm on an R-Tree:

The nearest neighbour search algorithm using R-tree is as follows:

• The algorithm uses an ordered depth first traversal.
• The depth traversal begins with the R-tree root node and proceeds down the tree.
• The original guess for the neighbour distance is infinity. It may be called Nearest.
• During the descending phase, at each newly visited non-leaf node, the algorithm calculates the ordering metric compounds for all its Minimum-Bounding Regions and then they are sorted into an Active Branch List (ABL).
• Then pruning strategies is applied to the ABL for removing unnecessary branches.
• The algorithm will iterate on this ABL until the ABL is empty.
• For every iteration, the next branch is selected in the list and it is applied recursively to the node corresponding to the Minimum-Bounding Region of this branch...