Chapter 24, Problem 5PE

Explanation of Solution

Conditions for the recursive procedure:

• Every recursive procedure must have a valid terminating base condition.
• In the side function, if again we are calling the same procedure, in such cases we need to use the same procedure.

Recursive procedure:

The following is the recursive procedure for computing spatial join two R-join:

SpJoin(node n₁, node n₂)

begin

    if(the bounding boxes of n₁ and n₂ do not intersect)

        return;

    if(both n₁ and n₂ are leaves)

        output all pairs of entries(e₁, e₂) such that

        e₁ ϵ n₁ and e