Produce a set of relations - normalisation, Database Management System

Produce a set of relations (equivalent to the Finkelstein entity list) in third normal form (3NF) from the following un-normalised relation. You must use the Finkelstein methodology as used in the study book and tutorials.

RESERVATION(reservation id, date of reservation, start date, end date, (( customer id, customer name, customer address, customer type, customer type description, ((customer preferences)), customer credit card number )), payment method, hotel id, hotel name, hotel address )

Notes:

1. A reservation is for one hotel only but could be for one or many customers.

2. There are three customer types: corporate, private and concession.

3. A customer may have many preferences, for example room type or a specific paper in the morning. There are no preference codes. Preferences are stored per reservation and are not held permanently.

Posted Date: 3/2/2013 2:12:00 AM | Location : United States







Related Discussions:- Produce a set of relations - normalisation, Assignment Help, Ask Question on Produce a set of relations - normalisation, Get Answer, Expert's Help, Produce a set of relations - normalisation Discussions

Write discussion on Produce a set of relations - normalisation
Your posts are moderated
Related Questions
What are the Issues when Selecting a Database Issues when Selecting a Database Storage space requirement: A database requires about triple storage space of the actua

State your technical objectives for mining the data. Data Understanding. Describe the data For each attribute, give its description and data type. For numeric attributes

Self-Join:   In a self join a table is joined with itself.  Let consider the following sample partial data of EMP table EMPNO ENAME MGRID

what factors might influence a company to outsource its IT infrascture.

Question: (a) Use the following business rules to produce the E-R diagram. You should clearly show all the minimum and maximum cardinality constraint on each side of the relati

Consider the following frequency counts of some itemsets in a transaction database r : freq({A}, r) = 0.405 freq({B}, r) = 0.510 freq({C}, r) = 0.303 freq({A

What is 2NF? A relation schema R is in 2NF if it is in 1NF and every non-prime attribute A in R is fully functionally dependent on primary key.

What is DDL? Make a list of commands with short description used in DDL Ans: Data Definition Language that is abbreviated as DDL is a computer language for defining data struct

Discuss deferred update technique of recovery.  What are the advantages?  Ans:  The deferred update methods do not physically update the database on disk till after a transact

) Define a job scheduling strategy that will meet business requirement of reporting availability by 6am CST for the following cubes? Show the job scheduling dependencies in a picto