Reference no: EM132410631
Assignment -
Design a database for storing information about a conference organization, including event, venue, chairs, reviewers, authors, papers (using sqlite3):
1. Draw its E-R diagram.
2. Give a relational representation of the E-R diagram that allows for 2 functional preserving and lossless join decompositions (i.e., first version not yet optimized and fully decomposed). Describe its functional dependencies.
3. Give the two decompositions you select for further steps, and prove that they are lossless join and functional preserving.
4. Give the sqlite3 SQL DDLs for creating the three versions of the database (original and 2 decompositions).
5. Fill the first version of the database with data (at least 100 rows in each table).
6. Give the SQL queries to copy the data from the first version into its 2 decompositions.
7. Propose in english 3 queries that require at least 2 table joins each and such that all tables are involved in at least 2 queries.
8. Propose SQL implementations of the 3 queries on all three versions of the database.
9. Test the time in ns for executing the 3 queries on each database, by running each of them 1000 times.
Submit the databases populated with data, a file for each ddl (d.ddl, d1.ddl, d2.ddl), and a report with a separate section for which of the above points.
Note - At question 2 you were requested to show a "relational representation of the E-R diagram"), but your report might only show a "relational schema". At question 3, the proof given by some of in your report for functional preservation is not following the algorithm in slides for "checking preservation", but is simply computing a union of attributes, which does not prove it. At question 6, some do not give the SQL queries for all transfers between the 3 versions.