Reference no: EM132241848
Database Assignment -
E-R Diagram from Database System Concepts.
Step 1: Constructing an E-R diagram
Construct an E-R diagram for the database for a clandestine spy organization that has the following characteristics
- The organization has many spies working for them. Each spy has one or more identities that can be either activated or deactivated (For example, he can be a Mr. Jones from Arizona, or Dr. Leffski from Israel).
- Organization includes upper management group, where each of the members supervises up to several operations and/or plans a more general spy tasks.
- Each spy identity is a part of one or more spy tasks.
- Each spy task has a general goal and can have several operations associated with it. (Think of a spy task as a long term plan, whereas operations have short objectives within that plan)
- Each operation, in other words has a smaller goal, time frame, location and a coordinator from the upper management.
- Each spy also has a handler, who, in turn, reports to the members of the upper management responsible for that spy's current task.
- Each spy has a code name, set of skills (e.g. electronic surveillance, weapons, etc), set of languages he/she speaks, and so on.
- Each spy identity comes with its own name, birthday, language, appearance, and so on.
- Each spy identity may also have some secrete means of communication with his/her handler, which can be identified by location, method of communication, and password.
You should turn in the following:
- List of Entities, each with its attributes and primary keys underlined. Give also a brief description of the entity and what it represents.
- List of Relationships and entities it relates. Include brief descriptions as well: which entities it relates, and what type it is (one-to-one, one-to-many, and so on).
- Additional assumptions that you are making when designing the database.
- An actual E-R diagram but without attributes (since they are listed above). In other aspects, the diagrams should follow the style described in our book. Make sure to specify the cardinality constraints and participations (total or partial). Weak entities (if exist)should also we marked correctly.
Step 2: Reduce your E-R diagram to Relational Schemas
2.1 - Use our book's (Database System Concepts Sixth Edition, Silberschatz Korth, Sudarshan ) Chapter 7 to summarize the algorithms to reduce E-R diagrams to a set of relational schemas. Fit it on one page and be as concrete as possible. (Graduate students also need to explain how to reduce ISA relationship with its entities to tables as well).
2.2 - Following the algorithms outlined in your question 2.1, reduce your E-R diagram to a set of appropriate relational schemas.
2.3 - You will need to specify schemas for all your tables, with all attributes. Underline the primary keys, and list the foreign keys after each schema.
Step 3: Questions
3.1 - List all functional dependencies satisfied by the following relation:
X
|
Y
|
Z
|
x1
|
y1
|
z1
|
x1
|
y1
|
z2
|
x2
|
y1
|
z1
|
x2
|
y1
|
z3
|
3.2 - Compute the closure of the following set F of functional dependencies for relation schema R = (A, B, C, D, E).
AB → C
CD → E
DE → B
Also, list the candidate keys for R,.
3.3 - Give a lossless-join, decomposition into BCNF of the schema R= (A, B, C, D, E) with the same set functional dependencies F as in 3.2. Use algorithm 8.11 from our book. Is your decomposition dependency preserving?