This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: CSC 5120 Assignment 3 (Fall 2009) Due Date and Time: 3:00 p.m. 3 Dec, 2009 Question 1: Consider an RTree with maximum node size M=4 and minimum node size m=2. Assume that the database contains the following rectangles: Rectangle Lower Corner Upper Corner 1 (1,1) (4,5) 2 (3,2) (7,4) 3 (6,2) (8,5) 4 (6,7) (8,9) 5 (7,11) (9,13) 6 (8,10) (12,14) 7 (11,12) (14,15) We have stored all the rectangles in the RTree. R1 R2 1 2 3 4 5 6 7 R1 R2 1 2 3 4 5 6 7 Suppose we need to insert the following rectangles into the RTree. Rectangle Lower Corner Upper Corner 8 (1,6) (3,7) 9 (5,10) (7,11) 10 (9,7) (11,9) (a) Insert the following rectangles in the indicated order. What is the resulting RTree at each insertion? 1. Rectangle 8 2. Rectangle 9 3. Rectangle 10 (b) Suppose that we need to insert the rectangles in a different order. What is the resulting RTree at each insertion? 1. Rectangle 10 2. Rectangle 9 3. Rectangle 8 Question 2: KLtransform is employed for subspace clustering in the following work:...
View
Full
Document
This note was uploaded on 04/23/2010 for the course CSC CSC5120 taught by Professor Adafu during the Fall '09 term at CUHK.
 Fall '09
 AdaFu

Click to edit the document details