3. Range Queries Over M-Tree, prove the pruning strategy for the range query below (Hint: use...

  

Transcribed Image Text:

3. Range Queries Over M-Tree, prove the pruning strategy for the range query below (Hint: use the triangle inequality) [30 points]: If d(Op, Q)-d(Or, Op)>r(Q)+r(Or), then d(Or, Q)> r(Q) +r(Or) holds and node centered at O, with radius r(Or) can be safely pruned. J(Op.Q) Op d(Or.Op) r(Q) Or r(Or d(Or.Op) Op d(Op.Q) 3. Range Queries Over M-Tree, prove the pruning strategy for the range query below (Hint: use the triangle inequality) [30 points]: If d(Op, Q)-d(Or, Op)>r(Q)+r(Or), then d(Or, Q)> r(Q) +r(Or) holds and node centered at O, with radius r(Or) can be safely pruned. J(Op.Q) Op d(Or.Op) r(Q) Or r(Or d(Or.Op) Op d(Op.Q)