KyaPoocha.com

Huge Collection of Interview Questions

Search our list of 7708 Interview Questions


What is a Relation Schema and a Relation? 

Posted in Database Interview Questions

A relation Schema denoted by R(A1, A2, …, An) is made up of the relation name R and the list of attributes Ai that it contains. A relation is defined as a set of tuples. Let r be the relation which contains set tuples (t1, t2, t3, …, tn). Each tuple is an ordered list of n-values t=(v1,v2, …, vn).

Post Your Answer!
Send This to a Friend

← What is Object Oriented model?
What is Data Storage - Definition Language? →

If you liked this question/asnwer, make sure you
Subscribe to KyaPoocha.com RSS feed!


BOOKMARK THIS : BlinkList | del.icio.us | Digg it | Furl | reddit | StumbleUpon | Yahoo MyWeb |

Related Interview Questions

  • What is Boyce Codd Normal form?  07.11.08

    A relation schema R is in BCNF with respect to a set F of functional dependencies if for all functional dependencies in F+ of the form a->b, where a and b is a...

  • what is BUS Schema?  22.09.08

    Bus Schema : Let we consider/explain these in x,y axis Dimension Table : A,B,C,D,E,F Fact Table: R,S...

  • What is Boyce Codd Normal form?  07.05.07

    A relation schema R is in BCNF with respect to a set F of functional dependencies if for all functional dependencies in F+ of the form a->b, where a and b is a...

  • What is degree of a Relation?  11.03.06

    It is the number of attribute of its relation schema....

  • What is 5NF?  11.03.06

    A Relation schema R is said to be 5NF if for every join dependency {R1, R2, ..., Rn} that holds R, one the following is true Ri = R for some i.The join depen...

  • What is 4NF?  11.03.06

    A relation schema R is said to be in 4NF if for every Multivalued dependency  X Y that holds over R, one of following is trueX is subset or equal to (or)...

  • What is BCNF (Boyce-Codd Normal Form)?  11.03.06

    A relation schema R is in BCNF if it is in 3NF and satisfies an additional constraint that for every FD XÂ Â Â Â A, X must be a candidate key....

  • What is 2NF?  11.03.06

    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 2NF?  11.03.06

    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...

  • How can you find the minimal key of relational schema?  08.03.06

    Minimal key is one which can identify each tuple of the given relation schema uniquely. For finding the minimal key it is required to find the closure that is t...