Fatworm 2013:Code Review 2

Progress Check

1. Finish Physical Query Plan (Scan);
2. Finish the whole storage part;
3. Use fatworm-sister to finish at least one basic test case;
4. Finish the B+ tree with integer keys.

Basic Questions

1. How do your format a record into a page?
2. If the length of a record exceeds the size of a single page, how do you deal with it?
3. How can you locate a specified record in your storage?
4. How do you store a record with a field type VARCHAR?
5. When deleting a record, what happens in your storage (Don't consider indexes here)?
6. When a table has indexes, what happens to basic operations like record insertion, deletion, update?
7. You want to do a natural join, say select * from a, b where a.a = b.b, and a has an index on a, as well as b has an index on b. How can these indexes help you to accelerate this natural join operation?
8. How do you deal with a B+ tree with VCHAR keys?
9. How do you construct a B+ tree on a table already with some records in it?
10. You want to do a natural join, say select * from a, b where a.a = b.b, and Table a has an index on a, and b in Table b is int primary key auto_inc. How can you use the index to accelerate this natural join operation?

Advanced Questions

All advanced questions are related with indexes. You should be familiar with features of B+ tree, and the complexity of each kind of operations.