This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Homework 2 CSE 132A Due by noon on Monday, Dec. 8, by sliding under Alins office door. Problem 1 [25pts] Show the B + trees obtained by inserting the following key values in ascending order: 2 , 3 , 5 , 7 , 11 , 17 , 19 , 23 , 29 , 31 . Suppose the maximum number of values per node is 3 (and the minimum is 2). Next, show the B + tree obtained by deleting 23. Problem 2 [20pts] Suppose that a B + tree index on (branch-name, branch- city) is available on relation branch . What would be the best way to handle the following selection? ( branch- city< Brooklyn 00 ) ( assets< 5000) ( branch- name = 00 Downtown 00 ) ( branch ) Problem 3 [25pts] Show how to derive the following equivalences by a se- quence of transformations using only rewrite steps with the rules below (not all rules will be needed, it is up to you to find the appropriate ones). 1 2 ( E ) = 1 ( 2 ( E )) (1) 1 ( 2 ( E )) = 2 ( 1 ( E )) (2) L 1 ( L 2 ( . . .....
View Full Document
This note was uploaded on 12/03/2009 for the course CSE 132A taught by Professor Alindeutsch during the Fall '08 term at UCSD.
- Fall '08