CSCE 4350 Database Design
Assigment 3 
Total: 80 points
Issued: 10/23/2007
Due: 11/08/2007
................................


1. (40 points) A PART table with Part# as search key field includes records 
with the following Part# values: 23,65,37,60,46,92,48,71,56,59,18,
21,10,74,78,15,16,20,24,28. Suppose that the search field 
values are inserted in the given order.

	1. Build a sparse primary index for the PART table on Part# assuming each block can hold up-to 4 
           key-pointer pairs and each block can hold 2 records from the PART table.

	2. Build a B+ tree (secondary) for the PART table with n = 6 pointers; show how the B+ tree expand 
           (show several intermediate trees) and what the final tree will look like.

 
2. (40 points) Follow the following link for this question:
http://www.cse.unt.edu/~huangyan/4350/Labs/demo/GPS/indexDemo.htm

Submission instructions: 
   - Submit a hardcopy including answers to problems 1
   - Follow the submission instructions given in problem 2