Relation schema for student, Database Management System

Example

RELATION SCHEMA for STUDENT:

STUDENT (Roll No: string, name: string, login: string, age: integer) RELATION INSTANCE

                                                STUDENT

 

         ROLLNO

NAME

 

AGE

t1          3467

Shikha

Noorie_jan@yahoo.com

20

 t2          4677

kanu

Golgin_atat@yahoo.com

20

Where t1 = (3467, Shikha, Noorie_jan@yahoo.com, 20) for this relation instance, m = 2 and n = 4.

Posted Date: 3/6/2013 5:20:35 AM | Location : United States







Related Discussions:- Relation schema for student, Assignment Help, Ask Question on Relation schema for student, Get Answer, Expert's Help, Relation schema for student Discussions

Write discussion on Relation schema for student
Your posts are moderated
Related Questions
Discuss the mechanism to read data from and write to a disk? Disk read/write heads are mechanisms in which read data from or write data to disk drives. The heads have gone by

i am not clear with the climetic condition of the north indian plain. can u plz explain it for me

Define a table in SQL known as Client that is used to store information about the clients. Define CLIENT_NO as the primary key whose first letter must begin with ‘C'. Also ensure t

Explain view in RDBMS? View - A view is a relation (virtual rather than base) and could be used in query expressions, which is, queries can be written by using the view as a re

A Functional dependency is described by X Y between two groups of attributes Y and X that are subsets of R specifies a constraint on the possible tuple that can make a relation

Define instance and schema? Instance: Collection of data stored in the data base at a certain moment is Schema: The overall design of the data base is known as the data base

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

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

If R1 and R2 are two union compatible relations or functions, then the result of R3 = R1 ∩R2 is the relation that contains all tuples that are in both the relations In other words,

Modify a sequence: ALTER SEQUENCE SEQSS INCREMENT 2 MAXVALUE 3000;   Removing a sequence: DROP SEQUENCE SEQSS;