Determine bcnf-dcnf and key relation, Database Management System

(A) For the relation;

CarSales (RegNo, BuyerName, Address, SalesPerson, Make, Model, Commission)

The following functional dependences hold,

RegNo _ID à Make, Model

RegNoà Commission

RegNo, BuyerName à SalesPerson

BuyerName à Address

Make, Model à Commission

RegNo à SalesPerson

a. Use Inference rules to find the minimal basis and determine the Key of the relation

b. Based on this key, determine if the relation is in BCNF.

c. If it is not in BCNF then decompose the relation into BCNF.

3(B) The following relation holds details about cars ;

CAR_DETAILS(Registration_No , Make , Model , Tow_Load , Engine_Size, Colour )

And has the following functional dependencies;

Make , Model -> Engine_Size

Registration_No -> Make, Colour, Model

Engine_Size -> Tow_Load

The relation is decomposed into ;

CAR_DETAILS1(Registration_No , Colour, Make , Engine_Size* ,Model)

CAR_DETAILS2(Engine_Size, Tow_Load)

Prove that the decomposition is incomplete and complete the decomposition.

Posted Date: 3/19/2013 5:31:50 AM | Location : United States







Related Discussions:- Determine bcnf-dcnf and key relation, Assignment Help, Ask Question on Determine bcnf-dcnf and key relation, Get Answer, Expert's Help, Determine bcnf-dcnf and key relation Discussions

Write discussion on Determine bcnf-dcnf and key relation
Your posts are moderated
Related Questions
One-way Associations When an association is traversed only in the one direction, then it is implemented as a pointer i.e.an attribute which contains an object reference. If mu

Describe the types of attributes? Types of attributes: An attribute's category determines the type of values that are permitted in the attribute. For instance, the value vers

Describe a technique for direct search? Explain how data is stored within a file so which direct searching can be performed. For a file of unordered fixed length records by u

Define the terms i) Entity set ii) Relationship set Entity set: The set of all entities of the similar type is termed as an entity set. Relationship set: The set of all rela

Candidate Key:  In a relation R, a candidate key for R is a subset of the set of attributes of R, which have the differnt two properties: (1)        Uniqueness:                N

Describe sequential file organization.  Explain the rules for (i)  Inserting a new record. (ii)  Deleting an existing record.          Ans:A sequential f

Increased parallelism : Since the replicated date has several copies a query can be distributed or can be answered from the smallest loaded site. Also, with more replicas you have

Benefits of heap files 1.   This is a easy file Organisation method. 2.   Insertion is somehow capable. 3.   Good for bulk-loading data into a table. 4.   Best if file

Structure of Client Server Systems: In client/server architecture, clients show users who require services while servers give services. Both client and server are a combination of

Question: (a) e-Government implementations normally evolve through a multi-stage process. Describe, using appropriate examples, the stages involved in an e-Government implemen