What is the candidate key for a table with columns, Database Management System

Assignment Help:

For problems 1-4, give all candidate keys for the tables with FDs specified.  Composite candidate keys must be put in parentheses, and candidate keys must be separated with commas or otherwise clearly specified.  For example, "A, B, C"  means that there are three candidate keys, but "(ABC)" means that there is one composite candidate key and "(ABC), E" means that there are two candidate keys, the composite of three colums (A B C) plus the single column E.  Please be very specific for full credit. 

1. What is (are) the candidate key(s) for a table with columns
                        A B C D E F G H I J
            and the following set of functional dependencies? 

A B → J

D → B

J→ C E F G H I

2. What is (are) the candidate key(s) for a table with columns
                        L M N O P Q
and the following set of functional dependencies? 

L→ M N

O → L P Q

3. What is (are) the candidate key(s) for a table with columns
                        A B C D E F G H I
  and the following set of functional dependencies? 

A → C D E F

E→G H I

6.What is (are) the candidate key(s) for a table with columns
                        M N O P Q R S T U
and the following set of functional dependencies? 

M →N O P

O P →M

N → Q R S T


Related Discussions:- What is the candidate key for a table with columns

Which database object does not physically exist, Which database object does...

Which database object does not physically exist? A view database object does not physically exist.

Define view? how it is related to data independence, A View may be defi...

A View may be defined of as a virtual table, that is, a table that does not really exist in its own right but is instead inferred from one or more underlying base data table. T

Explain the term- periodic recomputation, Explain the term- Periodic recomp...

Explain the term- Periodic recomputation Periodic recomputation:  Base values are often updated in bunches. Sometimes, it is possible to just recompute all derived attributes p

Describe specialsation and generalization, Describe Specialsation and gener...

Describe Specialsation and generalization? Specialisation /generalization: This is a top down and bottom up approach to the design of database. It displays the IS_A relation

Illustrate the cardinality of relationship, Cardinality of Relationship ...

Cardinality of Relationship One-to-One Only one entity of the first set is linked to only one entity of the second set. E.g. A teacher teaches a student. Only one teacher

Data model in DBMS, how many types of data model in DBMS? explain data abst...

how many types of data model in DBMS? explain data abstraction with its different level

Describe the concept of aggregation, Aggregation Aggregation is strong...

Aggregation Aggregation is stronger form of association. It represents the "has-a" or "part-of" relationship. An aggregation association depicts a complex object which is comp

What is bcnf boyce-codd normal form, BCNF Boyce-Codd Normal Form A rel...

BCNF Boyce-Codd Normal Form A relation schema R is in BCNF if it is in 3NF and accepts an additional constraint that for every FD X A, X has to be a candidate key. If a relati

What is nested trigger, What is Nested Trigger? A trigger can also havi...

What is Nested Trigger? A trigger can also having INSERT, UPDATE and DELETE logic within itself, so when the trigger is fired because of data modification it can also cause ano

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd