(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

Ask an Expert

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

Write your message here..

Related Questions

Define granularity and hierarchy of granularity of locks, Define granularit... Define granularity, hierarchy of granularity of locks & multiple granularity locking. Explain the modified two phase locking along with multiple granularity locking. Ans: The s

A b-tree of order how much children m has maximum, A B-tree of order how mu... A B-tree of order how much children m has maximum ? m has maximum m mchildren in a B tree.

Type of views-data control, Type of views :  Simple views and Difficult ... Type of views :  Simple views and Difficult Views Feature Simple Views Complex Views Number of tables One

Explain th process to avoid re-computation, Saving Derived Attributes to Av... Saving Derived Attributes to Avoid Re-computation Data that is derived from other data should be stored in the computed form to avoid re-computation. For this, we could define

Define a relation in dbms, Define a relation ? Relation - A relations... Define a relation ? Relation - A relations is a named two-dimensional table of data. Mathematically, a relation can be described as a subset of the cartesian product of a lis

Enumerate about the high-level transitions result, Show, with the help of a... Show, with the help of an example, that relatively high-level transitions result when system or program is stimulated by the outside events. In diagram below, we can observe i

What do you mean by an execution plan, What do you mean by an execution pla... What do you mean by an execution plan? Why is it used? How will you view it? a.) An execution plan can be known as a road map which textually or graphically illustrates the dat

What are the desirable properties of a decomposition, Define What are the d... Define What are the desirable properties of a decomposition Ans: What are the desirable properties of decomposition - dependency preserving.  Because Lossless join and dependen

Er diagram, a publishing company produce scientific books on various subjec... a publishing company produce scientific books on various subjects. the books are written by authors who specialize in one particular subject. the company employs editors who, not n

E - r schema with weak entity, Consider the E/R schema with weak entity set... Consider the E/R schema with weak entity sets shown below. Come up with the SQL CREATE TABLE statements (with appropriate primary key, unique and foreign key constraints). Include