Analysis of relational schemas and normalization Consider the following conceptual schema of a sample database domain that contains information about users, the type of users and the user's account of an application. (i) (ii) name address preferences [0..*] (iii) (iv) USER DOB tel [0..*] email [0..*] NON-REGISTERED 1988 ID ID ID creates UserType * REGISTERED regDate benefit [0..*] USERACCOUNT userName password The following are partially completed collection of relational schemas. USER(name, address, DOB, tel[0..*], email[0..*]) USERACCOUNT (userName, password) NON - REGISTERED (preferences[0..*]) REGISTERED(regDate, benefit [0..*]) ID Find all functional and multivalued dependencies in the relational schemas USER, USERACCOUNT, NON-REGISTERED, and REGISTERED. Find all minimal keys in the relational schemas USER, USERACCOUNT, NON-REGISTERED, and REGISTERED. List the derivations of all minimal keys. For each one of the relational schemas find the highest normal form a schema is in. List the justifications for each highest normal form found. Decompose all relational schemas that are not in 4NF into 4NF. List all relational schemas obtained from the decompositions. Remember to indicate the primary key and foreign keys (if any)
Analysis of relational schemas and normalization Consider the following conceptual schema of a sample database domain that contains information about users, the type of users and the user's account of an application. (i) (ii) name address preferences [0..*] (iii) (iv) USER DOB tel [0..*] email [0..*] NON-REGISTERED 1988 ID ID ID creates UserType * REGISTERED regDate benefit [0..*] USERACCOUNT userName password The following are partially completed collection of relational schemas. USER(name, address, DOB, tel[0..*], email[0..*]) USERACCOUNT (userName, password) NON - REGISTERED (preferences[0..*]) REGISTERED(regDate, benefit [0..*]) ID Find all functional and multivalued dependencies in the relational schemas USER, USERACCOUNT, NON-REGISTERED, and REGISTERED. Find all minimal keys in the relational schemas USER, USERACCOUNT, NON-REGISTERED, and REGISTERED. List the derivations of all minimal keys. For each one of the relational schemas find the highest normal form a schema is in. List the justifications for each highest normal form found. Decompose all relational schemas that are not in 4NF into 4NF. List all relational schemas obtained from the decompositions. Remember to indicate the primary key and foreign keys (if any)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
![Analysis of relational schemas and normalization
Consider the following conceptual schema of a sample database domain that
contains information about users, the type of users and the user's account of an
application.
(i)
(ii)
name
address
preferences [0..*]
(iii)
(iv)
USER
DOB
tel [0..*]
email [0..*]
NON-REGISTERED
ID
ID
ID
creates
UserType
REGISTERED
regDate
benefit [0..*]
USERACCOUNT
userName
password
The following are partially completed collection of relational schemas.
USER(name, address, DOB, tel[0..*], email [0..*])
USERACCOUNT (userName, password)
NON-REGISTERED (preferences[0..*])
REGISTERED (regDate, benefit [0..*])
ID
Find all functional and multivalued dependencies in the relational schemas
USER, USERACCOUNT, NON-REGISTERED, and REGISTERED.
Find all minimal keys in the relational schemas USER, USERACCOUNT,
NON-REGISTERED, and REGISTERED. List the derivations of all minimal
keys.
For each one of the relational schemas find the highest normal form a
schema is in. List the justifications for each highest normal form found.
Decompose all relational schemas that are not in 4NF into 4NF. List all
relational schemas obtained from the decompositions. Remember to
indicate the primary key and foreign keys (if any).](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F84db7b9a-67d9-4622-a8f8-7c9363c4db26%2F1a4a6ec7-b3c9-4498-82de-44698b7132c8%2F33lhcu_processed.png&w=3840&q=75)
Transcribed Image Text:Analysis of relational schemas and normalization
Consider the following conceptual schema of a sample database domain that
contains information about users, the type of users and the user's account of an
application.
(i)
(ii)
name
address
preferences [0..*]
(iii)
(iv)
USER
DOB
tel [0..*]
email [0..*]
NON-REGISTERED
ID
ID
ID
creates
UserType
REGISTERED
regDate
benefit [0..*]
USERACCOUNT
userName
password
The following are partially completed collection of relational schemas.
USER(name, address, DOB, tel[0..*], email [0..*])
USERACCOUNT (userName, password)
NON-REGISTERED (preferences[0..*])
REGISTERED (regDate, benefit [0..*])
ID
Find all functional and multivalued dependencies in the relational schemas
USER, USERACCOUNT, NON-REGISTERED, and REGISTERED.
Find all minimal keys in the relational schemas USER, USERACCOUNT,
NON-REGISTERED, and REGISTERED. List the derivations of all minimal
keys.
For each one of the relational schemas find the highest normal form a
schema is in. List the justifications for each highest normal form found.
Decompose all relational schemas that are not in 4NF into 4NF. List all
relational schemas obtained from the decompositions. Remember to
indicate the primary key and foreign keys (if any).
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 4 steps
Follow-up Questions
Read through expert solutions to related follow-up questions below.
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY