HW3AU06 - CSE 671- Databases II Homework #3 ( /50) Due:...

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

View Full Document Right Arrow Icon
CSE 671- Databases II Homework #3 ( /50) Due: 10/24/06 - Before Class Question 1- ( / 16) You are given an R-tree with the following rectangles. Assume the capacity of a node for this tree is 4. Rectangles Coordinates 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) The R-tree for this database is given below: G1 G2 1,2,3,4 5,6,7 Using the heuristics for insertion and node-split given in class, insert the following rectangles into the R-tree. Draw the resulting tree after each insertion and show your computations. Rectangles Coordinates 8 (6,3) – (9,6) 9 (4,10) – (6,13) Hint: First decide the group you should insert the rectangle so that the covered area is
Background image of page 1

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

View Full DocumentRight Arrow Icon
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 2

HW3AU06 - CSE 671- Databases II Homework #3 ( /50) Due:...

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

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