Requirement
代写Database Management System的作业，和Database System这门课不一样，前者主要是编写一个数据库系统(C/C++/Java/Python实现)，而后者主要是使用一个数据库系统(SQL语言)。
这次作业由于是第一次，偏基础，主要是一些理论的东西，以及写一个B+树，难度不大。
Question 1
Briefly describe (in your own words) each of the 7 RAID level, including one improvement that each RAID level makes over the previous levels.
Question 2
- Briefly describe one advantage and disadvantage of using fixed-length records in a file
- Briefly describe one advantage and disadvantage of using variable-length records in a file
Question 3
Construct a B+-tree for the following set of key values. Assume that a node size of 4 pointers (i.e. 3 keys) is used. (If you want to be considered for part marks in the even of a mistake, you should show some of the intermediate steps).
8,11,13,15,19,24,31,35,39
Question 4
Starting with the resulting B+-tree created from Question 3, show the resulting B+-tree after each of the following operations are performed.
- Insert 17
- Insert 18
- Insert 16
- Delete 31
- Delete 24
Question 5
Construct an extendible Hashing Structure for the following set of key values. Assume that a bucket size of 3 entries, and the hashing function h(x) = x mod 8, are used. (If you want to be considered for part marks in the event of a mistake, you should show some of the intermediate steps).
8,11,13,15,19,24,31,35,39
Question 6
Starting with the resulting extendible hashing structure from Question 5, show the resulting structure after each of the following operations are performed.
- Delete 19
- Delete 39
- Insert 9
- Insert 28
Summary
这次作业前面两个问题主要涉及理论，后面四个问主要涉及B+树的编写。