hw3 - CSC 5120 Assignment 3 (Fall 2009) Due Date and Time:...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the 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 R-Tree 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 R-Tree. 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 R-Tree. 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 R-Tree 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 R-Tree at each insertion? 1. Rectangle 10 2. Rectangle 9 3. Rectangle 8 Question 2: KL-transform is employed for subspace clustering in the following work:...
View Full Document

Page1 / 4

hw3 - CSC 5120 Assignment 3 (Fall 2009) Due Date and Time:...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online