Relation and relational schema, Database Management System

Assignment Help:

A relation has:

  • Relational Schema
  • Relation instance

Relational Schema:

A relational schema shows the relation's name, its attributes and the domain of every attribute. If R is the name of a relation and A1, A2...An is a list of attributes showing R then R (A1, A2...An) is known as a relational schema. Every attribute in this relational schema takes a value from some explicit domain called Domain (Ai).

For instance, the relational schema for relation PERSON as in Figure will be: PERSON (PERSON_ID:integer, NAME: string, AGE:integer, ADDRESS:string)

Total number of attributes in a relation indicates the degree of a relation. Hence the

PERSON relation includes four attributes, so this relation is of degree 4


Related Discussions:- Relation and relational schema

E-r model uses this symbol to represent weak entity set, E-R model uses thi...

E-R model uses this symbol to represent weak entity set ? A Doubly outlined rectangle symbol is used to represent weak entity set.

Alter table command, ALTER TABLE Command : This command is used for variati...

ALTER TABLE Command : This command is used for variation of existing structure of the table in the given situation: When a new column is to be added to the table structure.

Entity relationship diagram, The Enhanced Entity Relationship Diagram (ERD)...

The Enhanced Entity Relationship Diagram (ERD) produced with a drawing or case tool. Your EERD must use a ''standard'' notation style such as Crows Foot or Chen. Please note that t

Distinguish among different kinds of parameters, How can one distinguish am...

How can one distinguish among different kinds of parameters? Input parameters are used to pass data to subroutines. Output parameters are used to pass data from subrout

Illustrate the diagram - association as a cache, Association as a cache ...

Association as a cache This association must be updated when any new element is added to it, but testing for overlap using association is more efficient.    Figure:

Differentiate between logical database design and physical, Differentiate b...

Differentiate between logical database design and physical database design. Show how this separation leads to data independence? Basis Logical Databas

Define an operator that a relational algebra does not have, Define an opera...

Define an operator that a Relational Algebra does not have Ans: Relational Algebra does not have Aggregation operators.

Defining internal classes and operations, Defining Internal Classes and Ope...

Defining Internal Classes and Operations When we enlarge algorithms, new classes can be added to the store intermediate results. A complex operation could be looked at, as a c

What is a b+-tree index, What is a B+-Tree index? A B+-Tree index takes...

What is a B+-Tree index? A B+-Tree index takes the form of a balanced tree in which each path from the root of the root of the root of the tree to a leaf of the tree is of the

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