Database Project - Phase II

Due: March 4

Assume that all I/O transactions are done from your secondary storage media in 1Kb blocks. You may also assume that you are using a programming language that allows you to store characters in 1 byte, integers in 1, 2 or 4 bytes, reals in 2, 4 or 8 bytes, and that you can manipulate bits within a byte once retrieved.

1. For all 20 queries given in your Proposal, fill in the following table:

State how often the query is likely to be asked (e.g. every 5 minutes, every hour, or once a week). Give the maximum time that is acceptable for generating the response (e.g. 10 seconds, 1 minute, overnight). Do NOT say things like "rarely" - that is not measureable and has different meanings for different people.

2. Fill in the following table:

Possible values for frequency are once a minute, once a week, once a month, etc. Speed could take values such as 10 seconds, overnight, etc. Do NOT say NEVER.

3. Assume you will have a file for each entity and a file for each relationship. Give me a list of files. For each file give a one sentence description of what it holds. Tell me which MySQL engine you would use to store this file. Estimate the size of the file in terms of the number of records it holds.

4. Pick two of your files and give detailed record structures for those files.

5. For each query give a high-level description of the algorithm to be used to retrieve the data from the files. For this part, forget about tables (I do NOT want to see any relational algebra or SQL!), just give me algorithms for getting what you want from the files.

6. This part is to be done separately by each team member. Justify your choice of MySQL engines in part 3 using the information from parts 1, 2 and 5. Your argument should refer to the order of the algorithms and the size of the files. This is the most important part of this phase! It should NOT be just 2 sentences!!